Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

linear least squares via subspace embeddings, leverage score sampling, non commutative Khintchine, oblivious subspace embeddings

linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace embeddings

May 22, 20231 min read

linear least squares via subspace embeddings, leverage score sampling, non-commutative Khintchine, oblivious subspace embeddings

Prev: approximate-matrix-multiplication-with-frobenius-error-via-sampling—jl-matrix-median-trick-subspace-embeddings Next: oblivious-subspace-embeddings-faster-iterative-regression-sketch-and-solve-regression

Prev: approximate-matrix-multiplication-with-frobenius-error-via-sampling—jl-matrix-median-trick-subspace-embeddings Next: oblivious-subspace-embeddings-faster-iterative-regression-sketch-and-solve-regression


Graph View

Backlinks

  • approximate matrix multiplication with Frobenius error via sampling / JL, matrix median trick, subspace embeddings
  • oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap