research
∙
05/17/2023
Sequential Best-Arm Identification with Application to Brain-Computer Interface
A brain-computer interface (BCI) is a technology that enables direct com...
share
research
∙
03/20/2023
Bridging Imitation and Online Reinforcement Learning: An Optimistic Tale
In this paper, we address the following problem: Given an offline demons...
research
∙
02/07/2023
Leveraging Demonstrations to Improve Online Learning: Quality Matters
We investigate the extent to which offline demonstration data can improv...
research
∙
01/29/2023
Sample Efficient Deep Reinforcement Learning via Local Planning
The focus of this work is sample-efficient deep reinforcement learning (...
research
∙
06/09/2022
Regret Bounds for Information-Directed Reinforcement Learning
Information-directed sampling (IDS) has revealed its potential as a data...
research
∙
05/22/2022
Contextual Information-Directed Sampling
Information-directed sampling (IDS) has recently demonstrated its potent...
research
∙
02/20/2022
Interacting Contour Stochastic Gradient Langevin Dynamics
We propose an interacting contour stochastic gradient Langevin dynamics ...
research
∙
10/09/2021
Evaluating Predictive Distributions: Does Bayesian Deep Learning Work?
Posterior predictive distributions quantify uncertainties ignored by poi...
research
∙
08/12/2021
Efficient Local Planning with Linear Function Approximation
We study query and computationally efficient planning algorithms with li...
research
∙
06/03/2021
Bandit Phase Retrieval
We study a bandit version of phase retrieval where the learner chooses a...
research
∙
05/29/2021
Information Directed Sampling for Sparse Linear Bandits
Stochastic sparse linear bandits offer a practical model for high-dimens...
research
∙
02/11/2021
Optimization Issues in KL-Constrained Approximate Policy Iteration
Many reinforcement learning algorithms can be seen as versions of approx...
research
∙
02/06/2021
Bootstrapping Statistical Inference for Off-Policy Evaluation
Bootstrapping provides a flexible and effective approach for assessing t...
research
∙
11/08/2020
High-Dimensional Sparse Linear Bandits
Stochastic linear bandits with high-dimensional sparse features are a pr...
research
∙
11/08/2020
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient
This paper provides a statistical analysis of high-dimensional batch Rei...
research
∙
11/08/2020
Online Sparse Reinforcement Learning
We investigate the hardness of online reinforcement learning in fixed ho...
research
∙
07/31/2020
Low-rank Tensor Bandits
In recent years, multi-dimensional online decision making has been playi...
research
∙
02/19/2020
Residual Bootstrap Exploration for Bandit Algorithms
In this paper, we propose a novel perturbation-based exploration method ...
research
∙
02/08/2020
Provably Efficient Adaptive Approximate Policy Iteration
Model-free reinforcement learning algorithms combined with value functio...
research
∙
10/15/2019
Adaptive Exploration in Linear Contextual Bandit
Contextual bandits serve as a fundamental model for many sequential deci...
research
∙
06/12/2019
Bootstrapping Upper Confidence Bound
Upper Confidence Bound (UCB) method is arguably the most celebrated one ...
research
∙
03/31/2019
Sparse Tensor Additive Regression
Tensors are becoming prevalent in modern applications such as medical im...
research
∙
01/29/2018