Fast Sparse Learning from Streaming Data with LASSO

In this paper, we propose Online LASSO - a version of LASSO that is configured for streaming data. In standard LASSO, the penalty parameter is typically chosen by cross-validation, a procedure which requires the entire dataset upfront and repeated fitting. The main contribution of this work is in finding an easy and principled choice for the penalty parameter for every incoming data point, in cases where the input features are uncorrelated. The proposed Online LASSO has several benefits: i) it is memory and time efficient ii) it is easy to implement, iii) it does not require an initial batch of data to start, iv) it does not require any tuning (e.g., step size or tolerance), and finally v) it converges to the performance of the optimal predictor and correct selection of features. We demonstrate these capabilities and compare Online LASSO with standard LASSO as well as other adaptive LASSO variations and provide a discussion on their performances.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10888851
Citations
2
Primary Topic
Data Stream Mining Techniques
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast Sparse Learning from Streaming Data with LASSO

Petar M. Djurić, Marija Iloska, Mónica F. Bugallo
2 citations
Data Stream Mining Techniques
4.96
article

Fast Sparse Learning from Streaming Data with LASSO

Petar M. Djurić, Marija Iloska, Mónica F. Bugallo
article en
2 citations

Abstract

In this paper, we propose Online LASSO - a version of LASSO that is configured for streaming data. In standard LASSO, the penalty parameter is typically chosen by cross-validation, a procedure which requires the entire dataset upfront and repeated fitting. The main contribution of this work is in finding an easy and principled choice for the penalty parameter for every incoming data point, in cases where the input features are uncorrelated. The proposed Online LASSO has several benefits: i) it is memory and time efficient ii) it is easy to implement, iii) it does not require an initial batch of data to start, iv) it does not require any tuning (e.g., step size or tolerance), and finally v) it converges to the performance of the optimal predictor and correct selection of features. We demonstrate these capabilities and compare Online LASSO with standard LASSO as well as other adaptive LASSO variations and provide a discussion on their performances.

Stony Brook University (US)
National Science Foundation
Openalex Percentile: Top 6%
Data Stream Mining Techniques
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.