Metrical task systems on trees via mirror descent and unfair gluing

  title={Metrical task systems on trees via mirror descent and unfair gluing},
  author={S{\'e}bastien Bubeck and M. B. Cohen and J. Lee and Y. Lee},
We consider metrical task systems on tree metrics, and present an $O(\mathrm{depth} \times \log n)$-competitive randomized algorithm based on the mirror descent framework introduced in our prior work on the $k$-server problem. For the special case of hierarchically separated trees (HSTs), we use mirror descent to refine the standard approach based on gluing unfair metrical task systems. This yields an $O(\log n)$-competitive algorithm for HSTs, thus removing an extraneous $\log\log n$ in the… Expand
10 Citations
Pure entropic regularization for metrical task systems
  • 4
  • PDF
Parametrized Metrical Task Systems
  • 2
  • PDF
Dimension-Free Bounds on Chasing Convex Functions
  • 1
  • PDF
The Online Min-Sum Set Cover Problem
  • 2
  • PDF
Online metric algorithms with untrusted predictions
  • 15
  • PDF
Robust Algorithms for Online Convex Problems via Primal-Dual
  • PDF
Understand Dynamic Regret with Switching Cost for Online Decision Making
  • 2
  • PDF
The Statistical Complexity of Early Stopped Mirror Descent
  • 3
  • PDF


Metrical Task Systems and the k-Server Problem on HSTs
  • 19
  • PDF
A polylog(n)-competitive algorithm for metrical task systems
  • 99
  • PDF
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
  • 28
k-server via multiscale entropic regularization
  • 49
  • PDF
Better algorithms for unfair metrical task systems and applications
  • 58
  • PDF
Unfair Problems and Randomized Algorithms for Metrical Task Systems
  • S. Seiden
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1999
  • 22
  • PDF
A tight bound on approximating arbitrary metrics by tree metrics
  • 849
  • PDF
Ramsey-type theorems for metric spaces with applications to online problems
  • 56
  • PDF
On metric Ramsey-type phenomena
  • 89
  • PDF
Probabilistic approximation of metric spaces and its algorithmic applications
  • Y. Bartal
  • Computer Science
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
  • 711