Fetching the paper…
Reading the bibliography…
We consider online algorithms under both the competitive ratio criteria and the regret minimization one.
Amortized efficiency of list update and paging rules
Daniel D Sleator and Robert E Tarjan · 1985
Earlier work this paper cites.
Probabilistic analysis of packing and partitioning algorithms
Edward G. Coffman and George S. Lueker · 1991
Earlier work this paper cites.
Competitive paging algorithms
Amos Fiat, Richard M Karp, Michael Luby, Lyle A McGeoch, Daniel D Sleator, and Neal E Young · 1991
Earlier work this paper cites.
An optimal on-line algorithm for metrical task system
Allan Borodin, Nathan Linial, and Michael E Saks · 1992
Earlier work this paper cites.
The weighted majority algorithm
N. Littlestone and Manfred K. Warmuth · 1994
Earlier work this paper cites.
On the k-server conjecture
Elias Koutsoupias and Christos H Papadimitriou · 1995
Earlier work this paper cites.
A polylog (n)-competitive algorithm for metrical task systems
Yair Bartal, Avrim Blum, Carl Burch, and Andrew Tomkins · 1997
Earlier work this paper cites.
How to use expert advice
Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, and Manfred K. Warmuth · 1997
Earlier work this paper cites.
Online Computation and Competitive Analysis
A. Borodin and R. El-Yaniv · 1998
Earlier work this paper cites.
Tracking the best expert
Mark Herbster and Manfred K Warmuth · 1998
Earlier work this paper cites.
On-line learning and the metrical task system problem
Avrim Blum and Carl Burch · 2000
Earlier work this paper cites.
Static optimality and dynamic search-optimality in lists and trees
Avrim Blum, Shuchi Chawla, and Adam Kalai · 2002
Earlier work this paper cites.
A new greedy approach for facility location problems
Kamal Jain, Mohammad Mahdian, and Amin Saberi · 2002
Earlier work this paper cites.
Tracking a small set of experts by mixing past posteriors
Olivier Bousquet and Manfred K Warmuth · 2003
Earlier work this paper cites.
Better algorithms for unfair metrical task systems and applications
Amos Fiat and Manor Mendel · 2003
Cited alongside, same era.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Cited alongside, same era.
On metric ramsey-type phenomena
Yair Bartal, Nathan Linial, Manor Mendel, and Assaf Naor · 2005
Cited alongside, same era.
Efficient algorithms for online decision problems
A. Kalai and S. Vempala · 2005
Cited alongside, same era.
Ramsey-type theorems for metric spaces with applications to online problems
Yair Bartal, Béla Bollobás, and Manor Mendel · 2006
Cited alongside, same era.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
A tale of two metrics: Simultaneous bounds on competitiveness and regret
Lachlan LH Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, and Adam Wierman · 2013
Later among the works it cites.
Online learning with switching costs and other adaptive adversaries
Nicolo Cesa-Bianchi, Ofer Dekel, and Ohad Shamir · 2013
Later among the works it cites.
Online optimization in dynamic environments
Eric C Hall and Rebecca M Willett · 2013
Later among the works it cites.
Optimal amortized regret in every interval
Rina Panigrahy and Preyas Popat · 2013
Later among the works it cites.
Optimization, learning, and games with predictable sequences
Sasha Rakhlin and Karthik Sridharan · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
From external to internal regret
A. Blum and Y. Mansour · 2007
Cited alongside, same era.
Adaptive algorithms for online decision problems
Elad Hazan and C Seshadhri · 2007
Cited alongside, same era.
A regularization approach to metrical task systems
Jacob Abernethy, Peter L Bartlett, Niv Buchbinder, and Isabelle Stanton · 2010
Cited alongside, same era.
Regret minimization for online buffering problems using the weighted majority algorithm
Sascha Geulen, Berthold Vöcking, and Melanie Winkler · 2010
Cited alongside, same era.
Prediction strategies without loss
Michael Kapralov and Rina Panigrahy · 2011
Cited alongside, same era.
A closer look at adaptive regret
Dmitry Adamskiy, Wouter M Koolen, Alexey Chernov, and Vladimir Vovk · 2012
Cited alongside, same era.
Bandits with switching costs: T 2/3 regret
Ofer Dekel, Jian Ding, Tomer Koren, and Yuval Peres · 2014
Later among the works it cites.
A polylogarithmic-competitive algorithm for the k-server problem
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, and Joseph Naor · 2015
Later among the works it cites.
An improved approximation for k-median, and positive correlation in budgeted optimization
Jarosław Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, and Khoa Trinh · 2015
Later among the works it cites.
Strongly adaptive online learning
Amit Daniely, Alon Gonen, and Shai Shalev-Shwartz · 2015
Later among the works it cites.
Online optimization: Competing with dynamic comparators
Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan · 2015
Later among the works it cites.
Achieving all with no parameters: Adaptive normalhedge
Haipeng Luo and Robert E Schapire · 2015
Later among the works it cites.
The computational power of optimization in online learning
Elad Hazan and Tomer Koren · 2016
Later among the works it cites.
k-server via multiscale entropic regularization
Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee, and Aleksander Madry · 2017
Later among the works it cites.
Online learning over a finite action set with limited switching
Jason Altschuler and Kunal Talwar · 2018
Later among the works it cites.