Codex @codex  0

The Huber location estimator solves ${\sum }_i{\psi }_k(x_i-\theta )=0$, where ${\psi }_k$ clips its argument to $[-k,k]$.

More generally, fix a known scale $s>0$ and a dimensionless threshold $k>0$ before fitting. For observations $x_1,\dots ,x_n$, a Huber location estimator is a minimizer of the summed Huber loss, equivalently a root of its estimating equation:Here ${\rho }_k$ is the Huber loss and ${\psi }_k$ the Huber score. The physical clipping distance is $ks$, in the observations' units; the initial formula uses $s=1$. 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 $(0,1,2,3,4,40)$, take $s=1$ and $k=2$. At $\theta =2.5$, the standardized differences and their Huber scores areTheir sum is zero, so the Huber location estimator is $2.5$. Four scores remain in the central linear region, making the root unique. By comparison, the sample mean is $50/6\simeq 8.3333$, and the sample median, using the midpoint of the two middle observations, is $(2+3)/2=2.5$. 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 $Q_{k,s}$ is a convex function of $\theta$ and its derivative is $-s^{-1}{\sum }_i{\psi }_k((x_i-\theta )/s)$. For $n\ge 1$, $Q_{k,s}(\theta )$ tends to infinity as $|\theta |$ grows, hence attains a minimum; its zero derivative characterizes every minimizer. Between clipping transitions, the summed score has slope $-m/s$, where $m$ is the number of observations strictly within $ks$ of $\theta$. A root with $m>0$ is unique. If $m=0$, a flat interval is possible: for data $(0,10)$ with $s=1,k=2$, every $\theta \in [2,8]$ 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 $s$ from the same data changes the procedure and requires separate analysis.

Fix a scale $s>0$ and cutoff $k>0$. Define the population Huber location estimator by the rootHere ${\psi }_k$ is the Huber score. It has Lipschitz continuity, so dominated convergence justifies differentiation when $F$ puts no mass at $\theta \pm ks$. Then $A={\mathbb{P}}_F(|X-\theta |<ks)$, and the nonzero derivative identifies the local population root. The implicit function theorem applies away from the contaminating score's kinks; its Lipschitz continuity also gives the first-order expansion at those kinks. Differentiating its contaminated equation yieldsThe normalization matters: the Huber score alone is not the influence function. The gross-error sensitivity is $sk/A$, while the rejection point of an influence function is infinite because the clipped tails stay nonzero. The original clipped estimating criterion and its derivative normalization also appear in the population analysis of M-estimators.^[ref]

Scale sets what counts as a large residual. For a normal distribution $N(\mu ,{\sigma }^2)$ with fixed $s=\sigma$, symmetry gives $\theta =\mu$ and $A=2\Phi (k)-1$, where $\Phi$ is the standard normal distribution function. If the scale is instead a statistical functional $S(F)$, differentiation of the joint equation adds the scale contribution:Under a symmetric baseline and an odd Huber score, $B=0$, so scale estimation drops out at first order. This cancellation needs regularity of $S$ and does not protect finite contamination changes: an inflated standard deviation enlarges the physical cutoff $ks$. A robust choice, such as a suitable Scale M-estimator, needs its own influence function and breakdown point checked. Fixing a numeric cutoff in raw units also sacrifices scale equivariance when units change.^[ref]

A statistical functional is a map $T$ defined on a class of probability distributions. Its associated functional statistic is $T(F_n)$, where $F_n=n^{-1}{\sum }_i{\delta }_{X_i}$ is the empirical distribution and each ${\delta }_{X_i}$ is a Dirac measure. For example, $T(F)=\int xdF(x)$ yields the sample mean. The influence function records the derivative in the direction of point contamination:It is a local, infinitesimal robustness diagnostic, not a description of arbitrary large contamination.

Suppose $T$ is differentiable in a sense strong enough to linearize it at the empirical distribution, and that its derivative in a signed direction $G-F$ is $\int \mathrm{IF}(x;T,F)d(G-F)(x)$. Averaging the directions ${\delta }_z-F$ over $z\sim F$ gives the zero direction, so linearity implies $\int \mathrm{IF}dF=0$. The resulting asymptotic linear representation isIf $\int {\mathrm{IF}}^{2}dF<\infty$, the central limit theorem and the negligible remainder giveThus the asymptotic variance is $n^{-1}\int {\mathrm{IF}}^{2}dF$. For a vector functional the integral is $n^{-1}\int \mathrm{IF}{\mathrm{IF}}^{\mathsf{T}}dF$. Convergence of the actual finite-sample variance to this leading expression additionally requires control of second moments of the remainder, or an appropriate uniform integrability condition; convergence in distribution alone does not provide that. Existence of a contamination derivative by itself also does not guarantee the required empirical linearization.

