Online Optimization : Competing with Dynamic Comparators

Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, Karthik Sridharan

Type: Preprint

Publication Date: 2015-01-01

Citations: 116

DOI: https://doi.org/10.48550/arxiv.1501.06225

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Online Optimization : Competing with Dynamic Comparators	2015	Ali Jadbabaie Alexander Rakhlin Shahin Shahrampour Karthik Sridharan
+	Adaptive Online Learning in Dynamic Environments	2018	Lijun Zhang Shiyin Lu Zhi‐Hua Zhou
+	Adaptive Online Learning in Dynamic Environments	2018	Lijun Zhang Shiyin Lu Zhi‐Hua Zhou
+	A closer look at temporal variability in dynamic online learning	2021	Nicolò Campolongo Francesco Orabona
+	Optimal Comparator Adaptive Online Learning with Switching Cost	2022	Zhe Zhang Ashok Cutkosky Ioannis Ch. Paschalidis
+	On the Computational Efficiency of Adaptive and Dynamic Regret Minimization	2022	Lu Zhou Elad Hazan
+	Online Learning with Continuous Variations: Dynamic Regret and Reductions	2019	Ching-An Cheng Jonathan Lee Ken Goldberg Byron Boots
+	Online Learning with Continuous Variations: Dynamic Regret and Reductions	2019	Ching-An Cheng Jonathan Lee Ken Goldberg Byron Boots
+ PDF Chat	An Equivalence Between Static and Dynamic Regret Minimization	2024	Andrew Jacobsen Francesco Orabona
+	Universal Online Convex Optimization with Minimax Optimal Second-Order Dynamic Regret	2019	Hakan Gökcesu Süleyman S. Kozat
+ PDF Chat	Universal Online Convex Optimization with Minimax Optimal Second-Order Dynamic Regret	2024	Hakan Gökcesu Süleyman S. Kozat
+	Adaptive Hedge	2011	Tim van Erven Peter Grünwald Wouter M. Koolen Steven de Rooij
+	Adaptive Hedge	2011	Tim van Erven Peter Grünwald Wouter M. Koolen Steven de Rooij
+	Revisiting Smoothed Online Learning	2021	Lijun Zhang Wei Jiang Shiyin Lu Tianbao Yang
+	Online Optimization with Predictions and Non-convex Losses	2020	Yiheng Lin Gautam Goel Adam Wierman
+ PDF Chat	Online Optimization with Predictions and Non-convex Losses	2020	Yiheng Lin Gautam Goel Adam Wierman
+	Revisiting Smoothed Online Learning	2021	Lijun Zhang Wei Jiang Shiyin Lu Tianbao Yang
+	Locally-Adaptive Nonparametric Online Learning	2020	Ilja Kuzborskij Nicolò Cesa‐Bianchi
+	Online Multiobjective Minimax Optimization and Applications	2021	Georgy Noarov Mallesh M. Pai Aaron Roth
+ PDF Chat	Discounted Adaptive Online Prediction	2024	Zhe Zhang David Bombara Heng Yang

Works That Cite This (92)

Action	Title	Year	Authors
+	Bandit Convex Optimization for Scalable and Dynamic IoT Management	2018	Tianyi Chen Georgios B. Giannakis
+	Understand Dynamic Regret with Switching Cost for Online Decision Making	2019	Yawei Zhao Qian Zhao Xingxing Zhang En Zhu Xinwang Liu Jianping Yin
+	Dynamic Regret of Policy Optimization in Non-stationary Environments	2020	Yingjie Fei Zhuoran Yang Zhaoran Wang Qiaomin Xie
+ PDF Chat	Tracking Moving Agents via Inexact Online Gradient Descent Algorithm	2018	Amrit Singh Bedi P.S. Sarma Ketan Rajawat
+	A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free	2019	Yifang Chen Chung‐Wei Lee Haipeng Luo Chen-Yu Wei
+	Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend	2019	Yawei Zhao Chen Yu Peilin Zhao Hanlin Tang Shuang Qiu Ji Liu
+	Predictor-Corrector Policy Optimization	2018	Ching-An Cheng Xinyan Yan Nathan Ratliff Byron Boots
+	Nonstationary Nonparametric Online Learning: Balancing Dynamic Regret and Model Parsimony	2019	Amrit Singh Bedi Alec Koppel Ketan Rajawat Brian M. Sadler
+	Optimal Dynamic Regret in Exp-Concave Online Learning	2021	Dheeraj Baby Yu-Xiang Wang
+ PDF Chat	Delay-Tolerant Constrained OCO with Application to Network Resource Allocation	2021	Juncheng Wang Ben Liang Min Dong Gary Boudreau Hatem Abou‐zeid

Works Cited by This (6)

Action	Title	Year	Authors
+	Online Optimization in Dynamic Environments	2013	Eric C. Hall Rebecca Willett
+	Mirror descent and nonlinear projected subgradient methods for convex optimization	2003	Amir Beck Marc Teboulle
+ PDF Chat	Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems	2004	Arkadi Nemirovski
+	Optimization, Learning, and Games with Predictable Sequences	2013	Sasha Rakhlin Karthik Sridharan
+	Online convex programming and generalized infinitesimal gradient ascent	2003	Martin Zinkevich
+	A New Look at Shifting Regret	2012	Nicolò Cesa‐Bianchi Pierre Gaillard Gábor Lugosi Gilles Stoltz