109 citations · 271 across the 4 of their papers we have counts for
4 papers
Computational Lower Bounds for Sparse PCA
Quentin Berthet, Philippe Rigollet
In the context of sparse principal component detection, we bring evidence towards the existence of a statistical price to pay for computational efficiency. We measure the performan…
Bounded regret in stochastic multi-armed bandits
Sébastien Bubeck, Vianney Perchet, Philippe Rigollet
We study the stochastic multi-armed bandit problem when one knows the value of an optimal arm, as a well as a positive lower bound on the smallest positive gap . W…
Nonparametric Bandits with Covariates
Philippe Rigollet, Assaf Zeevi
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cova…
Generalization error bounds in semi-supervised classification under the cluster assumption
Philippe Rigollet
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumptio…