649 citations
- Carnegie Mellon UniversityUS23 papers
- Stanford UniversityUS20 papers
- Google (United States)US14 papers
- Georgia Institute of TechnologyUS13 papers
- Tel Aviv UniversityIL12 papers
- Cornell UniversityUS11 papers
- University of California, BerkeleyUS11 papers
- University College LondonGB10 papers
- Harvard University PressUS9 papers
- Johns Hopkins UniversityUS9 papers
- Massachusetts Institute of TechnologyUS9 papers
- The University of Texas at AustinUS9 papers
4 papers · 2 filters
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…
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…
Radioactive data: tracing through training
Alexandre Sablayrolles, Matthijs Douze, Cordelia Schmid +1
We want to detect whether a particular image dataset has been used to train a model. We propose a new technique, \emph{radioactive data}, that makes imperceptible changes to this d…