research
∙
07/21/2021
Design of Experiments for Stochastic Contextual Linear Bandits
In the stochastic linear contextual bandit setting there exist several m...
share
research
∙
03/17/2021
Near Optimal Policy Optimization via REPS
Since its introduction a decade ago, relative entropy policy search (REP...
research
∙
09/22/2020
Is Q-Learning Provably Efficient? An Extended Analysis
This work extends the analysis of the theoretical results presented with...
research
∙
12/03/2019
Continuous Online Learning and New Insights to Online Imitation Learning
Online learning is a powerful tool for analyzing iterative algorithms. H...
research
∙
07/08/2019
On-Policy Robot Imitation Learning from a Converging Supervisor
Existing on-policy imitation learning algorithms, such as DAgger, assume...
research
∙
02/19/2019
Online Learning with Continuous Variations: Dynamic Regret and Reductions
We study the dynamic regret of a new class of online learning problems, ...
research
∙
11/19/2018
Generalizing Robot Imitation Learning with Invariant Hidden Semi-Markov Models
Generalizing manipulation skills to new situations requires extracting i...
research
∙
11/06/2018
A Dynamic Regret Analysis and Adaptive Regularization Algorithm for On-Policy Robot Imitation Learning
On-policy imitation learning algorithms such as Dagger evolve a robot co...
research
∙
01/31/2018
Model-Free Error Detection and Recovery for Robot Learning from Demonstration
Learning from human demonstrations can facilitate automation but is risk...
research
∙
01/31/2018
