Pith. sign in

REVIEW 3 cited by

Automatic Debiased Machine Learning via Riesz Regression

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.14737 v3 pith:YDYQJHFL submitted 2021-04-30 math.ST econ.EMstat.TH

classification math.STecon.EMstat.TH
keywords machinedebiasedlearningrieszautomaticdebiasingestimatorsparameters
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A variety of interesting parameters may depend on high dimensional regressions. Machine learning can be used to estimate such parameters. However estimators based on machine learners can be severely biased by regularization and/or model selection. Debiased machine learning uses Neyman orthogonal estimating equations to reduce such biases. Debiased machine learning generally requires estimation of unknown Riesz representers. A primary innovation of this paper is to provide Riesz regression estimators of Riesz representers that depend on the parameter of interest, rather than explicit formulae, and that can employ any machine learner, including neural nets and random forests. End-to-end algorithms emerge where the researcher chooses the parameter of interest and the machine learner and the debiasing follows automatically. Another innovation here is debiased machine learners of parameters depending on generalized regressions, including high-dimensional generalized linear models. An empirical example of automatic debiased machine learning using neural nets is given. We find in Monte Carlo examples that automatic debiasing sometimes performs better than debiasing via inverse propensity scores and never worse. Finite sample mean square error bounds for Riesz regression estimators and asymptotic theory are also given.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fisher Random Walk: Automatic Debiasing Contextual Preference Inference for Large Language Model Evaluation

    stat.ML 2025-09 conditional novelty 7.0 of 10

    A Fisher random walk weighted residual estimator achieves semiparametric efficient confidence intervals for contextual Bradley-Terry-Luce preference comparisons with flexible score estimators.

  2. On regression with estimated covariates and conditional effects given the propensity score

    stat.ME 2026-07 conditional novelty 6.0 of 10

    New debiased estimators for regression on an estimated propensity score can approach oracle rates, with the corrected plug-in reaching n^{-2/5} under explicit accuracy conditions.

  3. Double Machine Learning for Conditional Moment Restrictions: IV Regression, Proximal Causal Learning and Beyond

    stat.ML 2025-06 reject novelty 5.0 of 10

    A DML estimator for conditional moment restrictions is proposed, but its central N^{-1/2} rate theorem is broken because the selected score is degenerate at the truth.

Pith tools