MECOMLSep 23, 2021

High-dimensional regression with potential prior information on variable importance

arXiv:2109.11281v2
AI Analysis

This work addresses high-dimensional regression for statisticians and data scientists by providing a computationally efficient way to leverage prior information, though it is incremental as it builds on existing ridge and Lasso methods.

The paper tackles the problem of incorporating vague prior information on variable importance in high-dimensional regression, proposing a method that fits a sequence of models based on an ordering and selects the best via cross-validation, with results showing only a logarithmic penalty compared to the unknown best estimator.

There are a variety of settings where vague prior information may be available on the importance of predictors in high-dimensional regression settings. Examples include ordering on the variables offered by their empirical variances (which is typically discarded through standardisation), the lag of predictors when fitting autoregressive models in time series settings, or the level of missingness of the variables. Whilst such orderings may not match the true importance of variables, we argue that there is little to be lost, and potentially much to be gained, by using them. We propose a simple scheme involving fitting a sequence of models indicated by the ordering. We show that the computational cost for fitting all models when ridge regression is used is no more than for a single fit of ridge regression, and describe a strategy for Lasso regression that makes use of previous fits to greatly speed up fitting the entire sequence of models. We propose to select a final estimator by cross-validation and provide a general result on the quality of the best performing estimator on a test set selected from among a number $M$ of competing estimators in a high-dimensional linear regression setting. Our result requires no sparsity assumptions and shows that only a $\log M$ price is incurred compared to the unknown best estimator. We demonstrate the effectiveness of our approach when applied to missing or corrupted data, and time series settings. An R package is available on github.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes