An efficient randomized algorithm for computing the approximate Tucker decomposition
From MaRDI portal
Publication:2049079
Cites work
- 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 randomized algorithm for a tensor-based generalization of the singular value decomposition
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- A randomized tensor singular value decomposition based on the t-product.
- Algorithm 862
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Handwritten digit classification using higher order singular value decomposition
- Hankel Matrix Nuclear Norm Regularized Tensor Completion for N-dimensional Exponential Signals
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Low-rank Tucker approximation of a tensor from streaming data
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Practical sketching algorithms for low-rank matrix approximation
- 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 algorithms for the low multilinear rank approximations of tensors
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Randomized LU decomposition using sparse projections
- Sketching as a tool for numerical linear algebra
- Smallest singular value of random matrices and geometry of random polytopes
- Tensor Decompositions and Applications
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- Theory and Computation of Complex Tensors and its Applications
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Universality laws for randomized dimension reduction, with applications
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
Cited in
(28)- Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Nonlinear transform induced tensor nuclear norm for tensor completion
- An efficient algorithm for computing the approximate t-URV and its applications
- A randomized singular value decomposition for third-order oriented tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Exact and approximation algorithms for computing optimal fat decompositions
- Randomized algorithms for the computation of multilinear rank-(_1,_2,_3) approximations
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- 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
- A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
- SVD-based algorithms for tensor wheel decomposition
- A stochastic perturbation analysis of the QR decomposition and its applications
- Optimization on the extended tensor-train manifold with shared factors
- Joint randomized algorithms for the federated low-multilinear-rank approximation of modified Tucker decomposition
- Accelerated alternating least squares for tensor wheel decomposition with applications
- An ADMM-based interior point method for solving nonnegative tensor least squares problems and its applications
- A robust tensor wheel decomposition-based regularization method for tensor completion problem
- 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
- Randomized Tucker-Sketched GMRES
- Block-randomized stochastic methods for tensor ring decomposition
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)
