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...
share
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
∙
02/11/2022
Scale-free Unconstrained Online Learning for Curved Losses
A sequence of works in unconstrained online convex optimisation have inv...
research
∙
02/15/2021
Distributed Online Learning for Joint Regret with Communication Constraints
In this paper we consider a distributed online learning setting for jo...
research
∙
10/05/2020
Diversity-Preserving K-Armed Bandits, Revisited
We consider the bandit-based framework for diversity-preserving recommen...
research
∙
06/05/2020
Adaptation to the Range in K-Armed Bandits
We consider stochastic bandit problems with K arms, each associated with...
research
∙
05/24/2019
Polynomial Cost of Adaptation for X -Armed Bandits
In the context of stochastic continuum-armed bandits, we present an algo...
research
∙
05/14/2018