3.4k citations · 4.9k across the 135 of their papers we have counts for
5 papers · 2 filters
BYOL works even without batch statistics
Pierre H. Richemond, Jean-Bastien Grill, Florent Altché +8
Bootstrap Your Own Latent (BYOL) is a self-supervised learning approach for image representation. From an augmented view of an image, BYOL trains an online network to predict a tar…
Gamification of Pure Exploration for Linear Bandits
Rémy Degenne, Pierre Ménard, Xuedong Shang +1
We investigate an active pure-exploration setting, that includes best-arm identification, in the context of linear stochastic bandits. While asymptotically optimal algorithms exist…
Stochastic bandits with arm-dependent delays
Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier +1
Significant work has been recently dedicated to the stochastic delayed bandit setting because of its relevance in applications. The applicability of existing algorithms is however…
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits
Pierre Perrault, Etienne Boursier, Vianney Perchet +1
We investigate stochastic combinatorial multi-armed bandit with semi-bandit feedback (CMAB). In CMAB, the question of the existence of an efficient policy with an optimal asymptoti…
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…