Information-theoretic limits under heavy-tailed (non-sub-Gaussian) noise
Sourced from the work of Akshay Prasadan, Matey Neykov
§ Problem Statement
Setup
Fix integers and , and fix contamination parameters and (equivalently, one may consider the boundary regime ). Let , , and let be a known constraint set for the unknown mean vector (in the motivating framework, is star-shaped with respect to ). Define
For , let with . Under Huber contamination, an adversary replaces at most observations arbitrarily, yielding . For measurable estimators (or ), consider
Unsolved Problem
Determine sharp minimax upper/lower bounds (rates, and if possible constants) for this heavy-tailed setting, including dependence on and on geometry of (e.g., heavy-tail analogues of local complexity).
§ Discussion
§ Significance & Implications
Heavy-tailed robustness is explicitly posed as a future direction in the source paper. Clarifying minimax limits here would test how much of the star-shaped, geometry-driven theory persists beyond sub-Gaussian tails and which additional complexity terms are unavoidable.
§ Known Partial Results
Prasadan et al. (2025): The paper establishes minimax characterizations for several sub-Gaussian regimes (including unbounded star-shaped sets) but does not provide a full heavy-tailed minimax characterization. Based on the source framing, this heavy-tailed formulation should be treated as a proposed extension and remains open.
§ References
Information Theoretic Limits of Robust Sub-Gaussian Mean Estimation Under Star-Shaped Constraints
Akshay Prasadan, Matey Neykov (2025)
Annals of Statistics (accepted; final volume/issue/pages/DOI pending)
📍 Section 6 (Discussion and Future Work), first paragraph: "Another avenue for future research is to understand the case when the noise can be heavy tailed."
Primary source paper; Section 6 frames heavy-tailed noise as future work rather than a completed characterization.