paper-with-me

홈 › Papers

Mean Testing under Truncation beyond Gaussian

2026-05-02 · Yuhao Wang, Roberto Imbuzeiro Oliveira, Themis Gouleakis arxiv

We characterize the fundamental limits of high-dimensional mean testing under arbitrary truncation, where samples are drawn from the conditional distribution $P(\cdot \mid S)$ for an unknown truncation set $S$ that may hide up to an $\varepsilon$-fraction of the probability mass. For distributions with $p$-th directional moments of magnitude at most $ν_{P,p}$, truncation induces a bias of order $O(ν_{P,p}\varepsilon^{1-1/p})$. This bias creates a sharp information-theoretic detectability floor: when the signal $α$ falls below this threshold, the null and alternative hypotheses are indistinguishable even with infinite data. Above this floor, we prove that a simple second-order test achieving near-optimal sample complexity $n = O\!\left(\frac{\|Σ_P\|}{(α-4ν_{P,p}\varepsilon^{1-1/p})^2}\sqrt{d}\right)$. We further identify a structural escape from this finite-moment bias barrier. Under a directional median regularity assumption, truncation bias improves to linear order $O(\varepsilon)$. This reveals an intermediate regime in which estimation requires $Θ(d)$ samples for uniform recovery, while testing recovers the classical $Θ(\sqrt d)$ rate once truncation bias is eliminated. Together, our results provide a unified framework for mean testing under truncation, connecting finite-moment, sub-Gaussian, and median-regular structural regimes.

📄 PDF Abstract BibTeX arXiv:2605.01335

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity

2026-06-25 · Haitong Liu, Deepak Narayanan Sridharan, David Steurer, Manuel Wiedmer arxiv

We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace. Lee, Mehrotra and Zampetakis (FOCS'24) recently obtained the first polynomial time algorithm for this problem, b…

Bias-Free Scalable Gaussian Processes via Randomized Truncations

2021-02-12 · Andres Potapczynski, Luhuan Wu, Dan Biderman, Geoff Pleiss 외

Scalable Gaussian Process methods are computationally attractive, yet introduce modeling biases that require rigorous study. This paper analyzes two common techniques: early truncated conjugate gradients (CG) and random …

Gaussian Processes

Analysis of spectral clustering algorithms for community detection: the general bipartite setting

2018-03-12 · Zhixin Zhou, Arash A. Amini

We consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM). A modern spectral clustering algorithm consists of three steps: (1) regularization of an appropri…

ClusteringCommunity DetectionStochastic Block Model

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians

2024-10-02 · Jane H. Lee, Anay Mehrotra, Manolis Zampetakis

We study the estimation of distributional parameters when samples are shown only if they fall in some unknown set $S \subseteq \mathbb{R}^d$. Kontonis, Tzamos, and Zampetakis (FOCS'19) gave a $d^{\mathrm{poly}(1/\varepsi…

PAC learning

Gaussian Mean Testing Made Simple

2022-10-25 · Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia

We study the following fundamental hypothesis testing problem, which we term Gaussian mean testing. Given i.i.d. samples from a distribution $p$ on $\mathbb{R}^d$, the task is to distinguish, with high probability, betwe…