Moran’s I lasso for models with spatially correlated data
Sylvain Barde et al.
Abstract
Summary This paper proposes a lasso-based estimator which uses information embedded in the Moran statistic to develop a selection procedure called Moran’s I lasso (Mi-lasso) to solve the eigenvector spatial filtering (ESF) eigenvector selection problem. ESF uses a subset of eigenvectors from a spatial weights matrix to efficiently account for any omitted spatially correlated terms in a classical linear regression framework, thus eliminating the need for the researcher to exlicitly specify the spatially correlated parts of the model. We proposed the first ESF procedure accounting for post-selection inference. We derive performance bounds and show the necessary conditions for consistent eigenvector selection. The key advantages of the proposed estimator are that it is intuitive, theoretically grounded, able to provide robust inference, and substantially faster than lasso based on cross-validation or any proposed forward stepwise procedure. Our simulation results and an application on house prices demonstrate that Mi-lasso performs well compared with existing procedures in finite samples.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.