Randomized algorithms for the low multilinear rank approximations of tensors
From MaRDI portal
Publication:2226319
DOI10.1016/J.CAM.2020.113380zbMath1462.65045arXiv1908.11031OpenAlexW3125352309WikidataQ114202020 ScholiaQ114202020MaRDI QIDQ2226319
Mao-Lin Che, Hong Yan, Yi-Min Wei
Publication date: 12 February 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.11031
singular value decompositionrandomized algorithmssub-Gaussian matriceslow multilinear rank approximation
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (17)
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 computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations ⋮ Practical sketching algorithms for low-rank Tucker approximation of large tensors ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Provable stochastic algorithm for large-scale fully-connected tensor network decomposition ⋮ A randomized singular value decomposition for third-order oriented tensors ⋮ 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 ⋮ SVD-based algorithms for tensor wheel decomposition ⋮ 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 ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Rang revealing QR factorizations
- A randomized algorithm for the decomposition of matrices
- Randomized interpolative decomposition of separated representations
- Handwritten digit classification using higher order singular value decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A fast randomized algorithm for the approximation of matrices
- Generalizing the column-row matrix decomposition to multi-way arrays
- Randomized LU decomposition
- Krylov-type methods for tensor computations.I
- Smallest singular value of random matrices and geometry of random polytopes
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- A DEIM Induced CUR Factorization
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
- A literature survey of low-rank tensor approximation techniques
- Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Computational Advertising: Techniques for Targeting Relevant Ads
- Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
- Cross approximation in tensor electron density computations
- Randomized Algorithms for Matrices and Data
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
- Smallest singular value of a random rectangular matrix
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- A Practical Randomized CP Tensor Decomposition
- Smallest singular value of sparse random matrices
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- Theory and Computation of Complex Tensors and its Applications
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor-CUR Decompositions for Tensor-Based Data
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Computing non-negative tensor factorizations
This page was built for publication: Randomized algorithms for the low multilinear rank approximations of tensors
