Confidence Sets under Weak Identification: Theory and Practice
Gustavo Schlemper, Marcelo J. Moreira

TL;DR
This paper introduces new, reliable methods for constructing confidence sets in linear IV models that are valid under weak identification and various error structures, improving upon traditional grid search techniques.
Contribution
The authors develop exact and approximation-based confidence set construction methods exploiting polynomial structures, enhancing reliability and computational efficiency in weak IV settings.
Findings
Standard grid methods often produce incorrect confidence regions in weak instrument scenarios.
The proposed methods reliably recover confidence sets with correct nominal coverage.
Framework extends to models with piecewise polynomial or rational moment conditions.
Abstract
We develop new methods for constructing confidence sets and intervals in linear instrumental variables (IV) models based on tests that remain valid under weak identification and under heteroskedastic, autocorrelated, or clustered errors. In practice, researchers typically recover such sets by grid search, a procedure that can miss parts of the confidence region, truncate unbounded sets, and deliver misleading inference. We replace grid inversion with exact and approximation-based methods that are both reliable and computationally efficient. Our approach exploits the polynomial and rational structure of the Anderson-Rubin and Lagrange multiplier statistics to obtain exact confidence sets via polynomial root finding. For the conditional quasi-likelihood ratio test, we derive an exact inversion algorithm based on the geometry of the statistic and its critical value function. For more…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
