AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 55 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-based filtering instead of the previous fastest approachRobust mean estimation · Robust mean estimationrunning time: \widetilde{O}(\min(nd/\epsilon^6, nd^2)) -> \widetilde{O}(nd)Helped
Choose finite α rather than either extreme (α = 0 or α → ∞) (ablation)QUE outlier scoring · Synthetic, word embeddings, and CIFAR-10 outlier detectionROCAUCHelped
Increase the number of outlier directions (ablation)QUE and naive spectral scoring · Synthetic outlier detectionROCAUCMixed

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