activity
20102026
most citedBatched bandit problems

139 citations · 615 across the 107 of their papers we have counts for

collaborators
Showing 2020Show all

8 papers · 1 filter

cs.LG2020★ 2 cited

Lifelong Learning in Multi-Armed Bandits

Matthieu Jedor, Jonathan Louëdec, Vianney Perchet

Continuously learning and leveraging the knowledge accumulated from prior tasks in order to improve future performance is a long standing machine learning problem. In this paper, w…

cs.LG2020

Robustness of Community Detection to Random Geometric Perturbations

Sandrine Peche, Vianney Perchet

We consider the stochastic block model where connection between vertices is perturbed by some latent (and unobserved) random geometric graph. The objective is to prove that spectra…

cs.GT2020

Learning in repeated auctions

Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui +1

Online auctions are one of the most fundamental facets of the modern economy and power an industry generating hundreds of billions of dollars a year in revenue. Auction theory has…

cs.LG2020★ 3 cited

Local Differential Privacy for Regret Minimization in Reinforcement Learning

Evrard Garcelon, Vianney Perchet, Ciara Pike-Burke +1

Reinforcement learning algorithms are widely used in domains where it is desirable to provide a personalized service. In these domains it is common that user data contains sensitiv…

math.OC2020

Social Learning in Non-Stationary Environments

Etienne Boursier, Vianney Perchet, Marco Scarsini

Potential buyers of a product or service, before making their decisions, tend to read reviews written by previous consumers. We consider Bayesian consumers with heterogeneous prefe…

stat.ML2020★ 7 cited

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…