2 papers
cs.IT2025
Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, !
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.DS2025
On Extended Concentration Inequalities for Fast JL Embeddings of Infinite Sets
Edem Boahen, March T. Boedihardjo, Rafael Chiclana +1
The Johnson-Lindenstrauss (JL) lemma allows subsets of a high-dimensional space to be embedded into a lower-dimensional space while approximately preserving all pairwise Euclidean…