Robust mean estimation under star-shaped constraints with heavy-tailed noise
Tuorui Peng, Akshay Prasadan, Matey Neykov

TL;DR
This paper investigates robust mean estimation under star-shaped constraints with heavy-tailed noise, establishing minimax rates that depend on local entropy and contamination level, applicable to unbounded sets.
Contribution
It provides the first minimax rate analysis for robust mean estimation under star-shaped constraints with heavy tails, extending known Gaussian results.
Findings
Minimax rate depends on local entropy and contamination level.
Rate matches Gaussian case for known or sign-symmetric distributions.
Results apply to both bounded and unbounded star-shaped sets.
Abstract
We study the problem of robust mean estimation with adversarially contaminated data under star-shaped constraints in a heavy-tailed noise setting, where only a finite second moment is assumed. For a contamination level below some constant, we show that the minimax rate of the squared loss is for a star-shaped set with diameter (set if the set is unbounded), with determined via the local entropy as \begin{align*} \delta ^*:= \sup\bigg\{\delta \geq 0: N\frac{\delta ^2}{\sigma ^2}\leq \log M^\mathrm{ loc }(\delta ,c) \bigg\}, \end{align*} where is a sufficiently large constant. Crucially, we require that the sample size satisfies $N \gtrsim \mathop{ \sup }\limits_{\delta \geq 0} \log M^\mathrm{ loc }(\delta…
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.
