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

Documenti analoghi

• On Extended Concentration Inequalities for Fast JL Embeddings of Infinite Sets
  di: Boahen, Edem, et al.
  Pubblicazione: (2025)
• Approximating the Top Eigenvector in Random Order Streams
  di: Kacham, Praneeth, et al.
  Pubblicazione: (2024)
• A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
  di: Chen, Yanlin, et al.
  Pubblicazione: (2024)
• Sublinear Time Low-Rank Approximation of Hankel Matrices
  di: Kapralov, Michael, et al.
  Pubblicazione: (2025)
• Sublinear Time Low-Rank Approximation of Toeplitz Matrices
  di: Musco, Cameron, et al.
  Pubblicazione: (2024)