Pith. sign in

REVIEW 2 minor 31 references

Optimal Estimators for Heavy-Tailed Mean Estimation via Convex Analysis

T0 review · 0 major / 2 minor · reviewed 2026-06-29 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A two-parameter convex program yields a monotone M-estimator that attains the exact minimax exponential rate for mean estimation under moment bounds.

desk verdict The paper pins down an exact non-asymptotic minimax rate for heavy-tailed mean estimation by reducing the problem to a two-parameter convex program via duality. read the letter →

arxiv 2606.27899 v1 pith:J57PZR3P submitted 2026-06-26 math.ST math.OCmath.PRstat.TH

Bart P.G. van Parys , Bert Zwart This is my paper · ORCID
classification math.STmath.OCmath.PRstat.TH
keywords heavy-tailedmeanestimationconvexoptimizationM-estimatorHellingeraffinityminimaxlargedeviationsmomentconstraintsrobuststatistics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper determines the smallest worst-case probability β_n(Δ) that any estimator can guarantee of exceeding a fixed error margin Δ when the underlying distribution belongs to a symmetric moment class. This probability decays at an exact exponential rate given by the two-point Hellinger affinity between the worst-case distributions shifted to means ±Δ. The rate holds non-asymptotically and is achieved by an M-estimator constructed from a convex program whose duality reduces the infinite-dimensional problem to two multipliers that define optimal estimating functions. For bounded variance the rate takes the explicit form ½ log(1 + Δ²/σ²), and the same construction recovers the sharp constants of Catoni and of Lee-Bhatt et al. in the shrinking-margin regime.

What carries the argument

The two-parameter convex program whose Lagrangian duality collapses the search over estimating functions to a pair of multipliers that generate the optimal sandwich-shaped envelopes.

What would settle it

A concrete distribution in C_0 together with an n and Δ for which the constructed M-estimator has error probability strictly larger than exp(−n r(Δ)) would show that the claimed rate is not achieved.

Watch

Extended reading notes

Core claim

The minimax error probability β_n(Δ) satisfies β_n(Δ) ≤ exp(−n r(Δ)) where r(Δ) equals −log of the supremum of the Hellinger affinity ∫√(dP_{−Δ} dP_Δ) taken over all pairs of distributions in the shifted moment class C_{±Δ}; equality in the exponential rate is attained for every finite n by the monotone M-estimator synthesized from the two-parameter convex program, whose least-favorable distributions are supported on at most three atoms.

Load-bearing premise

The unknown distribution lies in the symmetric moment class C_0 of mean-zero laws satisfying a bound on the integral of a fixed even function ϕ.

Editorial extensions

If this is right

  • The bound β_n(Δ) ≤ exp(−n r(Δ)) holds for every finite sample size, not merely in the large-n limit.
  • When ϕ(x) = x² the exponent simplifies to ½ log(1 + Δ²/σ²).
  • As the target β tends to zero the estimator attains the sharp constant √2 for bounded variance.
  • It attains the constant L(α) for bounded α-moments with α ∈ (1,2).
  • The least-favorable distributions remain supported on at most three atoms for every concrete class examined.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The duality reduction to two multipliers may simplify computation of the estimator in practice for given data.
  • Similar convex programs could be derived for other location or scale estimation tasks under moment constraints.
  • The three-atom structure of the worst-case distributions suggests that discretizing the moment class may preserve optimality.
  • The approach supplies a template for proving tightness of other ad-hoc robust estimators that rely on envelope functions.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 2 minor

Summary. The paper studies optimal estimation of the location parameter for distributions in a symmetric moment class C_0 (mean-zero with bounded even moment ∫ϕ dP ≤ B). It claims an exact large-deviation characterization of the minimax error probability β_n(Δ) in the fixed-margin regime: the exponential rate is the two-point Hellinger exponent r(Δ) = -log sup ∫√(dP_{-Δ} dP_Δ) over shifted classes C_{±Δ}, achieved non-asymptotically by β_n(Δ) ≤ exp(-n r(Δ)) via a monotone M-estimator synthesized from a two-parameter convex program. Lagrangian duality reduces the search over estimating functions to two multipliers yielding sandwich envelopes. For ϕ(x)=x² it recovers r(Δ)=½ log(1+Δ²/σ²); in the fixed-confidence regime it matches Catoni's √2 constant and Lee-Bhatt et al. constants, shown tight, with least-favorable distributions at most three-atomic.

Significance. If the central derivations hold, the result is significant for providing the first exact non-asymptotic exponential rate for this problem class, together with an explicit convex-analytic construction of the optimal estimator. The reduction of the infinite-dimensional monotone-function search to two multipliers, the natural emergence of the sandwich envelope, and the recovery of sharp constants (including tightness for α-moments) are notable strengths. The three-atomic least-favorable distributions and the explicit r(Δ) for the variance case further strengthen the contribution.

