no code implementations • 5 Jun 2023 • El Mehdi Saad, Gilles Blanchard, Nicolas Verzelen
This framework allows the learner to estimate the covariance among the arms distributions, enabling a more efficient identification of the best arm.
no code implementations • 5 Jun 2023 • El Mehdi Saad, Nicolas Verzelen, Alexandra Carpentier
We consider the problem of ranking n experts based on their performances on d tasks.
no code implementations • 6 Aug 2021 • Christophe Giraud, Yann Issartel, Nicolas Verzelen
We consider the problem of estimating latent positions in a one-dimensional torus from pairwise affinities.
no code implementations • 19 Jul 2018 • Christophe Giraud, Nicolas Verzelen
We investigate the clustering performances of the relaxed $K$means in the setting of sub-Gaussian Mixture Model (sGMM) and Stochastic Block Model (SBM).
1 code implementation • 16 Jun 2016 • Florentina Bunea, Christophe Giraud, Martin Royer, Nicolas Verzelen
The problem of variable clustering is that of grouping similar components of a $p$-dimensional vector $X=(X_{1},\ldots, X_{p})$, and estimating these groups from $n$ independent copies of $X$.
Statistics Theory Statistics Theory
1 code implementation • 8 Aug 2015 • Florentina Bunea, Christophe Giraud, Xi Luo, Martin Royer, Nicolas Verzelen
We quantify the difficulty of clustering data generated from a G-block covariance model in terms of cluster proximity, measured with respect to two related, but different, cluster separation metrics.
no code implementations • 13 Aug 2013 • Ery Arias-Castro, Nicolas Verzelen
This is formalized as testing for the existence of a dense random subgraph in a random graph.