Triple Lasso Estimator

• Triple Lasso Estimator is a high-dimensional inference method that combines doubly robust orthogonalization, cross-fitting, and debiasing to estimate both conditional treatment effects and regression parameters.
• It uses pseudo-outcomes, sparse-differences assumptions, and moment functions satisfying first- and second-order orthogonality to control regularization bias.
• The approach enhances efficiency through weighted DR-Lasso refinements, cross-validation, and stability in asymptotic linearity under high-dimensional, sparse setups.

Searching arXiv for the specified papers to ground the article in the cited literature. arxiv_search(query="(Kato, 2024) Triple/Debiased Lasso for Statistical Inference of Conditional Average Treatment Effects", max_results=5) The Triple Lasso estimator denotes two related high-dimensional inference constructions that combine Lasso-based nuisance estimation with explicit bias correction. In "Triple/Debiased Lasso for Statistical Inference of Conditional Average Treatment Effects" (Kato, 2024), the term refers to estimation and inference for conditional average treatment effects under a sparse-differences structure, using doubly robust orthogonalization, cross-fitting, and debiased Lasso. In "Triple/Double-Debiased Lasso" (Chetverikov et al., 20 Mar 2026), the term refers to inference on a low-dimensional parameter in a high-dimensional linear regression model using a moment function that satisfies both first- and second-order Neyman orthogonality conditions.

1. Terminological scope and distinguishing uses

The label has two distinct uses in the recent literature. One use is causal: it targets

$\tau(x)=E[Y(1)-Y(0)\mid X=x]$

in observational settings with binary treatment and high-dimensional covariates. The other is regression-based: it targets a scalar coefficient $\beta_0$ in a high-dimensional linear model with many controls. In both uses, the central idea is to combine orthogonalization and desparsification so that valid inference remains feasible when $p \gg n$ (Kato, 2024, Chetverikov et al., 20 Mar 2026).

Formulation	Target	Meaning of “triple”
Triple/Debiased Lasso	CATE $\tau(x)=x'\beta_\Delta$	Doubly robust orthogonalization, cross-fitting DML, and debiased Lasso
Triple/Double-Debiased Lasso	Low-dimensional $\beta_0$	First-order debiasing plus a second-order correction term

A recurring source of confusion is the relation to “triple selection” Lasso. The causal paper states that “Triple/Debiased Lasso” refers to combining (1) doubly robust orthogonalization, (2) cross-fitting (DML), and (3) debiased Lasso, and that it differs from “triple selection” terminology in other contexts (Kato, 2024). The 2026 paper uses “triple” and “double-debiased” interchangeably to emphasize elimination of both leading and second-order regularization bias (Chetverikov et al., 20 Mar 2026).

2. CATE formulation: sparse differences and orthogonal pseudo-outcomes

In the CATE formulation, observations are i.i.d. copies of $(Y,D,X)$, with binary treatment $D\in\{0,1\}$, real-valued outcome $Y$, and $p$-dimensional covariates $X\in\mathbb{R}^p$. Potential outcomes $\beta_0$0 are bounded, and the observed outcome satisfies

$\beta_0$1

Identification uses unconfoundedness,

$\beta_0$2

and overlap, requiring $\beta_0$3 almost surely for some $\beta_0$4 (Kato, 2024).

With propensity score $\beta_0$5 and outcome regressions $\beta_0$6, the target is

$\beta_0$7

Under the linear high-dimensional outcome model $\beta_0$8, the CATE becomes

$\beta_0$9

The key structural assumption is sparsity-in-differences: $p \gg n$0 is sparse or approximately sparse even if $p \gg n$1 and $p \gg n$2 are individually dense. This is the condition that enables high-dimensional inference for $p \gg n$3 under $p \gg n$4 (Kato, 2024).

The construction begins from the AIPW or doubly robust pseudo-outcome

$p \gg n$5

Its conditional mean equals the CATE if either $p \gg n$6 is correctly specified or $p \gg n$7 is correctly specified. The same pseudo-outcome is Neyman orthogonal in the sense that the Gateaux derivative of $p \gg n$8 with respect to small perturbations of the nuisance functions is zero at the truth. The paper states that this orthogonality mitigates the impact of first-stage estimation errors and enables $p \gg n$9-inference under mild product-rate conditions via cross-fitting (Kato, 2024).

3. Weighted DR-Lasso and the debiasing step for CATE inference

Under the linear CATE specification, the pseudo-outcome is projected onto the covariates: $\tau(x)=x'\beta_\Delta$0 An unweighted Lasso estimator is defined by

$\tau(x)=x'\beta_\Delta$1

with theoretical tuning $\tau(x)=x'\beta_\Delta$2, while cross-validation is common in practice. Estimation relies on restricted eigenvalue or compatibility conditions on $\tau(x)=x'\beta_\Delta$3 or its sample analog (Kato, 2024).

