Title:
Adaptive learning in lasso models

Thumbnail Image
Author(s)
Patnaik, Kaushik
Authors
Advisor(s)
Song, Le
Advisor(s)
Person
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Series
Supplementary to
Abstract
Regression with L1-regularization, Lasso, is a popular algorithm for recovering the sparsity pattern (also known as model selection) in linear models from observations contaminated by noise. We examine a scenario where a fraction of the zero co-variates are highly correlated with non-zero co-variates making sparsity recovery difficult. We propose two methods that adaptively increment the regularization parameter to prune the Lasso solution set. We prove that the algorithms achieve consistent model selection with high probability while using fewer samples than traditional Lasso. The algorithm can be extended to a broad set of L1-regularized M-estimators for linear statistical models.
Sponsor
Date Issued
2015-08-20
Extent
Resource Type
Text
Resource Subtype
Thesis
Rights Statement
Rights URI