mlsanityData to 7 Oct 2026

Minimax Instrumental Variable Regression and L2 Convergence Guarantees without Identification or Closedness

arXiv 2302.05404 ↗First posted 10 Feb 2023stat.ML cs.LG econ.EMcited by 13

Not on the map. Why?

Abstract (arXiv)

In this paper, we study nonparametric estimation of instrumental variable (IV) regressions. Recently, many flexible machine learning methods have been developed for instrumental variable estimation. However, these methods have at least one of the following limitations: (1) restricting the IV regression to be uniquely identified; (2) only obtaining estimation error rates in terms of pseudometrics (e.g., projected norm) rather than valid metrics (e.g., L2 norm); or (3) imposing the so-called closedness condition that requires a certain conditional expectation operator to be sufficiently smooth. In this paper, we present the first method and analysis that can avoid all three limitations, while still permitting general function approximation. Specifically, we propose a new penalized minimax estimator that can converge to a fixed IV solution even when there are multiple solutions, and we derive a strong L2 error rate for our estimator under lax conditions. Notably, this guarantee only needs a widely-used source condition and realizability assumptions, but not the so-called closedness condition. We argue that the source condition and the closedness condition are inherently conflicting, so relaxing the latter significantly improves upon the existing literature that requires both conditions. Our estimator can achieve this improvement because it builds on a novel formulation of the IV estimation problem as a constrained optimization problem.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 21 of its 58 references that are in the map. First posted on arXiv 10 Feb 2023.

Builds on

21 of 58 references.

References · 21

  1. 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 581
  2. 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 285
  3. 2017Training GANs with Optimismcited by 217
  4. 2019Minimax Weight and Q-Function Learning for Off-Policy Evaluationcited by 150
  5. 2019Kernel Instrumental Variable Regressioncited by 118
  6. 2019Deep Generalized Method of Moments for Instrumental Variable Analysiscited by 88
  7. 2020Minimax Estimation of Conditional Moment Modelscited by 83
  8. 2021Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximationcited by 69
  9. 2020Learning Deep Features in Instrumental Variable Regressioncited by 65
  10. 2020Semiparametric proximal causal inferencecited by 58
  11. 2021Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiencycited by 54
  12. 2021Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approachcited by 43
9 more
  1. 2021Machine Learning For Elliptic PDEs: Fast Rate Generalization Bound, Neural Scaling Law and Minimax Optimalitycited by 40
  2. 2021Instrumental Variable Value Iteration for Causal Offline Reinforcement Learningcited by 35
  3. 2018Adversarial Generalized Method of Momentscited by 34
  4. 2020Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approachcited by 31
  5. 2020On Deep Instrumental Variables Estimatecited by 14
  6. 2022Beyond the Return: Off-policy Function Estimation under User-specified Error-measuring Distributionscited by 8
  7. 2021Learning Causal Models from Conditional Moment Restrictions by Importance Weightingcited by 7
  8. 2017Is completeness necessary? Estimation in nonidentified linear modelscited by 6
  9. 2014Nonparametric Stochastic Discount Factor Decompositioncited by 1

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 6; 2025: 4.

13 papers.

Sort: