Co-occurring keywords
Papers
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
ICML 2023
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits
AISTATS 2023
An Optimization-based Algorithm for Non-stationary Kernel Bandits without Prior Knowledge
AISTATS 2023
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
AISTATS 2022
Parameter-free Mirror Descent
COLT 2022
Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity
NIPS 2022
Optimal Dynamic Regret in LQR Control
NIPS 2022