← Back to papers
2015 ICML ICML 2015

Strongly Adaptive Online Learning

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.

🧭 Keyword Pioneer — algorithm performance
🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio
🌉 Interdisciplinary Bridge — Machine Learning and Mathematics & Optimization
🐣 Hot Topic Early Bird — learning theory

Authors

Amit Daniely , Alon Gonen , Shai Shalev-shwartz

Topics

Machine Learning > Optimization & Theory > Learning Theory Mathematics & Optimization > Optimization > Online Algorithms Machine Learning > Learning Types > Online Learning Machine Learning > Optimization & Theory > Online Algorithms

Keywords

learning theory online learning regret minimization adaptive algorithm low regret algorithm performance time interval
Download PDF

Related papers

PeakSeg: constrained optimal segmentation and supervised penalty learning for peak detection in count data 2015
The Benefits of Learning with Strongly Convex Approximate Inference 2015
Tracking Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains 2015
Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds 2015
Unsupervised Riemannian Metric Learning for Histograms Using Aitchison Transformations 2015