Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
DOI10.1137/19M1261043zbMath1484.65091arXiv1905.07311OpenAlexW3008842210MaRDI QIDQ5027024
Misha E. Kilmer, Arvind K. Saibaba, Rachel Minster
Publication date: 3 February 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.07311
Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20) Numerical linear algebra (65F99) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (19)
Uses Software
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Randomized interpolative decomposition of separated representations
- The many proofs of an identity on the norm of oblique projections
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Probability essentials.
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
- A Randomized Blocked Algorithm for Efficiently Computing Rank-revealing Factorizations of Matrices
- A literature survey of low-rank tensor approximation techniques
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
- Tensor Spaces and Numerical Tensor Calculus
- Randomized Algorithms for Matrices and Data
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- A randomized tensor singular value decomposition based on the t‐product
- Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
- Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms
- A Practical Randomized CP Tensor Decomposition
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Subspace Iteration Randomization and Singular Value Problems
- On the Compression of Low Rank Matrices
- Tensor-CUR Decompositions for Tensor-Based Data
- Recompression of Hadamard Products of Tensors in Tucker Format
- RandNLA
This page was built for publication: Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format