Randomized algorithms for the low multilinear rank approximations of tensors
From MaRDI portal
Publication:2226319
Abstract: In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular values of sub-Gaussian matrices, we make a probabilistic analysis for the error bounds for the randomized algorithm. We demonstrate the effectiveness of proposed algorithms via several numerical examples.
Recommendations
- Random Projections for Low Multilinear Rank Tensors
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- A randomized tensor singular value decomposition based on the t-product.
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
Cites work
- A DEIM induced CUR factorization
- A fast randomized algorithm for the approximation of matrices
- A literature survey of low-rank tensor approximation techniques
- A Multilinear Singular Value Decomposition
- A new truncation strategy for the higher-order singular value decomposition
- A Newton-Grassmann method for computing the best multilinear rank-(r₁,r₂,r₃) approximation of a tensor
- A Practical Randomized CP Tensor Decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A randomized algorithm for the decomposition of matrices
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Computing non-negative tensor factorizations
- Cross approximation in tensor electron density computations
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalizing the column-row matrix decomposition to multi-way arrays
- Handwritten digit classification using higher order singular value decomposition
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Krylov-type methods for tensor computations.I
- Low-rank Tucker approximation of a tensor from streaming data
- Matrix approximation and projective clustering via volume sampling
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized Algorithms for Matrices and Data
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Randomized interpolative decomposition of separated representations
- Randomized LU decomposition
- Rang revealing QR factorizations
- Sketching as a tool for numerical linear algebra
- Smallest singular value of a random rectangular matrix
- Smallest singular value of random matrices and geometry of random polytopes
- Smallest singular value of sparse random matrices
- Tensor Decompositions and Applications
- Tensor-CUR Decompositions for Tensor-Based Data
- The maximal-volume concept in approximation by low-rank matrices
- Theory and Computation of Complex Tensors and its Applications
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
Cited in
(39)- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors
- On approximation algorithm for orthogonal low-rank tensor approximation
- A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition
- An efficient algorithm for computing the approximate t-URV and its applications
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- A randomized singular value decomposition for third-order oriented tensors
- Random Projections for Low Multilinear Rank Tensors
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Fast low rank approximations of matrices and tensors
- A randomized tensor singular value decomposition based on the t-product.
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- A Practical Randomized CP Tensor Decomposition
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Randomized algorithms for the computation of multilinear rank-(_1,_2,_3) approximations
- An efficient randomized fixed-precision algorithm for tensor singular value decomposition
- Practical sketching algorithms for low-rank Tucker approximation of large tensors
- Randomized algorithm on tensor singular value decomposition for image and video reconstructions
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Randomized tensor wheel decomposition
- SVD-based algorithms for fully-connected tensor network decomposition
- An L-DEIM induced high order tensor interpolatory decomposition
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
- Two-sided randomized algorithms for approximate \(K\)-term t-SVD
- A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
- SVD-based algorithms for tensor wheel decomposition
- Joint randomized algorithms for the federated low-multilinear-rank approximation of modified Tucker decomposition
- Efficient randomized algorithms for computing an approximation of the tensor train decomposition
- Accelerated alternating least squares for tensor wheel decomposition with applications
- Efficient algorithms for Tucker decomposition via approximate matrix multiplication
- Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
- Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
This page was built for publication: Randomized algorithms for the low multilinear rank approximations of tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226319)
