Minimax Regret of Switching-Constrained Online Convex Optimization: No
Phase Transition

v1v2v3 (latest)

Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition

24 October 2019

Hannah Lawrence

ArXiv (abs)PDF HTML

Papers citing "Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition"

13 / 13 papers shown

Title
Private Online Learning via Lazy Algorithms Hilal Asi Tomer Koren Daogao Liu Kunal Talwar 185 1 0 05 Jun 2024
Online learning over a finite action set with limited switching Jason M. Altschuler Kunal Talwar 60 38 0 05 Mar 2018
Kernel-based methods for bandit convex optimization Sébastien Bubeck Ronen Eldan Y. Lee 449 165 0 11 Jul 2016
An optimal algorithm for bandit convex optimization Elad Hazan Yuanzhi Li 86 49 0 14 Mar 2016
Bandit Convex Optimization: sqrt{T} Regret in One Dimension Sébastien Bubeck O. Dekel Tomer Koren Yuval Peres 126 36 0 23 Feb 2015
$Bandits with Switching Costs: T^{2/3} Regret$ Bandits with Switching Costs: T^{2/3} Regret O. Dekel Jian Ding Tomer Koren Yuval Peres 95 99 0 11 Oct 2013
Prediction by Random-Walk Perturbation Luc Devroye Gábor Lugosi Gergely Neu 100 37 0 23 Feb 2013
Online Learning with Switching Costs and Other Adaptive Adversaries Nicolò Cesa-Bianchi O. Dekel Ohad Shamir 102 120 0 18 Feb 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization H. B. McMahan 98 42 0 08 Feb 2013
Online Portfolio Selection: A Survey Bin Li Guosheng Lin 132 267 0 10 Dec 2012
Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret R. Arora O. Dekel Ambuj Tewari OffRL 91 196 0 27 Jun 2012
Optimal Distributed Online Prediction using Mini-Batches O. Dekel Ran Gilad-Bachrach Ohad Shamir Lin Xiao 273 685 0 07 Dec 2010
A Stochastic View of Optimal Regret through Minimax Duality Jacob D. Abernethy Alekh Agarwal Peter L. Bartlett Alexander Rakhlin 94 93 0 30 Mar 2009