Papers
Topics
Authors
Recent
Search
2000 character limit reached

Catoni-Type Robust Estimators

Updated 5 July 2026
  • Catoni-type robust estimators are defined via influence functions with soft truncation, ensuring high-probability error control under weak moment assumptions.
  • They extend to sequential, multivariate, and regression settings using exponential-moment inequalities and smart scale calibration, optimizing performance in heavy-tailed regimes.
  • Recent advancements include extensions to infinite-variance data and adaptive self-normalization, offering robust performance even with adversarial contamination and online decision problems.

Catoni-type robust estimators are influence-function-based procedures for mean estimation, regression, and sequential inference that replace raw empirical averages or score equations by monotone soft truncations satisfying logarithmic envelope bounds. In the canonical finite-variance form, the estimator is defined as a root of

i=1nφ ⁣(β(Xiθ^))=0,\sum_{i=1}^n \varphi\!\big(\beta(X_i-\hat\theta)\big)=0,

with φ\varphi chosen so that

log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).

This construction yields high-probability control under weak moment assumptions and has since been extended to heavier-tailed regimes, time-uniform confidence sequences, high-dimensional mean estimation, regression, time series, and online decision problems (Wang et al., 2022, Chen et al., 2020, Gupta et al., 2023, Cai et al., 13 Feb 2026).

1. Canonical form and influence-function architecture

The defining feature of a Catoni-type estimator is the replacement of the empirical score XiθX_i-\theta by a transformed score φ(β(Xiθ))\varphi(\beta(X_i-\theta)), where φ\varphi is nondecreasing and obeys a logarithmic upper and lower envelope. In the mean-estimation setting, one works with

r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),

so that r(θ)r(\theta) is nonincreasing in θ\theta, and θ^\hat\theta is any root of φ\varphi0. The proof strategy is typically based on exponential-moment inequalities for φ\varphi1, deterministic bracketing of the root, and high-probability control derived from the Catoni envelope (Chen et al., 2020).

In sequential settings, the same architecture is expressed through supermartingales. For predictable φ\varphi2, Catoni-style confidence sequences use products of the form

φ\varphi3

or their heavy-tail analogues, and then invert Ville’s inequality to obtain time-uniform confidence sets for the mean (Wang et al., 2022, Wei et al., 2024).

The same formal pattern reappears in regression. Catoni-type robust regression replaces raw empirical loss minimization by truncated objectives such as

φ\varphi4

or matrix-valued high-dimensional variants based on φ\varphi5. A common interpretation is that the estimator preserves local linear behavior near zero while suppressing the contribution of extreme residuals in the tails (Chen et al., 2020, Wang et al., 2024).

2. Finite-variance theory and Gaussian-optimal behavior

In one dimension under finite variance, Catoni’s estimator is the canonical sub-Gaussian robust mean estimator. A local Newton-step-style variant analyzed for covariance-bounded data satisfies

φ\varphi6

with probability at least φ\varphi7, provided φ\varphi8. The leading constant is the Gaussian-optimal constant φ\varphi9 in one dimension up to a vanishing correction term (Gupta et al., 2023).

The sequential counterpart is the Catoni-style confidence sequence under the assumption

log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).0

Its confidence set at time log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).1 is

log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).2

This construction is anytime-valid, remains valid at arbitrary stopping times, and after stitching attains width of order

log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).3

up to constants and lower-order terms, matching the law-of-the-iterated-logarithm lower bound stated in that setting (Wang et al., 2022).

A recurrent issue in the finite-variance literature is scale calibration. Some Catoni procedures require a known variance proxy or related scale information, whereas later developments address unknown variance through self-normalization or joint estimation. A plausible implication is that Catoni-type methodology bifurcates into two design philosophies: externally tuned robustification versus internally estimated scale normalization (Gupta et al., 2023, Li et al., 14 Nov 2025, Cai et al., 13 Feb 2026).

3. Extensions to heavier tails and infinite-variance regimes

A direct heavy-tail generalization replaces the quadratic term log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).4 in the Catoni envelope by log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).5 for log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).6. The generalized influence function is any nondecreasing log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).7 satisfying

log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).8

with the widest possible choice

log ⁣(1x+x22)φ(x)log ⁣(1+x+x22).-\log\!\left(1-x+\frac{x^2}{2}\right)\le \varphi(x)\le \log\!\left(1+x+\frac{x^2}{2}\right).9

