Direct Debiased Machine Learning via Bregman Divergence Minimization
Masahiro Kato

TL;DR
This paper introduces a unified, direct debiased machine learning framework using Bregman divergence minimization, enabling automatic debiasing, covariate balancing, and improved estimation in causal and structural models.
Contribution
It develops a novel end-to-end algorithm for Neyman targeted estimation that unifies Riesz regression, TMLE, and covariate balancing through Bregman divergence minimization.
Findings
Framework unifies multiple debiased learning methods
Automatic covariate balancing without explicit optimization
Enhanced estimation accuracy in causal inference tasks
Abstract
We develop a direct debiased machine learning framework comprising Neyman targeted estimation and generalized Riesz regression. Our framework unifies Riesz regression for automatic debiased machine learning, covariate balancing, targeted maximum likelihood estimation (TMLE), and density-ratio estimation. In many problems involving causal effects or structural models, the parameters of interest depend on regression functions. Plugging regression functions estimated by machine learning methods into the identifying equations can yield poor performance because of first-stage bias. To reduce such bias, debiased machine learning employs Neyman orthogonal estimating equations. Debiased machine learning typically requires estimation of the Riesz representer and the regression function. For this problem, we develop a direct debiased machine learning framework with an end-to-end algorithm. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
