Type: Article
Publication Date: 2021-08-05
Citations: 4
DOI: https://doi.org/10.1080/07474938.2021.1889195
In this article, we investigate seemingly unrelated regression (SUR) models that allow the number of equations (N) to be large and comparable to the number of the observations in each equation (T). It is well known that conventional SUR estimators, for example, the feasible generalized least squares estimator from Zellner (1962 Zellner, A. (1962). An efficient method of estimating seemingly unrelated regressions and tests for aggregation bias. Journal of the American Statistical Association 57(298):348–368. doi:10.1080/01621459.1962.10480664[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) does not perform well in a high-dimensional setting. We propose a new feasible GLS estimator called the feasible graphical lasso (FGLasso) estimator. For a feasible implementation of the GLS estimator, we use the graphical lasso estimation of the precision matrix (the inverse of the covariance matrix of the equation system errors) assuming that the underlying unknown precision matrix is sparse. We show that under certain conditions, FGLasso converges uniformly to GLS even when T < N, and it shares the same asymptotic distribution with the efficient GLS estimator when T>N log N. We confirm these results through finite sample Monte-Carlo simulations.
Action | Title | Year | Authors |
---|---|---|---|
+ | Seemingly unrelated penalized regression models | 2024 |
Adel Ghasemi Dariush Najarzadeh Mojtaba Khazaei |