Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

oblivious subspace embeddings, faster iterative regression, sketch and solve regression

oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression

May 22, 20231 min read

oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression

Prev: linear-least-squares-via-subspace-embeddings-leverage-score-sampling-non-commutative-khintchine-oblivious-subspace-embeddings Next: low-rank-approximation-column-based-matrix-reconstruction-k-means-compressed-sensing

Prev: linear-least-squares-via-subspace-embeddings-leverage-score-sampling-non-commutative-khintchine-oblivious-subspace-embeddings Next: low-rank-approximation-column-based-matrix-reconstruction-k-means-compressed-sensing


Graph View

Backlinks

  • linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace embeddings
  • low-rank approximation, column-based matrix reconstruction, k-means, compressed sensing

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap