Seminar, Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Streaming randomized techniques for low-rank approximation of tensors with applications
Abstract
Alberto Bucci develops single-pass randomized and streaming low-rank approximation, beginning with large matrices and the strengths and limitations of streaming algorithms. The discussion extends to Tucker, tensor-train, and tree tensor-network representations. Tensor-train approximations are then incorporated into Krylov solvers, including sketched GMRES, to reduce expensive intermediate contractions. The framework is presented as applicable beyond tensor trains to other tensor-network architectures.
Topics
- streaming algorithms, broader topic: algorithms
- large matrices, search World Wide
- tree tensor-network representations, broader topic: representations
- Krylov solvers, search World Wide
- sketched GMRES, search World Wide
- intermediate contractions, search World Wide
- tensor-network architectures, broader topic: network architectures