67 citations · 229 across the 25 of their papers we have counts for
10 papers · 1 filter
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation
Marc Abeille, Alessandro Lazaric
We study the exploration-exploitation dilemma in the linear quadratic regulator (LQR) setting. Inspired by the extended value iteration algorithm used in optimistic algorithms for…
Meta-learning with Stochastic Linear Bandits
Leonardo Cella, Alessandro Lazaric, Massimiliano Pontil
We investigate meta-learning procedures in the setting of stochastic linear bandits tasks. The goal is to select a learning algorithm which works well on average over a class of ba…
Active Model Estimation in Markov Decision Processes
Jean Tarbouriech, Shubhanshu Shekhar, Matteo Pirotta +2
We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP). Efficient exploration in this probl…
Near-linear Time Gaussian Process Optimization with Adaptive Batching and Resparsification
Daniele Calandriello, Luigi Carratino, Alessandro Lazaric +2
Gaussian processes (GP) are one of the most successful frameworks to model uncertainty. However, GP optimization (e.g., GP-UCB) suffers from major scalability issues. Experimental…
No-Regret Exploration in Goal-Oriented Reinforcement Learning
Jean Tarbouriech, Evrard Garcelon, Michal Valko +2
Many popular reinforcement learning problems (e.g., navigation in a maze, some Atari games, mountain car) are instances of the episodic setting under its stochastic shortest path (…
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret
Daniele Calandriello, Luigi Carratino, Alessandro Lazaric +2
Gaussian processes (GP) are a well studied Bayesian approach for the optimization of black-box functions. Despite their effectiveness in simple problems, GP-based algorithms hardly…