An efficient randomized algorithm for computing the approximate Tucker decomposition
From MaRDI portal
Publication:2049079
DOI10.1007/S10915-021-01545-5OpenAlexW3175303573MaRDI QIDQ2049079FDOQ2049079
Authors: Mao-Lin Che, Hong Yan, Yimin Wei 
Publication date: 24 August 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-021-01545-5
randomized algorithmsrandom projectionapproximate Tucker decompositiondimension reduction mapspower iteration techniquesubsampled randomized Fourier transformthin QR decomposition
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Randomized algorithms (68W20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Tensor Decompositions and Applications
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Low-Rank Approximation and Regression in Input Sparsity Time
- Algorithm 862
- 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
- Randomized Algorithms for Matrices and Data
- A literature survey of low-rank tensor approximation techniques
- 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
- A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
- Handwritten digit classification using higher order singular value decomposition
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- A fast randomized algorithm for the approximation of matrices
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A new truncation strategy for the higher-order singular value decomposition
- Theory and Computation of Complex Tensors and its Applications
- Sketching as a tool for numerical linear algebra
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Universality laws for randomized dimension reduction, with applications
- 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 randomized tensor singular value decomposition based on the t-product.
- Randomized LU decomposition using sparse projections
- Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals
- Practical sketching algorithms for low-rank matrix approximation
- Randomized algorithms for the low multilinear rank approximations of tensors
- 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
Cited In (18)
- An efficient algorithm for computing the approximate t-URV and its applications
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index
- SVD-based algorithms for fully-connected tensor network decomposition
- 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
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
- Exact and approximation algorithms for computing optimal fat decompositions
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
- A stochastic perturbation analysis of the QR decomposition and its applications
- SVD-based algorithms for tensor wheel decomposition
- Nonlinear transform induced tensor nuclear norm for tensor completion
- Randomized tensor wheel decomposition
Uses Software
This page was built for publication: An efficient randomized algorithm for computing the approximate Tucker decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049079)
