Between Stochastic and Adversarial Online Convex Optimization: Improved
Regret Bounds via Smoothness

v1v2 (latest)

Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness

15 February 2022

Cristóbal Guzmán

ArXiv (abs)PDF HTML

Papers citing "Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness"

19 / 19 papers shown

Title
A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent Shuche Wang Vincent Y. F. Tan FedML OOD 87 1 0 19 Jul 2024
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization Peng Zhao Yu Zhang Lijun Zhang Zhi Zhou 90 50 0 29 Dec 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems Shinji Ito 64 22 0 22 Sep 2021
Optimal Rates for Random Order Online Optimization Uri Sherman Tomer Koren Yishay Mansour 42 8 0 29 Jun 2021
Smoothed Analysis with Adaptive Adversaries Nika Haghtalab Tim Roughgarden Abhishek Shetty AAML 100 54 0 16 Feb 2021
Dynamic Regret of Convex and Smooth Functions Peng Zhao Yu Zhang Lijun Zhang Zhi Zhou 92 105 0 07 Jul 2020
Prediction with Corrupted Expert Advice I Zaghloul Amir Idan Attias Tomer Koren Roi Livni Yishay Mansour 55 40 0 24 Feb 2020
Introduction to Online Convex Optimization Elad Hazan OffRL 188 1,939 0 07 Sep 2019
Anytime Online-to-Batch Conversions, Optimism, and Acceleration Ashok Cutkosky 47 7 0 03 Mar 2019
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits Julian Zimmert Yevgeny Seldin AAML 169 182 0 19 Jul 2018
A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds Pooria Joulani András Gyorgy Csaba Szepesvári 44 42 0 08 Sep 2017
Accelerating Stochastic Gradient Descent For Least Squares Regression Prateek Jain Sham Kakade Rahul Kidambi Praneeth Netrapalli Aaron Sidford 71 84 0 26 Apr 2017
Scale-Free Online Learning Francesco Orabona D. Pál 68 104 0 08 Jan 2016
Optimization, Learning, and Games with Predictable Sequences Alexander Rakhlin Karthik Sridharan 108 380 0 08 Nov 2013
Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming Saeed Ghadimi Guanghui Lan ODL 122 1,562 0 22 Sep 2013
On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions Purushottam Kar Bharath K. Sriperumbudur Prateek Jain H. Karnick 71 113 0 11 May 2013
Follow the Leader If You Can, Hedge If You Must S. D. Rooij T. Erven Peter Grünwald Wouter M. Koolen 202 181 0 03 Jan 2013
Online Learning with Predictable Sequences Alexander Rakhlin Karthik Sridharan 212 362 0 18 Aug 2012
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization Alekh Agarwal Peter L. Bartlett Pradeep Ravikumar Martin J. Wainwright 210 251 0 03 Sep 2010

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.