research
∙
05/30/2023
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
The study of collaborative multi-agent bandits has attracted significant...
share
research
∙
03/23/2022
Minimax Regret for Cascading Bandits
Cascading bandits model the task of learning to rank K out of L items ov...
research
∙
02/28/2022
Robust Multi-Agent Bandits Over Undirected Graphs
We consider a multi-agent multi-armed bandit setting in which n honest a...
research
∙
09/12/2021
Improved Algorithms for Misspecified Linear Markov Decision Processes
For the misspecified linear Markov decision process (MLMDP) model of Jin...
research
∙
05/04/2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
We propose two algorithms for episodic stochastic shortest path problems...
research
∙
12/04/2020
One-bit feedback is sufficient for upper confidence bound policies
We consider a variant of the traditional multi-armed bandit problem in w...
research
∙
07/07/2020
Robust Multi-Agent Multi-Armed Bandits
There has been recent interest in collaborative multi-agent bandits, whe...
research
∙
02/18/2020
Empirical Policy Evaluation with Supergraphs
We devise and analyze algorithms for the empirical policy evaluation pro...
research
∙
07/05/2019
Restart perturbations for lazy, reversible Markov chains: trichotomy and pre-cutoff equivalence
Given a lazy, reversible Markov chain with n states and transition matri...
research
∙
04/29/2019
Local non-Bayesian social learning with stubborn agents
In recent years, people have increasingly turned to social networks like...
research
∙
04/09/2018