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

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

18 July 2016

Jessica E. Banks

Cristopher Moore

Nicolas Verzélen

Roman Vershynin

Jiaming Xu

Papers citing "Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization"

9 / 9 papers shown

Title
Semidefinite programming on population clustering: a global analysis Shuheng Zhou 18 1 0 01 Jan 2023
Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms Joshua Agterberg Jeremias Sulam 8 0 0 08 Feb 2022
Information-Theoretic Limits for the Matrix Tensor Product Galen Reeves 22 29 0 22 May 2020
On the optimality of kernels for high-dimensional clustering L. C. Vankadara D. Ghoshdastidar 20 11 0 01 Dec 2019
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 19 135 0 26 Jul 2019
Asymptotic Bayes risk for Gaussian mixture in a semi-supervised setting Marc Lelarge Léo Miolane 6 28 0 08 Jul 2019
Adaptive Clustering through Semidefinite Programming Martin Royer 11 30 0 18 May 2017
Two-Sample Tests for Large Random Graphs Using Network Statistics D. Ghoshdastidar Maurilio Gutzeit Alexandra Carpentier U. V. Luxburg 16 39 0 17 May 2017
Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization Amelia Perry Alexander S. Wein Afonso S. Bandeira Ankur Moitra 24 59 0 19 Sep 2016