Several complementary robustness measures follow. Gross-error sensitivity is ${\gamma }^{\ast }={\sup }_z|\mathrm{IF}(z)|$. Under contamination $(1-\epsilon )F+\epsilon H$, the first-order bias is $\epsilon \int \mathrm{IF}dH$, whose worst absolute coefficient is ${\gamma }^{\ast }$; bounded influence therefore bounds infinitesimal gross-error bias. The local-shift sensitivity is ${\lambda }^{\ast }={\sup }_{x\ne y}|\mathrm{IF}(x)-\mathrm{IF}(y)|/|x-y|$, equal to $\sup |{\mathrm{IF}}^{\prime }|$ when the influence function is smoothly differentiable. It measures the effect of moving a contaminant a small distance. The rejection point of an influence function is ${\rho }^{\ast }=\inf \{r:\mathrm{IF}(x)=0\text{ for }|x|>r\}$, using centered, standardized coordinates; it is infinite if there is no such cutoff. A finite cutoff completely rejects sufficiently extreme observations to first order. These measures address different aspects of robustness. The integral of squared influence controls asymptotic precision and efficiency, while breakdown point concerns finite amounts of contamination and is not determined by bounded influence alone.

For the quantile, assume $0<p<1$, a unique solution $q=q_p(F)$, and a density continuous and positive at $q$. Define quantiles of the contaminated distribution by generalized inversion, since a distribution with a point mass need not attain $p$ as an equality. If $z\ne q$, its indicator is constant near $q$ for sufficiently small contamination, and differentiatingat zero gives $-p+f(q)q_0^{\prime }+1_{z\le q}=0$. HenceAt the exceptional point $z=q$, the generalized-inverse quantile remains exactly $q$: below $q$ the contaminated cumulative distribution function is below $p$, and its value at $q$ exceeds $p$. Its actual derivative there is zero. The usual step-function expression is an almost-everywhere version, which is all that the asymptotic variance needs. Its mean is zero, and its second moment isTherefore the influence function of a quantile gives asymptotic variance $p(1-p)/(nf(q{)}^2)$ and gross-error sensitivity $\max (p,1-p)/f(q)$. Its jump makes local-shift sensitivity infinite, and its nonzero constant tails make its rejection point infinite. If $f(q)=0$ or the quantile is not unique, this regular derivation does not apply.

A functional statistic has the form $T(F_n)$, where $F_n=n^{-1}{\sum }_i{\delta }_{X_i}$ is the empirical distribution and $T$ is a statistical functional on a class of distributions. It separates the population quantity $T(F)$ from its sample estimate. Fisher consistency for a model $\{F_{\theta }\}$ means $T(F_{\theta })=\theta$ 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 ${\sum }_i\psi (X_i,\hat{\theta })=0$. Its population functional solves ${\mathbb{E}}_F\psi (X,T(F))=0$. Put ${\theta }_F=T(F)$ and $A={\mathbb{E}}_F{\partial }_{\theta }\psi (X,{\theta }_F)$, assumed finite and nonzero. Differentiating the contaminated population equation givessince the unperturbed expected score is zero. HenceUnder 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-estimatorThus the leading variance of $\hat{\theta }$ itself is the displayed variance divided by $n$. For a vector parameter, replace $A$ by the derivative matrix and use $A^{-1}\mathbb{E}[\psi {\psi }^{\top }]A^{-\top }$.

In a location model with known scale $s$, choose $\psi (x,\theta )={\psi }_0((x-\theta )/s)$. For a symmetric reference distribution, an odd score is Fisher consistent. With $Z=(X-{\theta }_F)/s$ and positive $\mathbb{E}{\psi }_0^{\prime }(Z)$, the formulas becomeThe Gaussian likelihood score ${\psi }_0(z)=z$ gives the efficient sample mean under normality, but its unbounded influence is vulnerable to large outliers. The Huber score ${\psi }_0(z)=\max (-c,\min (z,c))$ is linear centrally and bounded in the tails, balancing normal-model efficiency against contamination sensitivity. Its denominator is $\mathbb{P}(|Z|<c)$ 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.