资源论文On the Consistency of Feature Selection With Lasso for Non-linear Targets

On the Consistency of Feature Selection With Lasso for Non-linear Targets

2020-03-06 | |  63 |   34 |   0

Abstract

An important question in feature selection is whether a selection strategy recovers the “true” set of features, given enough data. We study this question in the context of the popular Least Absolute Shrinkage and Selection Operator (Lasso) feature selection strategy. In particular, we consider the scenario when the model is misspecified so that the learned model is linear while the underlying real target is nonlinear. Surprisingly, we prove that under certain conditions, Lasso is still able to recover the correct features in this case. We also carry out numerical studies to empirically verify the theoretical results and explore th necessity of the conditions under which the proof holds.

上一篇:Scalable Discrete Sampling as a Multi-Armed Bandit Problem

下一篇:Faster Eigenvector Computation via Shift-and-Invert Preconditioning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...