Because the doubly robust pseudo-outcome has covariate-dependent conditional variance,

$\tau(x)=x'\beta_\Delta$4

the method introduces a weighted least squares refinement. Both $\tau(x)=x'\beta_\Delta$5 and $\tau(x)=x'\beta_\Delta$6 are scaled by $\tau(x)=x'\beta_\Delta$7, producing the weighted design

$\tau(x)=x'\beta_\Delta$8

The weighted DR-Lasso estimator is

$\tau(x)=x'\beta_\Delta$9

Cross-fitting is essential. The sample is split into $\beta_0$0 folds; for each fold, nuisance estimators $\beta_0$1 are fit on the complement data, and out-of-fold pseudo-outcomes are computed: $\beta_0$2

The final desparsification step uses an approximate inverse $\beta_0$3, where $\beta_0$4, and forms

$\beta_0$5

In practice, $\beta_0$6 is built by nodewise Lasso: for each column $\beta_0$7, $\beta_0$8 is regressed on $\beta_0$9, producing $(Y,D,X)$0 and $(Y,D,X)$1, and then $(Y,D,X)$2 with $(Y,D,X)$3 and $(Y,D,X)$4 having $(Y,D,X)$5 on the diagonal and $(Y,D,X)$6 off-diagonals. The paper terms the resulting estimator Triple/Debiased Lasso because it combines (i) doubly robust orthogonalization (AIPW), (ii) cross-fitting DML, and (iii) debiased Lasso (Kato, 2024).

4. CATE theory, inference, practice, and extensions

The CATE paper states consistency of the weighted DR-Lasso under high-dimensional design conditions, overlap, bounded potential outcomes, and nuisance estimates that are $(Y,D,X)$7-consistent and satisfy the standard DML product-rate condition

$(Y,D,X)$8

When $(Y,D,X)$9 satisfies $D\in\{0,1\}$0, the weighted DR-Lasso has $D\in\{0,1\}$1-error and prediction error bounds of the stated $D\in\{0,1\}$2-orders. The debiased estimator

$D\in\{0,1\}$3

is asymptotically linear, and the paper gives coordinate-wise asymptotic normality as well as inference for linear functionals and pointwise CATEs (Kato, 2024).

For any $D\in\{0,1\}$4, the estimator and plug-in variance are

$D\in\{0,1\}$5

which yield the pointwise confidence interval

$D\in\{0,1\}$6

The paper summarizes the main takeaway as follows: under standard high-dimensional and DML conditions—compatibility, sub-Gaussian design, overlap, and the nuisance product-rate condition—TDL is $D\in\{0,1\}$7-consistent and asymptotically normal for coordinates of $D\in\{0,1\}$8 and for linear functionals such as $D\in\{0,1\}$9 (Kato, 2024).

Practical guidance is stated in operational terms. For cross-fitting, $Y$0 or $Y$1 folds are suggested, and repeat-splitting and averaging can stabilize. Cross-validation is common for $Y$2 and $Y$3, although $Y$4 is a default. Standardizing $Y$5, checking overlap through the distribution of $Y$6, monitoring AIPW residuals, and comparing weighted with unweighted variants are recommended. The weighted step is described as improving efficiency but requiring estimation of $Y$7; if unstable, the paper suggests starting with unweighted TDL and comparing (Kato, 2024).

The reported simulations vary $Y$8, $Y$9, and sparsity $p$0, with $p$1 sparse while $p$2 and $p$3 need not be. The key findings are that WDML-CATELasso is consistent, WTDL achieves near-nominal coverage for coordinates of $p$4 and for linear functionals $p$5, and weighting by $p$6 improves efficiency through smaller standard errors relative to unweighted debiased Lasso on $p$7. The same source also states that WTDL has reduced RMSE relative to unweighted variants and DR-learners that ignore heteroskedasticity (Kato, 2024).

The framework is also presented as extensible. The paper explicitly discusses replacing $p$8 by a high-dimensional feature map $p$9 for nonlinear CATEs, generalizing the orthogonal score to multi-valued or continuous treatments, building analogous scores for binary or count outcomes, and using group Lasso or structured penalties for structured sparsity. These are presented as extensions for which formal theory would require corresponding conditions (Kato, 2024).

5. Triple/Double-Debiased Lasso in high-dimensional linear regression

The 2026 formulation considers the high-dimensional linear regression model

$X\in\mathbb{R}^p$0

where $X\in\mathbb{R}^p$1, $X\in\mathbb{R}^p$2 is the regressor of interest, $X\in\mathbb{R}^p$3 are controls with $X\in\mathbb{R}^p$4 allowed, $X\in\mathbb{R}^p$5 is the target parameter, and $X\in\mathbb{R}^p$6 is an approximately sparse nuisance vector. It also uses the first-stage and reduced-form regressions

