Minimax Estimation of Conditional Moment Models
Nishanth Dikkala, Greg Lewis, Lester Mackey, Vasilis Syrgkanis
Abstract
We develop an approach for estimating models described via conditional moment restrictions, with a prototypical application being non-parametric instrumental variable regression. We introduce a min-max criterion function, under which the estimation problem can be thought of as solving a zero-sum game between a modeler who is optimizing over the hypothesis space of the target model and an adversary who identifies violating moments over a test function space. We analyze the statistical estimation rate of the resulting estimator for arbitrary hypothesis spaces, with respect to an appropriate analogue of the mean squared error metric, for ill-posed inverse problems. We show that when the minimax criterion is regularized with a second moment penalty on the test function and the test function space is sufficiently rich, then the estimation rate scales with the critical radius of the hypothesis and test function spaces, a quantity which typically gives tight fast rates. Our main result follows from a novel localized Rademacher analysis of statistical learning problems defined via minimax objectives. We provide applications of our main results for several hypothesis spaces used in practice such as: reproducing kernel Hilbert spaces, high dimensional sparse linear functions, spaces defined via shape constraints, ensemble estimators such as random forests, and neural networks. For each of these applications we provide computationally efficient optimization methods for solving the corresponding minimax problem (e.g. stochastic first-order heuristics for neural networks). In several applications, we show how our modified mean squared error rate, combined with conditions that bound the ill-posedness of the inverse problem, lead to mean squared error rates. We conclude with an extensive experimental analysis of the proposed methods. A very preliminary version of this work appeared as Adversarial Generalized Method of Moments (see https://arxiv.org/abs/1803.07164 ) Preprint. Under review.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers32
- Proximal Causal Learning with Kernels: Two-Stage Estimation and Moment RestrictionAfsaneh Mastouri, Yuchen Zhu, Limor Gultchin, Anna Korba et al.ICML 2021 · 78 citations
- Provably Efficient Reinforcement Learning in Partially Observable Dynamical SystemsMasatoshi Uehara, Ayush Sekhari, Jason D. Lee, Nathan Kallus et al.NeurIPS 2022 · 48 citations
- Provably Efficient Neural Estimation of Structural Equation Models: An Adversarial ApproachLuofeng Liao, You-Lin Chen, Zhuoran Yang, Bo Dai et al.NeurIPS 2020 · 40 citations
- Causal Imitation Learning under Temporally Correlated NoiseGokul Swamy, Sanjiban Choudhury, Drew Bagnell, Steven WuICML 2022 · 36 citations
- A Minimax Learning Approach to Off-Policy Evaluation in Confounded Partially Observable Markov Decision ProcessesChengchun Shi, Masatoshi Uehara, Jiawei Huang, Nan JiangICML 2022 · 31 citations
Builds on1
Related papers
- Functional Generalized Empirical Likelihood Estimation for Conditional Moment RestrictionsHeiner Kremer, Jia-Jie Zhu, Krikamol Muandet, Bernhard SchölkopfICML 2022 · 9 citations
- Fast Instrument Learning with Faster RatesZiyu Wang, Yuhao Zhou, Jun ZhuNeurIPS 2022 · 6 citations
- Optimality and Adaptivity of Deep Neural Features for Instrumental Variable RegressionJuno Kim, Dimitri Meunier, Arthur Gretton, Taiji Suzuki et al.ICLR 2025
- Geometry-Aware Instrumental Variable RegressionHeiner Kremer, Bernhard SchölkopfICML 2024
- Estimation Beyond Data Reweighting: Kernel Method of MomentsHeiner Kremer, Yassine Nemmour, Bernhard Schölkopf, Jia-Jie ZhuICML 2023 · 7 citations
