Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

sparse JL proof wrap up, Fast JL Transform, approximate nearest neighbor

sparse JL proof wrap-up, Fast JL Transform, approximate nearest neighbor

May 22, 20231 min read

sparse JL proof wrap-up, Fast JL Transform, approximate nearest neighbor

Prev: ors-theorem-distributional-jl-implies-gordons-theorem-sparse-jl Next: approximate-matrix-multiplication-with-frobenius-error-via-sampling—jl-matrix-median-trick-subspace-embeddings

Prev: ors-theorem-distributional-jl-implies-gordons-theorem-sparse-jl Next: approximate-matrix-multiplication-with-frobenius-error-via-sampling—jl-matrix-median-trick-subspace-embeddings


Graph View

Backlinks

  • approximate matrix multiplication with Frobenius error via sampling / JL, matrix median trick, subspace embeddings
  • ORS theorem (distributional JL implies Gordon's theorem), sparse JL

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap