Co-occurring keywords
Papers
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees
COLT 2022
Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond
NIPS 2022
Dueling Convex Optimization
ICML 2021
Boosting for Online Convex Optimization
ICML 2021
Revisiting Smoothed Online Learning
NIPS 2021
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions
NIPS 2021
Online Boosting with Bandit Feedback
ALT 2021