AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

List-Decodable Mean Estimation in Nearly-PCA Time

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
replace sequential cluster finding with subspace identification followed by simultaneous low-dimensional clusteringList-decodable mean estimation · List-decodable mean estimationruntime: \widetilde{O}(n^2 d k^2) -> \widetilde{O}\Par{\frac{nd}{\alpha} + \frac{1}{\alpha^6}}Helped
use the random-sampling postprocessing variant (ablation)ListDecodableMeanEstimation · List-decodable mean estimationruntime: \widetilde{O}\Par{\frac{nd}{\alpha} + \frac{1}{\alpha^6}} -> \widetilde{O}\Par{\frac{nd}{\alpha}}Helped
use the random-sampling postprocessing variant (ablation)ListDecodableMeanEstimation · List-decodable mean estimationmean error: O \left(\sigma \sqrt{\tfrac{1}{\alpha}}\right) -> O \left(\sigma \sqrt{\tfrac{\log \alpha^{-1}}{\alpha}}\right)Hurt
use iterative soft downweighting with whitened top-k eigenspace scores and saturationSIFT · List-decodable mean estimationmean error squared: Theorem guarantees \frac{22}{\alpha}Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy