Debiased Machine Learning and Riesz Regression

Machine learning estimates of causal and structural parameters are biased by their own regularization. This project is about the correction term — how to estimate it, and what estimating it well buys you.

The question

Plug a flexible machine learning fit into a causal estimand and the regularization that made the fit possible leaves a first-order bias behind. Debiased machine learning removes it with a Neyman-orthogonal score whose correction term is built from the Riesz representer of the target functional — inverse propensity weights for the average treatment effect, and their analogues elsewhere.

So the accuracy of the whole procedure is inherited from the quality of the representer estimate. Several methods exist for that step — Riesz regression, tailored loss minimization, covariate balancing, density ratio fitting — developed separately, with separate justifications. Are they instances of one thing?

A unified answer

Generalized Riesz regression estimates the representer by minimizing a Bregman divergence. Squared distance recovers Riesz regression; KL divergence recovers tailored loss minimization; other divergences give new estimators. Two properties follow from the structure rather than being imposed:

Convergence is analyzed for RKHS and neural network classes, and the framework is released as the genriesz Python package.

Related threads

Software

genriesz — specify the target functional, the representer model, and the Bregman divergence; the package constructs the link function, cross-fits, and returns estimates with inference for average treatment effects, treatment-specific means, and marginal effects. GitHub · Documentation

Papers in this project

Each entry links to a short note; the publication list has the complete record.

Other projects