4 papers · 1 filter
Low-degree Lower bounds for clustering in moderate dimension
Alexandra Carpentier, Nicolas Verzelen
We study the fundamental problem of clustering points into groups drawn from a mixture of isotropic Gaussians in . Specifically, we investigate the requisite…
Statistical and computational challenges in ranking
Alexandra Carpentier, Nicolas Verzelen
We consider the problem of ranking experts according to their abilities, based on the correctness of their answers to questions. This is modeled by the so-called crowd-sour…
Seriation of Toeplitz and latent position matrices: optimal rates and computational trade-offs
Clément Berenfeld, Alexandra Carpentier, Nicolas Verzelen
In this paper, we consider the problem of seriation of a permuted structured matrix based on noisy observations. The entries of the matrix relate to an expected quantification of i…
Optimal rates for ranking a permuted isotonic matrix in polynomial time
Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen
We consider a ranking problem where we have noisy observations from a matrix with isotonic columns whose rows have been permuted by some permutation *. This encompasses many mo…