Proximal Online Gradient is Optimum for Dynamic Regret

v1v2v3v4v5v6 (latest)

Proximal Online Gradient is Optimum for Dynamic Regret

8 October 2018

ArXiv (abs)PDF HTML

Papers citing "Proximal Online Gradient is Optimum for Dynamic Regret"

6 / 6 papers shown

Title
Introduction to Online Convex Optimization Elad Hazan OffRL 175 1,932 0 07 Sep 2019
Adaptive Online Learning in Dynamic Environments Lijun Zhang Shiyin Lu Zhi Zhou 67 185 0 25 Oct 2018
An Online Convex Optimization Approach to Dynamic Network Resource Allocation Tianyi Chen Qing Ling G. Giannakis 399 216 0 14 Jan 2017
Strongly Adaptive Online Learning Amit Daniely Alon Gonen Shai Shalev-Shwartz ODL 167 178 0 25 Feb 2015
Non-stationary Stochastic Optimization Omar Besbes Y. Gur A. Zeevi 183 434 0 20 Jul 2013
Mirror Descent Meets Fixed Share (and feels no regret) Nicolò Cesa-Bianchi Pierre Gaillard Gabor Lugosi Gilles Stoltz 202 99 0 15 Feb 2012