Practical sketching algorithms for low-rank Tucker approximation of large tensors
From MaRDI portal
Publication:6101551
DOI10.1007/s10915-023-02172-yarXiv2301.11598OpenAlexW4361288103MaRDI QIDQ6101551
Liqun Qi, Wandi Dong, Gaohang Yu, Xiaohao Cai
Publication date: 20 June 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.11598
randomized algorithmhigh-dimensional dataTucker decompositiontensor sketchingsubspace power iteration
Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20)
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor-Train Decomposition
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
- Randomized algorithms for the low multilinear rank approximations of tensors
- A new scheme for the tensor representation
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Hierarchical Singular Value Decomposition of Tensors
- A Randomized Algorithm for Principal Component Analysis
- 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
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
This page was built for publication: Practical sketching algorithms for low-rank Tucker approximation of large tensors
