Neyman Orthogonality

Summary

A score identifying via is Neyman orthogonal if its pathwise (Gateaux) derivative with respect to the nuisance vanishes at the truth: . The moment condition is then locally insensitive to nuisance error, so noisy, regularized ML estimates can be plugged in without first-order damage: the remaining bias is second order (a product or square of nuisance errors), and -inference on needs only . The idea is due to Neyman (1959, 1979; the test); Chernozhukov et al. (2018) make it, together with cross-fitting, one of the two generic keys of DML.

Overview

Think of the population moment as a surface over . The estimator solves . A Taylor expansion in the nuisance direction gives

After scaling by , the first-order term is for any ML learner with — that is term in Regularization Bias and the Partially Linear Model. Orthogonality sets the first-order term to zero by construction, leaving , which vanishes for .

Main Content

Pathwise derivative and Neyman orthogonality (Def. 2.1) ^def-neyman-orth

Let be a convex nuisance space and a nuisance realization set containing with high probability (a shrinking neighborhood of ). Define

and write . The score obeys the orthogonality condition at with respect to if and

Near-orthogonality (Def. 2.2) ^def-near-orth

is near-orthogonal if for all , with . This covers scores whose orthogonalizing parameter is itself regularized (e.g. a lasso-estimated satisfying ).

Check on the PLR model. For the naive score , a perturbation gives . For the DML score with ,

because and . The second derivative is — the product structure that produces term .

Constructing orthogonal scores (§2.2)

Neyman's construction for (quasi-)likelihood problems (Lemma 2.1) ^thm-neyman-construction

Let maximize with finite-dimensional nuisance , and let be partitioned into . The score

with solving , is Neyman orthogonal at — with respect to both and . When is the true log-likelihood, is also the efficient score (Remark 2.2).

In words: project the -score off the span of the nuisance scores. Applied to the high-dimensional linear model , (Example 2.1), one gets , , and

the “double lasso”/partialling-out score. The paper gives parallel constructions for GMM problems (Lemma 2.3: with chosen to annihilate the nuisance Jacobian ), for M-estimation with infinite-dimensional nuisance via concentrating-out (Lemma 2.5: profile and differentiate totally in ), and for conditional moment restrictions (Lemma 2.6).

Orthogonal score = original score + influence-function adjustment (§2.2.5) ^thm-if-adjustment

If a first-step estimator admits the expansion (Newey 1994), then

is Neyman orthogonal, and is the influence function of the limit of . For PLR: the derivative of in has conditional mean ; multiplying by the nonparametric residual gives and hence .

This is why the AIPW/doubly-robust score is orthogonal (DML Estimators for ATE and the Interactive Model): it is the plug-in plus the influence-function correction for estimating .

What orthogonality buys (§3.2)

Rate requirements under orthogonality ^thm-rates

For linear scores , Assumptions 3.1–3.2 require (near-)orthogonality with , identification ( with singular values in ), and statistical rates

In smooth problems and where , so the crude requirement is (eq. 3.8). When the second derivative vanishes identically, — the optimal-instrument problem, PLR with known , and treatment-effect problems with known propensity score (RCTs) — the requirement collapses to mere consistency, .

The rate is attainable: -penalized methods under approximate sparsity, -boosting in sparse linear models, certain trees/forests (Wager & Walther 2016), and classes of neural nets (Chen & White 1999) — the paper’s list on p. 26. Given these conditions, Theorem 3.1 delivers uniformly over , with influence function and . Uniformity — robustness to perturbations of along sequences — “can be shown to fail for methods not based on orthogonal scores.”

Two caveats the paper states explicitly: orthogonality is “a joint property of the score, the true parameter value , the parameter set , and the distribution of ” rather than of a model for ; and orthogonal scores need not be efficient (Remark 2.3: a regularized gives up efficiency), though if is the efficient score the DML estimator attains the semiparametric bound (Corollary 3.2).

Examples

Numerical intuition. Suppose and both nuisances are learned at rate . Non-orthogonal score: bias in is of order — four standard-error-scale units of bias, so a nominal 95% CI has near-zero coverage. Orthogonal score: — negligible relative to the Gaussian term.

Catalogue of orthogonal scores in the DML paper.

ModelScore Nuisance
PLR (4.3)
PLR, Robinson (4.4)
Partially linear IV (4.7),
PLIV, Robinson (4.8)
ATE (5.3)AIPW score
ATTE (5.4), LATE (§5.2)see DML Estimators for ATE and the Interactive Model;

Connections

See Also