Abstract
Strongly adaptive algorithms are algorithms whose performance on every time interval is close to.optimal. We present a reduction that can transform standard low-regret algorithms to strongly adaptive. As a consequence, we derive simple, yet efficient, strongly adaptive algorithms for a handful of problems.
| Original language | English |
|---|---|
| Title of host publication | 32nd International Conference on Machine Learning, ICML 2015 |
| Editors | David Blei, Francis Bach |
| Publisher | International Machine Learning Society (IMLS) |
| Pages | 1405-1411 |
| Number of pages | 7 |
| ISBN (Electronic) | 9781510810587 |
| State | Published - 2015 |
| Event | 32nd International Conference on Machine Learning, ICML 2015 - Lile, France Duration: 6 Jul 2015 → 11 Jul 2015 |
Publication series
| Name | 32nd International Conference on Machine Learning, ICML 2015 |
|---|---|
| Volume | 2 |
Conference
| Conference | 32nd International Conference on Machine Learning, ICML 2015 |
|---|---|
| Country/Territory | France |
| City | Lile |
| Period | 6/07/15 → 11/07/15 |
Bibliographical note
Publisher Copyright:Copyright © 2015 by the author(s).