Constant-Degree Localization for Gaussian Mean-Shift Contamination with Unknown Covariance

We study estimation of the distinguished mean in a Gaussian mean-shift mixture with unknown common covariance, sufficiently small constant contamination, and unrestricted outlier locations. We construct an observable mean-covering subspace of dimension ε^(−C)(1+log d) using poly(d,1/ε) samples and time, with absolute exponents. The main new mechanism is a constant-degree rational score family: a majority-atom Christoffel inequality supplies a witness, a fixed inverse-heat expansion transfers it to noisy observations, and a fixed-degree sum-of-squares Gaussian coupling localizes every high-score pseudoexpectation. Combined with cumulative quadratic reweighting and a convex subspace game, this yields two estimation tradeoffs. One has sample and runtime d^C exp(C ε^(−8) log^8(e/ε)), with a dimension exponent independent of accuracy. Another uses poly(d,1/ε)+ε^(−C) log(ed) exp(C/ε²) samples, but has runtime (d/ε)^C+exp(C ε^(−C) log(ed)+C/ε²). The guarantee is Euclidean error ε√(‖Σ‖_op). Neither tradeoff gives simultaneously optimal sample complexity and sample-polynomial computation.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-18
DOI
https://doi.org/10.5281/zenodo.23458442
Primary Topic
Bayesian Methods and Mixture Models
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Constant-Degree Localization for Gaussian Mean-Shift Contamination with Unknown Covariance

Zheng Zhijie
Zenodo (CERN European Organization for Nuclear Research)
Bayesian Methods and Mixture Models
preprint

Constant-Degree Localization for Gaussian Mean-Shift Contamination with Unknown Covariance

Zheng Zhijie
preprint en

Abstract

We study estimation of the distinguished mean in a Gaussian mean-shift mixture with unknown common covariance, sufficiently small constant contamination, and unrestricted outlier locations. We construct an observable mean-covering subspace of dimension ε^(−C)(1+log d) using poly(d,1/ε) samples and time, with absolute exponents. The main new mechanism is a constant-degree rational score family: a majority-atom Christoffel inequality supplies a witness, a fixed inverse-heat expansion transfers it to noisy observations, and a fixed-degree sum-of-squares Gaussian coupling localizes every high-score pseudoexpectation. Combined with cumulative quadratic reweighting and a convex subspace game, this yields two estimation tradeoffs. One has sample and runtime d^C exp(C ε^(−8) log^8(e/ε)), with a dimension exponent independent of accuracy. Another uses poly(d,1/ε)+ε^(−C) log(ed) exp(C/ε²) samples, but has runtime (d/ε)^C+exp(C ε^(−C) log(ed)+C/ε²). The guarantee is Euclidean error ε√(‖Σ‖_op). Neither tradeoff gives simultaneously optimal sample complexity and sample-polynomial computation.

Zenodo (CERN European Organization for Nuclear Research)
Peking University (CN)
Bayesian Methods and Mixture Models
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.