Debiased Machine Learning: Identification, Estimation, and Shape Constraints

• URL: http://arxiv.org/abs/2607.24472v2
• Date: Thu, 30 Jul 2026 02:33:09 GMT
• Title: Debiased Machine Learning: Identification, Estimation, and Shape Constraints
• Abstract summary: We develop a general framework of identification and estimation for automatic debiased machine learning (DML)<n>We establish conditions under which the Riesz representer $_0$, which is at the core of DML, is identified.<n>We illustrate our estimation procedure through simulations and empirical applications.
• Score: 2.1697238777468155
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop a general framework of identification and estimation for automatic debiased machine learning (DML) where the parameter of interest $θ_0$ is identified by a moment condition involving a nuisance $γ_0$ that may be high dimensional. We establish conditions under which the Riesz representer $α_0$, which is at the core of DML, is identified, and show that the identification occurs precisely when $α_0$ uniquely optimizes a quadratic functional. This characterization enables us to develop a general estimation procedure for $α_0$ that allows for generic $γ_0$ including those defined by models with endogeneity and encompasses both classical sieves and modern architectures such as deep neural networks. To improve estimation precision and mitigate the curse of dimensionality, we incorporate shape constraints on $γ_0$ by embedding them into a possibly nonlinear parameter space. We illustrate our estimation procedure through simulations and empirical applications.

Related papers

• Replica Symmetry Breaking and Algorithmic Thresholds in Empirical Risk Minimization under Multi-Index Model [12.775038922010452]
  Modern machine learning models are optimized by optimizing high-dimensional non-dimensional empirical risk functions.<n>Within a simple supervised learning setting, we develop a precise picture of the empirical risk landscape.<n>We propose an approximate incremental message passing (ImAMP) algorithm and precisely characterize it.
  arXiv  Detail & Related papers  (2026-06-26T19:57:08Z)
• Machine Learning Surrogate Modeling for Homogenization of Hyperelastic Materials with Boolean Microstructures [0.0]
  Data-driven surrogate models are an alternative to numerical homogenization of heterogeneous materials.<n>A neural network is trained on combinations of scalar and curve-wise statistical descriptors.<n>Additional data representing limiting cases of the parameter space are incorporated to stabilize training and improve extrapolation behavior.
  arXiv  Detail & Related papers  (2026-05-31T00:51:52Z)
• Informative Perturbation Selection for Uncertainty-Aware Post-hoc Explanations [7.226144684379189]
  Trust and ethical concerns due to the widespread deployment of opaque machine learning (ML) models motivating the need for reliable model explanations.<n>Post-hoc model-agnostic explanation methods addresses this challenge by learning a surrogate model that approximates the behavior of the deployed black-box ML model in the locality of a sample of interest.<n>We propose emphExpected Active Gain for Local Explanations (textttEAGLE), a post-hoc model-agnostic explanation framework that formulates perturbation selection as an information-theoretic active learning problem.
  arXiv  Detail & Related papers  (2026-03-16T06:48:56Z)
• The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective [55.15192437680943]
  We study the sample complexity of online reinforcement learning in the general setting of nonlinear dynamical systems with continuous state and action spaces.<n>Our algorithm achieves a policy regret of $mathcalO(N epsilon2 + mathrmln(m(epsilon)/epsilon2)$, where $epsilon$ is the time horizon.<n>In the special case where the dynamics are parametrized by a compact and real-valued set of parameters, we prove a policy regret of $mathcalO(sqrt
  arXiv  Detail & Related papers  (2025-01-27T10:01:28Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Computational-Statistical Gaps in Gaussian Single-Index Models [77.1473134227844]
  Single-Index Models are high-dimensional regression problems with planted structure. We show that computationally efficient algorithms, both within the Statistical Query (SQ) and the Low-Degree Polynomial (LDP) framework, necessarily require $Omega(dkstar/2)$ samples.
  arXiv  Detail & Related papers  (2024-03-08T18:50:19Z)
• On the Identifiability and Estimation of Causal Location-Scale Noise Models [122.65417012597754]
  We study the class of location-scale or heteroscedastic noise models (LSNMs) We show the causal direction is identifiable up to some pathological cases. We propose two estimators for LSNMs: an estimator based on (non-linear) feature maps, and one based on neural networks.
  arXiv  Detail & Related papers  (2022-10-13T17:18:59Z)
• Towards Instance-Wise Calibration: Local Amortized Diagnostics and Reshaping of Conditional Densities (LADaR) [2.6852053271659257]
  This paper introduces the LADaR (Local Amortized Diagnostics and Reshaping of Conditional Densities) framework.<n>It produces interpretable local diagnostics and provides a mechanism for adjusting conditional density estimates.<n>$textttCal-PIT$ learns a single interpretable local probability--probability map from calibration data.
  arXiv  Detail & Related papers  (2022-05-29T03:52:44Z)
• Inverting brain grey matter models with likelihood-free inference: a tool for trustable cytoarchitecture measurements [62.997667081978825]
  characterisation of the brain grey matter cytoarchitecture with quantitative sensitivity to soma density and volume remains an unsolved challenge in dMRI. We propose a new forward model, specifically a new system of equations, requiring a few relatively sparse b-shells. We then apply modern tools from Bayesian analysis known as likelihood-free inference (LFI) to invert our proposed model.
  arXiv  Detail & Related papers  (2021-11-15T09:08:27Z)
• Sinkhorn Natural Gradient for Generative Models [125.89871274202439]
  We propose a novel Sinkhorn Natural Gradient (SiNG) algorithm which acts as a steepest descent method on the probability space endowed with the Sinkhorn divergence. We show that the Sinkhorn information matrix (SIM), a key component of SiNG, has an explicit expression and can be evaluated accurately in complexity that scales logarithmically. In our experiments, we quantitatively compare SiNG with state-of-the-art SGD-type solvers on generative tasks to demonstrate its efficiency and efficacy of our method.
  arXiv  Detail & Related papers  (2020-11-09T02:51:17Z)
• Identification of Probability weighted ARX models with arbitrary domains [75.91002178647165]
  PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system. In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX) The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field.
  arXiv  Detail & Related papers  (2020-09-29T12:50:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.