Search arXivSearch

arXiv · 2604.07131

When Is GMM Actually LATE? Weighting Matrices and Causal Interpretation in Overidentified IV

Abstract

Under heterogeneous treatment effects, the weighting matrix of overidentified IV-GMM selects the estimand, not just its precision. We characterize the selection exactly: for any parameter-free weighting-matrix map, the GMM estimand is a sum-to-one combination of instrument-specific Wald estimands, with closed-form weights and an exact non-negativity condition; efficient weighting adds a heterogeneity penalty. Continuously updated GMM exits this class through a variance-score remainder. Under positive regression dependence each Wald estimand is a convex combination of compliance-type LATEs, and under maintained validity a $J$-rejection indicates unequal Wald estimands rather than invalid instruments. We propose Representativeness Targeting (RT), which estimates a researcher-specified convex combination of the Wald estimands without imposing a common coefficient across moments; RT weights compliance types nonnegatively, attains the local asymptotic minimax bound for its target, and extends to unreachable policy targets via projection with identification-gap bounds. In Tennessee STAR, we find the $J$-test rejects the Wald-estimand equality while the heterogeneity penalty pulls the efficient-GMM estimate substantially below 2SLS; in a patent-leniency design, RT delivers a policy-relevant surrogate that standard GMM weightings miss.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chun Pang Chow, Hiroyuki Kasahara. 2026-09-09. When Is GMM Actually LATE? Weighting Matrices and Causal Interpretation in Overidentified IV. https://arxiv.org/abs/2604.07131

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Testing for Monotone Equilibrium Strategies in Games of Incomplete Information

This paper develops a unified framework for testing monotonicity of Bayesian Nash equilibrium strategies in unobserved types in games of incomplete information. We show that, under symmetric independent private types, monotonicity of differentiable equilibrium strategies is equivalent to monotonicity of a quasi-inverse strategy identified from observed actions. This allows the problem to be reformulated as testing a countable set of moment inequalities involving unconditional expectations. We propose a Cramer-von Mises-type statistic with bootstrap critical values. The method accommodates covariates and game heterogeneity. Monte Carlo simulations demonstrate finite-sample performance, and an application to procurement auctions illustrates cartel detection.

econ.EM

Ordinal Distributional Change and Conservative Transition Benchmarks: Measurement, Identification, and Inference

Repeated cross-sections reveal changes in ordinal distributions but not the transitions producing them. I axiomatically characterize a threshold-weighted probability metric for ordinal change from threshold-crossing principles. For any threshold-additive ordinal geometry, the discrepancy coincides with the Wasserstein--1 distance induced by that ground metric and measures minimum displacement; its optimizing plans define conservative transition benchmarks. With missing outcomes, I derive sharp identified sets for the discrepancy and endpoint-conditioned benchmark plans. I develop finite-sample-valid projection inference using randomized Monte Carlo calibration and global search with an almost-sure convergence guarantee. Applied to Arab Barometer data, the framework documents a robust shift toward broader and more regular remittance receipt in Lebanon. The discrepancy interval remains well separated from zero after allowing for item nonresponse and sampling uncertainty, while benchmark bounds provide strong numerical evidence that least-displacement restructuring excludes movement toward less frequent receipt and requires reassignment from nonreceipt to recurrent receipt.

econ.EM

A Stochastic Nested Fixed Point Algorithm for Large-Scale BLP Estimation

We develop a stochastic nested fixed point (SNFP) estimator for random coefficients logit demand models that updates model parameters using stochastic gradients and performs demand inversion one market at a time. Relative to the conventional nested fixed point (NFP) estimator, SNFP substantially reduces memory requirements and computational cost, making estimation feasible in very large datasets. We establish the large-$T$ (number of markets) asymptotic properties of the estimator under regularity conditions. We also characterize the effect of sharing one block of simulation draws across markets and show how to correct for it. Monte Carlo simulations show that the SNFP estimator achieves statistical accuracy comparable to the NFP estimator, and in our benchmark a single online pass estimates a model with 100 million markets in about 5.5 hours. An empirical application using scanner data further demonstrates the practical advantages of SNFP for large-scale demand estimation.

econ.EM