Huber location estimator Created 2026-09-24 Updated 2026-10-18
The Huber location estimator solves , where clips its argument to .
More generally, fix a known scale and a dimensionless threshold before fitting. For observations , a Huber location estimator is a minimizer of the summed Huber loss, equivalently a root of its estimating equation:
Here is the Huber loss and the Huber score. The physical clipping distance is , in the observations' units; the initial formula uses . A large observation keeps contributing a bounded signed score rather than being discarded. The original clipped location criterion appears in Peter J. Huber's 1964 paper.[ref]
For the original data , take and . At , the standardized differences and their Huber scores are
Their sum is zero, so the Huber location estimator is . Four scores remain in the central linear region, making the root unique. By comparison, the sample mean is , and the sample median, using the midpoint of the two middle observations, is . Agreement with the sample median is a feature of these data, rather than an identity between the two estimators.
The geometry explains both existence and possible nonuniqueness. The Huber loss is a convex function, so is a convex function of and its derivative is . For , tends to infinity as grows, hence attains a minimum; its zero derivative characterizes every minimizer. Between clipping transitions, the summed score has slope , where is the number of observations strictly within of . A root with is unique. If , a flat interval is possible: for data with , every is a minimizer. A complete single-valued estimator then needs a selection rule, such as the interval's midpoint.
A bounded Huber score limits one observation's contribution to the estimating equation. The influence function of a Huber location estimator additionally divides by the population's central mass, so the size of its bound depends on the reference probability distribution. Clipping does not by itself make the bias of an estimator zero or prove a universal breakdown point; the separate local influence versus replacement breakdown argument specifies what fixed scale permits. Estimating from the same data changes the procedure and requires separate analysis.
M-estimator Created 2026-09-28 Updated 2026-11-05
An M-estimator chooses a parameter by minimizing an empirical objective:
Here is a loss function. For scalar location, squared-error loss gives the sample mean, absolute-error loss gives a sample median, and Huber loss gives a Huber location estimator.
At an interior minimum of a differentiable objective, the estimating equation is , where . A root need not be a global minimizer for a nonconvex objective: zero is a stationary point of , but the minima are at . For a differentiable convex function, a zero derivative is sufficient for global minimality.
Thus the loss-minimization and estimating-equation formulations require an explicit relation between their solutions. The sandwich variance of an M-estimator describes regular estimating-equation roots; choosing a robust loss does not itself establish the regularity or uniqueness needed for that calculation. Peter J. Huber's original location criterion is a central historical example.[ref]
One-step estimator Created 2026-09-28 Updated 2026-11-05
A one-step estimator starts with an initial estimator and applies one correction derived from an estimated influence function:
The correction aims to remove the leading discrepancy between the initial answer and the desired parameter. For the mean, use . Then the corrected answer is exactly the sample mean, whatever initial value was chosen.
For a smooth estimating equation with empirical average and nonsingular Jacobian matrix , one Newton method step is . Its correction has the same form with . An asymptotic linear representation follows only when the initial error, derivative approximation and remaining terms are sufficiently controlled. The formula alone is not a general guarantee of improved accuracy.
An M-estimator based on an estimating equation chooses a consistent root of
Its population target solves . For a scalar parameter, suppose the root is locally unique and
For the contaminated distribution , differentiate its population equation at zero contamination. The influence function satisfies
Consequently
The constant of proportionality is independent of . A local expansion of the sample estimating equation similarly gives
The central limit theorem yields asymptotic normality with the sandwich variance of an M-estimator
Thus the first-order variance of the unscaled estimator is . For a vector parameter the same differentiation gives and , with and .
For the location problem, take the target location to be zero and let have the standard normal distribution, with density and distribution function . An odd score has . For a differentiable score, integration by parts gives
The last expression also gives the appropriate derivative of the population equation for bounded monotone scores with jumps, by differentiating the shifted normal density. Assume and put . Then
Multiplying a score by a positive constant changes neither its estimator nor this normalized influence function.
First establish feasibility. The bound implies
so necessarily . For , let solve
This solution is unique: the ratio tends to as , tends to infinity as , and has positive derivative because
Take the Huber score . Its derivative is one on and zero outside, so . Hence
It is odd, nondecreasing, meets the bound, and satisfies .
To prove optimality, put . For each fixed , the minimum of over is attained by projecting onto , which is exactly . Therefore every competing normalized influence function satisfies
Taking expectations, the right-hand side vanishes because both functions satisfy . Thus . This proves the optimal bounded influence function for normal location, even over the larger class of all bounded normalized functions, and hence over the required odd nondecreasing class. Its minimum asymptotic variance is
The numerator is .
At the included boundary , equality in the feasibility bound forces almost everywhere. This is the influence function of the sample median, with . It is obtained from the rescaled scores as . The boundary solution is the sign score, or equivalently the median estimator. Literal substitution of in the clipped score gives the identically zero function and no identifiable estimating equation; the printed clipped formula therefore requires this limiting interpretation at equality.
A functional statistic has the form , where is the empirical distribution and is a statistical functional on a class of distributions. It separates the population quantity from its sample estimate. Fisher consistency for a model means for every model parameter; it does not alone establish consistency of the empirical estimate without continuity and probabilistic conditions.
The influence function measures infinitesimal contamination at a point:
when this derivative exists. A bounded influence function limits first-order sensitivity to an arbitrarily remote observation.
An M-estimator is a minimizer of an empirical loss, or a chosen consistent solution of an estimating equation . Its population functional solves . Put and , assumed finite and nonzero. Differentiating the contaminated population equation gives
since the unperturbed expected score is zero. Hence
Under differentiability, consistency and the uniform local laws needed for expansion of the empirical equation,
The central limit theorem now yields asymptotic normality with sandwich variance of an M-estimator
Thus the leading variance of itself is the displayed variance divided by . For a vector parameter, replace by the derivative matrix and use .
In a location model with known scale , choose . For a symmetric reference distribution, an odd score is Fisher consistent. With and positive , the formulas become
The Gaussian likelihood score gives the efficient sample mean under normality, but its unbounded influence is vulnerable to large outliers. The Huber score is linear centrally and bounded in the tails, balancing normal-model efficiency against contamination sensitivity. Its denominator is for a continuous law. The sign score gives the median and needs a nonsmooth derivation using the density at the median, rather than incorrectly setting its ordinary derivative to zero. Redescending scores can reject very extreme observations, but may have multiple roots and require a consistent root-selection rule.
Thus appropriate choices seek Fisher consistency, a nonzero stable derivative, finite variance, reasonable reference-model efficiency and bounded influence. Robust scale estimation may be needed for the tuning constant; joint location-scale estimation uses the matrix influence calculation rather than treating an estimated scale as known. Bounded influence describes local robustness and is not by itself a global breakdown point theorem.
Let . For any , the set
is compact. If it is empty there is nothing to prove. Otherwise continuity and the unique minimum give a strictly positive separation gap
Take any measurable attained minimizer of . Its defining inequality gives
Consequently
This proves argmin consistency under uniform convergence in probability. No continuity of is needed once the minimizer exists; compactness and continuity concern the deterministic separation gap. The uniform convergence in probability assumption controls all candidate parameters, including the random minimizer.
For the estimating equation, fix and put , . The prescribed signs make . Pointwise convergence in probability at just these two points implies
and similarly . With probability tending to one, . The intermediate value theorem then gives a zero inside , and uniqueness identifies it with . Hence
This is consistency of a uniquely bracketed zero. It needs no monotonicity, no continuity of the limit , and no uniform convergence of the . The bracket interval must lie in the domain of : read literally, the printed sign condition for every positive puts every real point into , so this requirement is satisfied. More generally it is enough to have an interval about and sign brackets arbitrarily close to it.
The homogeneous treatment effect and consistency imply
Instrument validity gives .
If Assumption 1 holds, put . Then , so conditional instrument independence gives
Consequently both population estimating equations vanish at for any probability limit of .
If Assumption 2 holds, choose the linear-projection coefficient
Then , while
The first term is zero by conditional instrument independence and the second by the definition of . Thus solves the population equations. Under the nonsingularity condition from part b, the root is unique, so standard estimating equation consistency proves
whenever either Assumption 1 or Assumption 2 holds. This is double robustness.
Let
Assumption 2 implies . Although the printed need not converge to , its first-order effect vanishes because . Inverting the Jacobian of the remaining estimating equations gives the influence function
The first-stage condition yields
Hence the asymptotic variance of is the sandwich expression
There is a defect in the printed assumptions: alone does not determine , because depends on and can have a nonzero conditional mean given under unmeasured confounding. Under the standard intended strengthening , the formula simplifies to
The asymptotic variance of itself is .
Let and suppose . A first-order expansion of the estimating equation gives the asymptotic linear representation
The central limit theorem therefore yields
For use the estimating equation
Its empirical mean vanishes exactly at . The population equation has the unique root , so the Z-estimator is consistent. Linearizing the equation, or simplifying the corresponding sandwich covariance, gives the influence function
Hence
Sandwich covariance matrix Created 2026-09-24 Updated 2026-11-05
Suppose an estimating equation has the expansion
where is nonsingular and the centered estimating function has covariance matrix . A central limit theorem gives asymptotic covariance for the rescaled error, or approximately for .
The transpose is essential when is not symmetric; the simplified form applies only in the symmetric case. Plugging in consistent estimates gives a sandwich covariance estimate. Regression heteroskedasticity-consistent standard errors and cluster-level generalized estimating equations use instances of this construction.
Sandwich variance of an M-estimator Created 2026-10-14 Updated 2026-11-05
For an estimating equation with population root , let be nonsingular and . Differentiating the contaminated population equation gives influence function . A consistent sample root with differentiable local expansion satisfies , so the central limit theorem gives the displayed covariance. In the scalar case this is .
Scale M-estimator Created 2026-09-28 Updated 2026-11-05
A Scale M-estimator estimates the spread of centered data by solving
for a chosen function . If the center is estimated, residuals replace . The function and its normalization specify the population scale being estimated; an arbitrary choice need not have a positive or unique root.
For known center zero and at least one nonzero observation, choosing gives , the root mean square. This example is highly sensitive to an outlier. Bounded choices of can instead limit an observation's contribution to the estimating equation, but their influence function and breakdown point still require analysis.
If is an even function and the positive root is unique, multiplying the data by multiplies the root by : substitute into the equation. This is scale equivariance, the expected response to changing measurement units.