The Variational Method of Moments
summary
Proposes the variational method of moments (VMM): a minimax formulation that replaces K test functions with a rich RKHS or neural-net class and an optimal-weighting penalty to recover identification, asymptotic normality and semiparametric efficiency for finite-dimensional θ; two-stage VMM yields consistent, asymptotically linear estimates and a minimax-on-minimax procedure that consistently estimates the asymptotic variance for valid confidence intervals. Implements kernel VMM and neural VMM (optimized with O-ADAM), shows lower MSE than spline/sieve IV in experiments and improving coverage with larger n.
AI-written summary · about
chapters (14)
- 0:00Intro
- 1:03Endogeneity
- 2:45IV Model
- 8:29Reduction to Marginal Moment Problem
- 12:28Sieve approaches
- 15:06Minimax approaches
- 19:11Variational Reformulation of OWGMM
- 21:38Variational Method of Moments
- 24:11VMM Variants
- 26:12Implementing VMM
- 33:09Semiparametric Efficiency
- 36:17Kernel VMM Inference
- 39:59Beyond efficiency
- 47:36Experiments
related talks
52mTensor Methods for Learning Latent Variable Models: Theory and Practice
44mMixture Models, Robustness, and Sum of Squares Proofs
01h 22mGeneralization IV
52mLearning Mixture of Gaussians using Moment Tensor
37mVariational Inference in Python
12mMaximal Robust Neural Network Specifications via Oracle-guided Numerical Optimi...
53mTensor Decompositions for Learning Latent Variable Models II
45mOrthogonal Statistical Learning
