We propose a new fast randomized algorithm for interpolative decomposition of
matrices utilizing the CountSketch technique. We then extend our method to the
recently proposed tensor interpolative decomposition problem...
performance guarantees are provided for both the matrix and tensor settings. Numerical experiments on both synthetic and real sparse data demonstrate that
our algorithms maintain the accuracy of competing methods, while running in
less time, achieving at least an order of magnitude speed-up on large matrices