Simone Brugiapaglia

activity

20232025

most citedThe greedy side of the LASSO: New algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing cs.ITShow all

2 papers · 1 filter

cs.IT2025

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $M A M^{*}$ !

Edem Boahen, Simone Brugiapaglia, Hung-Hsu Chou +2

Motivated by applications such as sparse PCA, in this paper we present provably-accurate one-pass algorithms for the sparse approximation of the top eigenvectors of extremely massi…

cs.IT2023★ 2 cited

The greedy side of the LASSO: New algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit

Sina Mohammad-Taheri, Simone Brugiapaglia

We propose a class of greedy algorithms for weighted sparse recovery by considering new loss function-based generalizations of Orthogonal Matching Pursuit (OMP). Given a (regulariz…

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, MAM∗!

The greedy side of the LASSO: New algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $M A M^{*}$ !