Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

approximate matrix multiplication with Frobenius error via sampling / JL, matrix median trick, subspace embeddings

approximate matrix multiplication with Frobenius error via sampling / JL, matrix median trick, subspace embeddings

May 22, 20231 min read

approximate matrix multiplication with Frobenius error via sampling / JL, matrix median trick, subspace embeddings

Prev: sparse-jl-proof-wrap-up-fast-jl-transform-approximate-nearest-neighbor Next: linear-least-squares-via-subspace-embeddings-leverage-score-sampling-non-commutative-khintchine-oblivious-subspace-embeddings

Prev: sparse-jl-proof-wrap-up-fast-jl-transform-approximate-nearest-neighbor Next: linear-least-squares-via-subspace-embeddings-leverage-score-sampling-non-commutative-khintchine-oblivious-subspace-embeddings


Graph View

Backlinks

  • linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace embeddings
  • sparse JL proof wrap-up, Fast JL Transform, approximate nearest neighbor

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap