Pure entropic regularization for metrical task systems

Christian Coester, James R. Lee
Proceedings of the Thirty-Second Conference on Learning Theory, PMLR 99:835-848, 2019.

Abstract

We show that on every n-point HST metric, there is a randomized online algorithm for metrical task systems (MTS) that is 1-competitive for service costs and O(logn)-competitive for movement costs. In general, these refined guarantees are optimal up to the implicit constant. While an O(logn)-competitive algorithm for MTS on HST metrics was developed by Bubeck et al. (2018), that approach could only establish an O((logn)2)-competitive ratio when the service costs are required to be O(1)-competitive. Our algorithm is an instantiation of online mirror descent with the regularizer derived from a multiscale conditional entropy. In fact, our algorithm satisfies a set of even more refined guarantees; we are able to exploit this property to combine it with known random embedding theorems and obtain, for {\em any} n-point metric space, a randomized algorithm that is 1-competitive for service costs and O((logn)2)-competitive for movement costs.

Cite this Paper

BibTeX
@InProceedings{pmlr-v99-coester19a, title = {Pure entropic regularization for metrical task systems}, author = {Coester, Christian and Lee, James R.}, booktitle = {Proceedings of the Thirty-Second Conference on Learning Theory}, pages = {835--848}, year = {2019}, editor = {Beygelzimer, Alina and Hsu, Daniel}, volume = {99}, series = {Proceedings of Machine Learning Research}, month = {25--28 Jun}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v99/coester19a/coester19a.pdf}, url = {https://proceedings.mlr.press/v99/coester19a.html}, abstract = {We show that on every $n$-point HST metric, there is a randomized online algorithm for metrical task systems (MTS) that is $1$-competitive for service costs and $O(\log n)$-competitive for movement costs. In general, these refined guarantees are optimal up to the implicit constant. While an $O(\log n)$-competitive algorithm for MTS on HST metrics was developed by Bubeck et al. (2018), that approach could only establish an $O((\log n)^2)$-competitive ratio when the service costs are required to be $O(1)$-competitive. Our algorithm is an instantiation of online mirror descent with the regularizer derived from a multiscale conditional entropy. In fact, our algorithm satisfies a set of even more refined guarantees; we are able to exploit this property to combine it with known random embedding theorems and obtain, for {\em any} $n$-point metric space, a randomized algorithm that is $1$-competitive for service costs and $O((\log n)^2)$-competitive for movement costs.} }
Endnote
%0 Conference Paper %T Pure entropic regularization for metrical task systems %A Christian Coester %A James R. Lee %B Proceedings of the Thirty-Second Conference on Learning Theory %C Proceedings of Machine Learning Research %D 2019 %E Alina Beygelzimer %E Daniel Hsu %F pmlr-v99-coester19a %I PMLR %P 835--848 %U https://proceedings.mlr.press/v99/coester19a.html %V 99 %X We show that on every $n$-point HST metric, there is a randomized online algorithm for metrical task systems (MTS) that is $1$-competitive for service costs and $O(\log n)$-competitive for movement costs. In general, these refined guarantees are optimal up to the implicit constant. While an $O(\log n)$-competitive algorithm for MTS on HST metrics was developed by Bubeck et al. (2018), that approach could only establish an $O((\log n)^2)$-competitive ratio when the service costs are required to be $O(1)$-competitive. Our algorithm is an instantiation of online mirror descent with the regularizer derived from a multiscale conditional entropy. In fact, our algorithm satisfies a set of even more refined guarantees; we are able to exploit this property to combine it with known random embedding theorems and obtain, for {\em any} $n$-point metric space, a randomized algorithm that is $1$-competitive for service costs and $O((\log n)^2)$-competitive for movement costs.
APA
Coester, C. & Lee, J.R.. (2019). Pure entropic regularization for metrical task systems. Proceedings of the Thirty-Second Conference on Learning Theory, in Proceedings of Machine Learning Research 99:835-848 Available from https://proceedings.mlr.press/v99/coester19a.html.

Related Material