research
∙
07/04/2023
Generalization Guarantees via Algorithm-dependent Rademacher Complexity
Algorithm- and data-dependent generalization bounds are required to expl...
share
research
∙
04/25/2023
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games
In the first-order query model for zero-sum K× K matrix games, playersob...
research
∙
03/06/2023
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
Stochastic and adversarial data are two widely studied settings in onlin...
research
∙
02/15/2022
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
Stochastic and adversarial data are two widely studied settings in onlin...
research
∙
07/05/2021
Robust Online Convex Optimization in the Presence of Outliers
We consider online convex optimization when a number k of data points ar...
research
∙
11/09/2015
