Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors
Runshi Tang, Yuefeng Han, and Anru R. Zhang

TL;DR
This paper investigates the challenges of estimating and detecting high-order moment and cumulant tensors in high-dimensional settings, revealing a surprising gap where detection can be computationally harder than estimation due to tensor spectral norm complexity.
Contribution
It establishes minimax rates for tensor estimation, constructs near-optimal estimators, and demonstrates a computational hardness gap in detection tasks using low-degree polynomial analysis.
Findings
Sample moment tensor is not rate-optimal for order d≥3
Detection is computationally hard when n ≪ p^{d/2}
An efficient estimator can outperform low-degree tests in certain regimes
Abstract
We study estimation and detection of high-order moment and cumulant tensors from i.i.d.\ observations of a -dimensional random vector, with performance measured in tensor spectral norm. Under sub-Gaussianity, we show that the minimax rate for estimating the order- moment and cumulant tensors is . In contrast to covariance estimation, the sample moment tensor is generally not rate-optimal for , and we construct an estimator that attains the minimax rate up to logarithmic factors. On the computational side, we study testing whether the -th order cumulant tensor vanishes after whitening. Using the low-degree polynomial framework, we provide evidence that detection is computationally hard when . At the same time, we identify a regime in which an efficiently computable estimator achieves error smaller than the separation at which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
