spectral algorithm

Phase Transition for Stochastic Block Model with more than $\sqrtn$ Communities COLT 2026 Spectral Recovery of a Planted Triangle-Dense Subgraph COLT 2026 Exact Community Recovery under Side Information: Optimality of Spectral Algorithms ICLR 2025 A non-backtracking method for long matrix and tensor completion COLT 2024 Generalization error of spectral algorithms ICLR 2024 Novel Spectral Algorithms for the Partial Credit Model ICML 2024 On the Optimality of Misspecified Spectral Algorithms JMLR 2024 On the Saturation Effects of Spectral Algorithms in Large Dimensions NeurIPS 2024 Optimal Rates for Vector-Valued Spectral Regularization Learning Algorithms NeurIPS 2024 A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm NeurIPS 2023 Community Detection in the Hypergraph SBM: Exact Recovery Given the Similarity Matrix COLT 2023 Optimal and Private Learning from Human Response Data AISTATS 2023 Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions COLT 2023 Recovering Unbalanced Communities in the Stochastic Block Model with Application to Clustering with a Faulty Oracle NeurIPS 2023 Fast algorithm for overcomplete order-3 tensor decomposition COLT 2022 Random Graph Matching in Geometric Models: the Case of Complete Graphs COLT 2022 Robust Estimation for Random Graphs COLT 2022 Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models AISTATS 2022 Deep Spectral Ranking AISTATS 2021 Finding Bipartite Components in Hypergraphs NeurIPS 2021 Gene Regulatory Network Inference as Relaxed Graph Matching AAAI 2021 Learning sparse mixtures of permutations from noisy information COLT 2021 On-the-fly Rectification for Robust Large-Vocabulary Topic Inference ICML 2021 Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs COLT 2021 A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates COLT 2020