AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time

NeurIPS 2020 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 6 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
Use QUE-score filtering in the refinement phases instead of solving packing SDPs to high accuracyRobust Gaussian covariance estimation · Robust Gaussian covariance estimationruntime: \widetilde{O} (T(N, d) / \eps^8) -> \wt O( T(N,d)\log \kappa)Helped
Use QUE-score filtering in the refinement phases instead of solving packing SDPs to high accuracyRobust Gaussian covariance estimation · Robust Gaussian covariance estimationMahalanobis error: O(\eps \log 1 / \eps) -> O(\eps\log(1/\eps))No clear effect

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