The resulting estimator assumes only XiθX_i-\theta0 and achieves deviation rate

XiθX_i-\theta1

up to constants depending on XiθX_i-\theta2 and XiθX_i-\theta3. As XiθX_i-\theta4, this recovers the usual Catoni rate XiθX_i-\theta5; as XiθX_i-\theta6, the rate slows, reflecting the heavier tails. The same paper reports that the generalized Catoni estimator performs better than the empirical mean estimator and that the advantage becomes more pronounced as XiθX_i-\theta7 decreases (Chen et al., 2020).

A sequential infinite-variance analogue uses a XiθX_i-\theta8-moment bound with XiθX_i-\theta9. In that parameterization, the influence function φ(β(Xiθ))\varphi(\beta(X_i-\theta))0 is required to satisfy

φ(β(Xiθ))\varphi(\beta(X_i-\theta))1

where

φ(β(Xiθ))\varphi(\beta(X_i-\theta))2

is identified as the tightest admissible coefficient. The associated confidence sequence is valid under only a known upper bound on the φ(β(Xiθ))\varphi(\beta(X_i-\theta))3-th central moment, and the stitched version has width

φ(β(Xiθ))\varphi(\beta(X_i-\theta))4

as φ(β(Xiθ))\varphi(\beta(X_i-\theta))5 grows and

φ(β(Xiθ))\varphi(\beta(X_i-\theta))6

as φ(β(Xiθ))\varphi(\beta(X_i-\theta))7. The paper explicitly states that this improves the earlier Catoni-type confidence-sequence bounds and recovers the finite-variance case when φ(β(Xiθ))\varphi(\beta(X_i-\theta))8 (Wei et al., 2024).

These two heavy-tail extensions use different parameterizations of tail strength, but both preserve the same mechanism: logarithmic soft truncation replaces unavailable quadratic control. This suggests that the essential Catoni principle is not the quadratic form itself, but the envelope-based conversion of low-order moment assumptions into exponential-type deviation inequalities (Chen et al., 2020, Wei et al., 2024).

4. Multivariate mean estimation, regression, and dependent data

In higher dimensions, a standard Catoni-style strategy estimates every one-dimensional projection, intersects the resulting confidence slabs, and outputs the center of the minimum enclosing ball of the feasible set. By Jung’s theorem, this introduces the factor

φ(β(Xiθ))\varphi(\beta(X_i-\theta))9

For covariance-bounded heavy-tailed mean estimation with φ\varphi0, the naive multidimensional Catoni lift therefore gives radius

φ\varphi1

A sharper analysis shows that this Jung-factor loss is not necessary in the uncontaminated heavy-tailed setting: for φ\varphi2 and φ\varphi3, there exists an estimator achieving

φ\varphi4

for some universal constant φ\varphi5. By contrast, in the adversarial contamination setting, the same paper proves that the Jung-factor loss is optimal in the infinite-sample limit (Gupta et al., 2023).

Catoni-type robustification extends naturally to regression. For φ\varphi6 regression under finite φ\varphi7-moment assumptions with φ\varphi8, the robust empirical objective

φ\varphi9

replaces direct minimization of empirical absolute loss. Under total boundedness of r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),0, finite r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),1-moments of r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),2, and r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),3, the resulting excess-risk guarantee scales as

r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),4

under a radius bound on r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),5. The stated benefit is that the procedure remains valid under infinite variance while retaining convergence rate r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),6, which interpolates to the classical r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),7 regime as r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),8 (Chen et al., 2020).

For dependent heavy-tailed data, Catoni-type truncation has been integrated into high-dimensional least absolute deviation regression for exponentially r(θ)=1βni=1nφ ⁣(β(Xiθ)),r(\theta)=\frac{1}{\beta n}\sum_{i=1}^n \varphi\!\big(\beta(X_i-\theta)\big),9-mixing time series. The estimator minimizes

r(θ)r(\theta)0

and achieves excess risk of order

r(θ)r(\theta)1

up to mixing constants and covering factors. The same framework is applied to high-dimensional VAR regression, and the reported simulations indicate that the truncated estimator is essential because classical LAD can have risk with a tendency to blow up under heavy tails (Wang et al., 2024).

5. Sequential inference, bandits, and online adaptation

