Co-occurring keywords
Papers
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses
NIPS 2020
Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks
AISTATS 2020
Faster Projection-free Online Learning
COLT 2020
Projection-free Distributed Online Convex Optimization with $O(\sqrtT)$ Communication Complexity
ICML 2020
Risk-Averse Stochastic Convex Bandit
AISTATS 2019