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

24 October 2019

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

7 / 7 papers shown

Title
Private Online Learning via Lazy Algorithms Hilal Asi Tomer Koren Daogao Liu Kunal Talwar 83 0 0 05 Jun 2024
Private Online Prediction from Experts: Separations and Faster Rates Hilal Asi Vitaly Feldman Tomer Koren Kunal Talwar FedML 19 18 0 24 Oct 2022
Universal Caching Ativ Joshi Abhishek Sinha OffRL 32 2 0 10 May 2022
Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning Yingjie Fei Zhuoran Yang Yudong Chen Zhaoran Wang 29 46 0 06 Nov 2021
Kernel-based methods for bandit convex optimization Sébastien Bubeck Ronen Eldan Y. Lee 76 163 0 11 Jul 2016
Prediction by Random-Walk Perturbation Luc Devroye Gábor Lugosi Gergely Neu 47 37 0 23 Feb 2013
Optimal Distributed Online Prediction using Mini-Batches O. Dekel Ran Gilad-Bachrach Ohad Shamir Lin Xiao 166 683 0 07 Dec 2010