Randomized algorithms for the low multilinear rank approximations of tensors
From MaRDI portal
Publication:2226319
DOI10.1016/J.CAM.2020.113380zbMATH Open1462.65045arXiv1908.11031OpenAlexW3125352309WikidataQ114202020 ScholiaQ114202020MaRDI QIDQ2226319FDOQ2226319
Authors: Mao-Lin Che, Hong Yan, Yimin Wei 
Publication date: 12 February 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1908.11031
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
singular value decompositionrandomized algorithmssub-Gaussian matriceslow multilinear rank approximation
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Rang revealing QR factorizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- The maximal-volume concept in approximation by low-rank matrices
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor-CUR Decompositions for Tensor-Based Data
- Randomized Algorithms for Matrices and Data
- A literature survey of low-rank tensor approximation techniques
- Smallest singular value of a random rectangular matrix
- Smallest singular value of random matrices and geometry of random polytopes
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Cross approximation in tensor electron density computations
- A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
- A Practical Randomized CP Tensor Decomposition
- Handwritten digit classification using higher order singular value decomposition
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- A randomized algorithm for the decomposition of matrices
- A fast randomized algorithm for the approximation of matrices
- Smallest singular value of sparse random matrices
- Generalizing the column-row matrix decomposition to multi-way arrays
- Computing non-negative tensor factorizations
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Matrix approximation and projective clustering via volume sampling
- Randomized interpolative decomposition of separated representations
- A new truncation strategy for the higher-order singular value decomposition
- Theory and Computation of Complex Tensors and its Applications
- Computational Advertising: Techniques for Targeting Relevant Ads
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Krylov-type methods for tensor computations.I
- Randomized LU decomposition
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- A DEIM induced CUR factorization
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
Cited In (24)
- An efficient algorithm for computing the approximate t-URV and its applications
- SVD-based algorithms for fully-connected tensor network decomposition
- Title not available (Why is that?)
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- A randomized singular value decomposition for third-order oriented tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
- 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
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- A Practical Randomized CP Tensor Decomposition
- SVD-based algorithms for tensor wheel decomposition
- A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition
- Fast low rank approximations of matrices and tensors
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Random Projections for Low Multilinear Rank Tensors
- Practical sketching algorithms for low-rank Tucker approximation of large tensors
- Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors
- Randomized tensor wheel decomposition
Uses Software
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)