$X\in\mathbb{R}^p$7

$X\in\mathbb{R}^p$8

with $X\in\mathbb{R}^p$9 and $\beta_0$00 (Chetverikov et al., 20 Mar 2026).

The benchmark double Lasso score is

$\beta_0$01

At the truth, this moment satisfies first-order orthogonality with respect to $\beta_0$02 and $\beta_0$03, but not second-order orthogonality. The triple or double-debiased construction adds an adjustment term,

$\beta_0$04

where $\beta_0$05 is an independent copy of $\beta_0$06. The resulting moment is

$\beta_0$07

Using independence, the paper rewrites this as

$\beta_0$08

The central lemma states that if $\beta_0$09 is invertible and $\beta_0$10 have finite second moments, then

$\beta_0$11

Thus, $\beta_0$12 is both first- and second-order Neyman orthogonal at the truth. The paper presents this as the mechanism that eliminates both the leading bias and the second-order bias induced by regularization (Chetverikov et al., 20 Mar 2026).

Estimation uses cross-fitting and Lasso throughout. In each fold, $\beta_0$13 and $\beta_0$14 are estimated by Lasso on the training sample; $\beta_0$15 is estimated row-by-row by node-wise Lasso; and the node-wise matrix is then row-sparsified by zeroing rows not selected by the first stage. On the holdout fold, residuals

$\beta_0$16

are used to construct fold-specific quantities

$\beta_0$17

$\beta_0$18

yielding the closed-form fold estimator

$\beta_0$19

The paper recommends penalties of order $\beta_0$20, small fixed $\beta_0$21, and emphasizes row-sparsification of $\beta_0$22 for variance control in high dimension (Chetverikov et al., 20 Mar 2026).

6. Higher-order orthogonality, asymptotics, simulations, and relation to adjacent methods

For the 2026 formulation, the main asymptotic result is an asymptotic linear representation in which the remainder terms are never larger and are often smaller in order than the corresponding remainder for cross-fitted double Lasso. Under bounded fourth moments for $\beta_0$23 and $\beta_0$24, invertibility of $\beta_0$25, sparse eigenvalue conditions, and standard approximate sparsity and node-wise Lasso rate conditions, the paper shows

$\beta_0$26

A natural variance estimator uses fold-specific residuals

$\beta_0$27

$\beta_0$28

and constructs

$\beta_0$29

leading to

$\beta_0$30

The same source contrasts this with cross-fitted double Lasso, whose remainder is of order $\beta_0$31, and states that the triple Lasso remainder terms are often strictly smaller (Chetverikov et al., 20 Mar 2026).

The Monte Carlo study uses Gaussian designs with $\beta_0$32, Toeplitz covariance, $\beta_0$33, $\beta_0$34, $\beta_0$35, approximately sparse $\beta_0$36, and both exact and approximate sparsity designs for $\beta_0$37. Performance metrics are squared bias, variance, MSE, empirical 95\% CI coverage, CI length, and kernel densities of studentized statistics. The reported numerical comparisons are explicit: with $\beta_0$38 under approximate sparsity, squared bias drops from 0.00216 under double Lasso to 0.00025 under triple Lasso; with $\beta_0$39, it drops from 0.00082 to 0.00009. In the same difficult design $\beta_0$40 under approximate sparsity, empirical coverage rises from 0.672 to 0.923, with only slightly longer intervals. The paper summarizes these results as showing that studentized statistics under triple Lasso are better centered and closer to $\beta_0$41, consistent with reduced second-order bias (Chetverikov et al., 20 Mar 2026).

The 2026 paper further embeds the construction in a general recursive formula for constructing higher-order Neyman orthogonal moment functions in Z-estimation problems. For $\beta_0$42, the recursion produces

$\beta_0$43

and the paper states that the triple Lasso score is the $\beta_0$44 instance of this general construction. This places the method in a broader line of work on orthogonal scores, double/debiased Lasso, double machine learning, and higher-order influence-function methods, while retaining a specifically regression-based construction with ordinary derivatives (Chetverikov et al., 20 Mar 2026).

Two objective clarifications follow from the paired literature. First, triple lasso is not a single estimator with one universal definition; the phrase identifies related but non-identical estimators. Second, in both uses the added “triple” layer is a bias-control device beyond standard first-order orthogonalization: in the CATE setting it is the combination of AIPW orthogonalization, cross-fitting, and debiased Lasso, whereas in the low-dimensional linear regression setting it is a second-order orthogonal correction to the standard double Lasso score (Kato, 2024, Chetverikov et al., 20 Mar 2026).