minor comments (2)
  1. The abstract states that the estimator is 'synthesized from a two-parameter convex program' but does not specify the precise objective and constraint set of that program; a short display of the program (e.g., in §3) would improve readability.
  2. Notation for the shifted classes C_{±Δ} is introduced only in the abstract; an explicit definition in the main text (near the statement of the main theorem) would avoid any ambiguity for readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation to accept the manuscript.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The derivation defines r(Δ) explicitly as the two-point Hellinger affinity over the shifted moment classes C_{±Δ} and proves that a monotone M-estimator synthesized from a two-parameter convex program via Lagrangian duality attains the matching upper bound β_n(Δ) ≤ exp(−n r(Δ)) for every finite n. This is self-contained: the lower bound is the standard information-theoretic quantity over the given function class, the upper bound follows from explicit duality that collapses the search over estimating functions without reference to fitted parameters or prior self-citations as load-bearing premises, and the special case ϕ(x)=x² recovers a known closed form rather than presupposing it. No step reduces by construction to its own inputs.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

Central claim rests on the definition of the moment class C_0 and the applicability of Lagrangian duality to reduce the search over estimating functions; no free parameters or invented entities are visible in the abstract.

assumptions (1)
  • domain assumption Unknown distribution lies in symmetric moment class C_0: mean-zero distributions with ∫ ϕ dP ≤ B for fixed even ϕ
    Defines the uncertainty set for which the minimax rate and estimator are derived (abstract opening sentence).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimal Estimators for Heavy-Tailed Mean Estimation via Convex Analysis." pith.science (2026). https://pith.science/paper/J57PZR3P

@misc{pith2026260627899,
  author       = {Pith},
  title        = {Pith review of: Optimal Estimators for Heavy-Tailed Mean Estimation via Convex Analysis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/J57PZR3P}},
  note         = {Machine review of arXiv:2606.27899}
}
abstract

We study optimal estimation of the location parameter of a distribution known only to lie in a symmetric moment class $\mathcal C_0$: the mean-zero distributions with bounded moment $\int\phi\, d\mathbb P\le B$ for a fixed even $\phi$. Our main result concerns the fixed-margin regime, where the error margin $\Delta$ is fixed as $n\to\infty$: we give an exact large-deviation characterization of the smallest worst-case probability $\beta_n(\Delta)$ of an error exceeding $\Delta$ that any measurable estimator can guarantee with $n$ observations. Its exponential rate is exactly a two-point Hellinger exponent over the class shifted to means $\pm\Delta$, $r(\Delta)=-\log\sup_{\mathbb P_{\pm\Delta}\in\mathcal C_{\pm\Delta}}\int\sqrt{d\mathbb P_{-\Delta}\, d\mathbb P_{\Delta}}$, achieved non-asymptotically, $\beta_n(\Delta)\le e^{-nr(\Delta)}$, by a monotone $M$-estimator synthesized from a two-parameter convex program. Lagrangian duality collapses the infinite-dimensional search over estimating functions to two multipliers, which determine a pair of envelopes characterizing the optimal estimating functions; the sandwich shape posited ad hoc in prior constructions emerges naturally. For bounded variance ($\phi(x)=x^2$, $B=\sigma^2$) the exponent is $r(\Delta)=\tfrac12\log(1+\Delta^2/\sigma^2)$. In the fixed-confidence regime, holding $\beta$ fixed and letting the optimal margin $\Delta_n(\beta)$ shrink with $n$, the same synthesis stays optimal to leading order for several concrete classes. As $\beta\downarrow0$ it attains the sharp constant $\sqrt2$ of Catoni for bounded variance and the constant $L(\alpha)$ of Lee and Bhatt et al. for bounded $\alpha$-moments, $\alpha\in(1,2)$, thereby shown tight; for slowly varying $\phi$ it is leading-order minimax at every fixed $\beta$. The least-favorable distributions are simple, supported on at most three atoms.

Figures

Figures reproduced from arXiv: 2606.27899 by the authors.

