research
∙
05/26/2023
A Mechanism for Sample-Efficient In-Context Learning for Sparse Retrieval Tasks
We study the phenomenon of in-context learning (ICL) exhibited by large ...
share
research
∙
02/07/2023
Leveraging User-Triggered Supervision in Contextual Bandits
We study contextual bandit (CB) problems, where the user can sometimes r...
research
∙
06/20/2022
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality
We revisit the problem of stochastic online learning with feedback graph...
research
∙
10/25/2021
The Pareto Frontier of model selection for general Contextual Bandits
Recent progress in model selection raises the question of the fundamenta...
research
∙
07/02/2021
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning
We provide improved gap-dependent regret bounds for reinforcement learni...
research
∙
06/16/2020
Corralling Stochastic Bandit Algorithms
We study the problem of corralling stochastic bandit algorithms, that is...
research
∙
02/22/2020
Private Stochastic Convex Optimization: Efficient Algorithms for Non-smooth Objectives
In this paper, we revisit the problem of private stochastic convex optim...
research
∙
07/29/2019
Bandits with Feedback Graphs and Switching Costs
We study the adversarial multi-armed bandit problem where partial observ...
research
∙
11/09/2018
Policy Regret in Repeated Games
The notion of policy regret in online learning is a well defined? perfor...
research
∙
08/02/2018
Streaming Kernel PCA with Õ(√(n)) Random Features
We study the statistical and computational aspects of kernel principal c...
research
∙
02/22/2017
