139 citations · 615 across the 107 of their papers we have counts for
13 papers · 1 filter
Privacy Amplification via Shuffling for Linear Contextual Bandits
Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet +1
Contextual bandit algorithms are widely used in domains where it is desirable to provide a personalized service by leveraging contextual information, that may contain sensitive inf…
Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge
Reda Ouhamma, Odalric Maillard, Vianney Perchet
We consider the problem of online linear regression in the stochastic setting. We derive high probability regret bounds for online ridge regression and the forward algorithm. This…
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
Reda Ouhamma, Rémy Degenne, Pierre Gaillard +1
In the fixed budget thresholding bandit problem, an algorithm sequentially allocates a budgeted number of samples to different distributions. It then predicts whether the mean of e…
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac, Jialin Yi, Clément Calauzènes +2
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentia…
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
Nathan Noiry, Flore Sentenac, Vianney Perchet
Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i.i.d., but they have fixed degree distribu…
Unsupervised Neural Hidden Markov Models with a Continuous latent state space
Firas Jarboui, Vianney Perchet
We introduce a new procedure to neuralize unsupervised Hidden Markov Models in the continuous case. This provides higher flexibility to solve problems with underlying latent variab…