Nicolas Verzelen

CoRR, March, 2026

Low-degree Lower bounds for clustering in moderate dimension.

[BibT_eX]

[DOI]

CoRR, February, 2026

Nonparametric Kernel Clustering with Bandit Feedback.

[BibT_eX]

[DOI]

Victor Thuot

Sebastian Vogt

Debarghya Ghoshdastidar

CoRR, January, 2026

Denoising over networks with applications to partially observed epidemics.

[BibT_eX]

[DOI]

Claire Donnat

Olga Klopp

Comput. Stat. Data Anal., 2026

Computational barriers for permutation-based problems, and cumulants of weakly dependent random variables.

[BibT_eX]

[DOI]

Bertrand Even

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Phase Transition for Stochastic Block Model with more than √n Communities (II).

[BibT_eX]

[DOI]

CoRR, November, 2025

Model-free algorithms for fast node clustering in SBM type graphs and application to social role inference in animals.

[BibT_eX]

[DOI]

Bertrand Cloez

Adrien Cotil

Jean-Baptiste Menassol

CoRR, September, 2025

Phase Transition for Stochastic Block Model with more than √n Communities.

[BibT_eX]

[DOI]

CoRR, September, 2025

Low-degree lower bounds via almost orthonormal bases.

[BibT_eX]

[DOI]

Simone Maria Giancola

CoRR, September, 2025

Clustering Items through Bandit Feedback: Finding the Right Feature out of Many.

[BibT_eX]

[DOI]

Maximilian Graf

Victor Thuot

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Clustering with bandit feedback: breaking down the computation/information gap.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2025

2024

Optimal level set estimation for non-parametric tournament and crowdsourcing problems.

[BibT_eX]

[DOI]

Maximilian Graf

CoRR, 2024

Active clustering with bandit feedback.

[BibT_eX]

[DOI]

CoRR, 2024

Optimal rates for ranking a permuted isotonic matrix in polynomial time.

[BibT_eX]

[DOI]

Emmanuel Pilliat

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On Weak Regret Analysis for Dueling Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Computation-information gap in high-dimensional clustering.

[BibT_eX]

[DOI]

Bertrand Even

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Covariance-adaptive best arm identification.

[BibT_eX]

[DOI]

El Mehdi Saad

Gilles Blanchard

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Active Ranking of Experts Based on their Performances in Many Tasks.

[BibT_eX]

[DOI]

El Mehdi Saad

Proceedings of the International Conference on Machine Learning, 2023

2018

Partial recovery bounds for clustering with the relaxed K-means.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2010

Data-driven neighborhood selection of a Gaussian field.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2010

2009

Tests for Gaussian graphical models.

[BibT_eX]

[DOI]

Fanny Villers

Comput. Stat. Data Anal., 2009

2008

Conditional-mean least-squares fitting of Gaussian Markov random fields to Gaussian fields.

[BibT_eX]

[DOI]

Noel Cressie