Localized Lasso for High-Dimensional Regression

We introduce the localized Lasso, which learns models that both are interpretable and have a high predictive power in problems with high dimensionality d and small sample size n. More specifically, we consider a function defined by local sparse models, one at each data point. We introduce sample-wise network regularization to borrow strength across the models, and sample-wise exclusive group sparsity (a.k.a., l12 norm) to introduce diversity into the choice of feature sets in the local models. The local models are interpretable in terms of similarity of their sparsity patterns. The cost function is convex, and thus has a globally optimal solution. Moreover, we propose a simple yet efficient iterative least-squares based optimization procedure for the localized Lasso, which does not need a tuning parameter, and is guaranteed to converge to a globally optimal solution. The solution is empirically shown to outperform alternatives for both simulated and genomic personalized/precision medicine data.

Citation

Yamada, M, Koh, T, Iwata, T, Shawe-Taylor, J & Kaski, S 2017, Localized Lasso for High-Dimensional Regression . in A Singh & J Zhu (eds), Proceedings of the 20th International Conference on Artificial Intelligence and Statistics . Proceedings of Machine Learning Research, vol. 54, JMLR, Fort Lauderdale, FL, USA, pp. 325-333, International Conference on Artificial Intelligence and Statistics, Fort Lauderdale, United States, 20/04/2017 . < http://proceedings.mlr.press/v54/yamada17a.html >

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-201907304540

Collections

[article-cris] Perustieteiden korkeakoulu / SCI

Show all metadata

Localized Lasso for High-Dimensional Regression

Access rights

URL

Journal Title

Journal ISSN

Volume Title

Authors

Date

Department

Major/Subject

Mcode

Degree programme

Language

Pages

Series

Abstract

Description

Keywords

Other note

Citation

Permanent link to this item

Collections