Figure 1
Figure 1. Catoni (2012) considers non-decreasing estimating functions [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. The kissing geometry for the bounded-variance class for [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figure 3
Figure 3. We consider the bounded variance class. The exact exponential rate [PITH_FULL_IMAGE:figures/full_fig_p022_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: We consider the bounded α-moment class with α = 1.5. The exponential rate rB at which the estimator of Lee et al. (2020), Bhatt et al. (2022) drives down the probability of an error exceeding ∆, as a function of (∆/σ) α/(α−1), is depicted in green. This rate is numeric…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references

  1. [1]

    2013 , publisher =

    The Implicit Function Theorem: History, Theory, and Applications , author =. 2013 , publisher =

    2013

  2. [2]

    2007 , publisher =

    Table of Integrals, Series, and Products , author =. 2007 , publisher =

    2007

  3. [3]

    1997 , publisher =

    Markov Chains , author =. 1997 , publisher =

    1997

  4. [4]

    An approximation theorem for the

    Le Cam, Lucien , journal =. An approximation theorem for the. 1960 , publisher =

    1960

  5. [5]

    1955 , publisher =

    Theory of Functions of a Real Variable , author =. 1955 , publisher =

    1955

  6. [6]

    1999 , publisher =

    Convergence of Probability Measures , author =. 1999 , publisher =

    1999

  7. [7]

    The Annals of Statistics , volume =

    Robust multivariate mean estimation: The optimality of trimmed mean , author =. The Annals of Statistics , volume =. 2021 , publisher =

    2021

  8. [8]

    IEEE Transactions on Information Theory , volume =

    Bandits with heavy tail , author =. IEEE Transactions on Information Theory , volume =. 2013 , publisher =

    2013

Show all 31 references
  1. [9]

    Foundations of Computational Mathematics , volume =

    Mean estimation and regression under heavy-tailed distributions: A survey , author =. Foundations of Computational Mathematics , volume =. 2019 , publisher =

    2019

  2. [10]

    1983 , publisher =

    Problem Complexity and Method Efficiency in Optimization , author =. 1983 , publisher =

    1983

  3. [11]

    Theoretical Computer Science , volume =

    Random generation of combinatorial structures from a uniform distribution , author =. Theoretical Computer Science , volume =. 1986 , publisher =

    1986

  4. [12]

    Journal of Computer and System Sciences , volume =

    The space complexity of approximating the frequency moments , author =. Journal of Computer and System Sciences , volume =. 1999 , publisher =

    1999

  5. [13]

    Advances in Neural Information Processing Systems , volume =

    Optimal algorithms for stochastic multi-armed bandits with heavy tailed rewards , author =. Advances in Neural Information Processing Systems , volume =

  6. [14]

    and Valiant, Paul , booktitle =

    Lee, Jasper C.H. and Valiant, Paul , booktitle =. Optimal Sub-. 2022 , publisher =

    2022

  7. [15]

    The Annals of Statistics , volume=

    Attainability of two-point testing rates for finite-sample location estimation , author=. The Annals of Statistics , volume=. 2026 , publisher=

    2026

  8. [16]

    Dualizing

    Polyanskiy, Yury and Wu, Yihong , journal =. Dualizing. 2026 , publisher =

    2026

  9. [17]

    2020 , publisher =

    Statistical Inference via Convex Optimization , author =. 2020 , publisher =

    2020

  10. [18]

    and Liu, Richard C

    Donoho, David L. and Liu, Richard C. , journal =. Geometrizing rates of convergence,. 1991 , publisher =

    1991

  11. [19]

    Devroye, Luc and Lerasle, Matthieu and Lugosi, G. Sub-. The Annals of Statistics , volume =. 2016 , publisher =

    2016

  12. [20]

    2005 , publisher =

    Testing Statistical Hypotheses , author =. 2005 , publisher =

    2005

  13. [21]

    2003 , publisher =

    Theory of Point Estimation , author =. 2003 , publisher =

    2003

  14. [22]

    International Conference on Artificial Intelligence and Statistics , pages =

    A robust univariate mean estimator is all you need , author =. International Conference on Artificial Intelligence and Statistics , pages =. 2020 , publisher =

    2020

  15. [23]

    A generalized

    Chen, Peng and Jin, Xinghu and Li, Xiang and Xu, Lihu , journal =. A generalized. 2021 , publisher =

    2021

  16. [24]

    1981 , publisher =

    Robust Statistics , author =. 1981 , publisher =

    1981

  17. [25]

    The Annals of Mathematical Statistics , volume =

    A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations , author =. The Annals of Mathematical Statistics , volume =. 1952 , publisher =

    1952

  18. [26]

    Annales de l'Institut Henri Poincar\'e , volume =

    Challenging the empirical mean and empirical variance: A deviation study , author =. Annales de l'Institut Henri Poincar\'e , volume =. 2012 , publisher =

    2012

  19. [27]

    Nearly optimal

    Bhatt, Sujay and Fang, Guanhua and Li, Ping and Samorodnitsky, Gennady , booktitle =. Nearly optimal. 2022 , publisher =

    2022

  20. [28]

    2007 , publisher =

    Heavy-Tail Phenomena: Probabilistic and Statistical Modeling , author =. 2007 , publisher =

    2007

  21. [29]

    R\'enyi divergence and

    van Erven, Tim and Harremo\"es, Peter , journal =. R\'enyi divergence and. 2014 , publisher =

    2014

  22. [30]

    1969 , publisher =

    Optimization by Vector Space Methods , author =. 1969 , publisher =

    1969

  23. [31]

    Bulletin de la Soci\'et\'e Math\'ematique de France , volume =

    Sur la mesure spectrale de certaines suites arithm\'etiques , author =. Bulletin de la Soci\'et\'e Math\'ematique de France , volume =. 1977 , publisher =

    1977

Pith tools

Reviewed June 29, 2026 · model on record in the stance chip above.