Research map / Learning theory and algorithms / Sample complexity
A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use iterative spectral filtering together with recursive splitting of projected samples | List-decodable Gaussian covariance estimation · Gaussian covariance estimation under adversarial corruption | relative Frobenius error | Helped |
| Use spectral clustering and sample tracking rather than an SoS-based partial-clustering routine | Robust Gaussian mixture learning · Outlier-robust covariance clustering for GMMs | list size | Helped |
Closest papers by meaning
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.89)
- Spectral Estimation with Free Decompression (NeurIPS 2025 · similarity 0.86)
- Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem (ICLR 2024 · similarity 0.86)
- Coherence-free Entrywise Estimation of Eigenvectors in Low-rank Signal-plus-noise Matrix Models (NeurIPS 2024 · similarity 0.85)
- Spectral Estimation with Deformed Decompression (NeurIPS 2026 · similarity 0.85)
- Batch List-Decodable Linear Regression via Higher Moments (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.