Catoni-type estimators have become central in sequential heavy-tail problems because the same influence-function machinery can be embedded in test supermartingales and confidence sequences. Under finite variance, Catoni-style confidence sequences are anytime-valid and robust to unbounded observations (Wang et al., 2022). Under only a r(θ)r(\theta)2-moment bound, improved r(θ)r(\theta)3-Catoni supermartingales produce tighter time-uniform confidence sets with better asymptotic width than earlier constructions (Wei et al., 2024).

In non-stationary heavy-tailed bandits, Catoni-style confidence sequences are used as change-point detectors. The Catoni-FCS-detector initializes repeated confidence sequences and declares a change when the intersection of active Catoni confidence sets becomes empty. Under the heavy-tail condition

r(θ)r(\theta)4

the detector admits a finite-time guarantee with r(θ)r(\theta)5 and predictable r(θ)r(\theta)6: r(θ)r(\theta)7 Embedded inside Robust-CPD-UCB, this leads to a near-optimal regret bound

r(θ)r(\theta)8

matching the paper’s lower bound up to logarithmic factors and constants (Genalti et al., 26 May 2025).

In contextual bandits with general function approximation, Catoni’s estimator is used in a different role: it robustifies the excess-loss cross term inside a variance-weighted optimistic regression objective rather than directly estimating the reward mean. In the known-variance case, the regret bound depends on the cumulative reward variance and only logarithmically on the reward range r(θ)r(\theta)9; in the unknown-variance case, a peeling-based algorithm uses Catoni both for excess-loss estimation and for aggregate variance estimation. The leading-order variance dependence is shown to be minimax optimal through a matching lower bound of order

θ\theta0

This suggests that Catoni-type robustification is compatible not only with heavy-tail protection, but also with variance-sensitive online learning (Ye et al., 4 Feb 2025).

6. Relations to adjacent methods, unknown variance, and asymptotic limit theory

Catoni-type estimators are often discussed alongside median-of-means and trimming-based methods, but the equivalence is only partial. One robust empirical mean construction based on the median of block averages explicitly contrasts itself with Catoni’s smooth truncation: it targets the same sub-Gaussian deviation goal under finite variance, but does not require prior knowledge of a variance proxy and instead depends on the number of blocks θ\theta1 chosen from the confidence level (Lerasle et al., 2011). Another framework interpolates between the two paradigms: when θ\theta2 and θ\theta3, it recovers Catoni’s estimator, while large block size and θ\theta4 lead to a MOM-type estimator. That interpolation also yields uniform deviation bounds over function classes and optimal contamination dependence in multivariate mean estimation (Minsker, 2018).

The same distinction appears in covariance estimation. A trimmed quadratic-form estimator that removes the largest θ\theta5 values in each direction is explicitly described as not Catoni’s influence-function estimator in form, but as conceptually analogous: Catoni uses soft truncation through a bounded influence function, whereas trimming discards the largest values directly. Under a bounded θ\theta6-θ\theta7 marginal condition for θ\theta8, this trimming-based covariance estimator attains Gaussian-like operator-norm rates and optimal robustness to adversarial contamination, but it remains Catoni-adjacent rather than literally Catoni-type (Oliveira et al., 2022).

Unknown variance has motivated two further lines of development. One is self-normalization: a Catoni estimator with empirical standard deviation θ\theta9 in the denominator admits Berry–Esseen and moderate-deviation bounds under heavy tails, including a self-normalized Berry–Esseen bound and Cramér-type moderate deviations (Cai et al., 13 Feb 2026). The other is joint estimation of location or regression parameters together with the error variance by solving two coupled Catoni-type equations. That joint framework is explicitly not the gradient of any scalar loss in general, is described as tuning-free, and yields θ^\hat\theta0-confidence interval length of order

θ^\hat\theta1

for mean estimation while also covering linear and θ^\hat\theta2-penalized regression (Li et al., 14 Nov 2025).

Recent asymptotic theory clarifies that Catoni-type estimators are not only nonasymptotically robust. For mean estimation with tuning θ^\hat\theta3, Berry–Esseen bounds and moderate deviation principles have been established, with centering at an implicit target θ^\hat\theta4 satisfying

θ^\hat\theta5

and with regression analogues giving a multivariate Berry–Esseen bound for the Catoni-type score equation

θ^\hat\theta6

A common misconception is that Catoni-type procedures are only finite-sample concentration devices; the available results indicate that they also support quantitative central limit theory and moderate deviation analysis under weak moment assumptions (Cai et al., 13 Feb 2026).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Catoni-Type Robust Estimators.