Is Completeness Necessary? Estimation in Nonidentified Linear Models
49 Pages Posted: 13 Sep 2017 Last revised: 14 Jan 2025
Date Written: September 11, 2017
Abstract
Modern data analysis depends increasingly on estimating models via flexible high-dimensional or nonparametric machine learning methods, where the identification of structural parameters is often challenging and untestable. In linear settings, this identification hinges on the completeness condition, which requires the nonsingularity of a high-dimensional matrix or operator and may fail for finite samples or even at the population level. Regularized estimators provide a solution by enabling consistent estimation of structural or average structural functions, sometimes even under identification failure. We show that the asymptotic distribution in these cases can be nonstandard. We develop a comprehensive theory of regularized estimators, which include methods such as high-dimensional ridge regularization, gradient descent, and principal component analysis (PCA). The results are illustrated for high-dimensional and nonparametric instrumental variable regressions and are supported through simulation experiments.
Keywords: machine learning, high-dimensional regressions, ridge, gradient descent, pca, nonparametric IV, nonidentified models, weak identification
JEL Classification: C14, C26
Suggested Citation: Suggested Citation