Reposted by Josh Dickerson
Now on Arxiv: arxiv.org/abs/2608.10029 Led by grad student Matthew Giammar and collaborator Alex Strang, we provide a fast algorithm to calculate a low rank approximation to large (>100 million row) matrices with high fidelity that will accelerate template matching.
arxiv.org
A fast diagonalization algorithm to enable singular value decomposition of large matrices for efficient template matching
Many computational problems possess the following three features: (1) the problem could be solved efficiently if a linear operator could be diagonalized, (2) direct diagonalization is infeasible due t...