SVD-based algorithms for fully-connected tensor network decomposition
DOI10.1007/S40314-024-02772-WMaRDI QIDQ6563146FDOQ6563146
Authors: Meng-yu Wang, Hanyu Li
Publication date: 27 June 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
alternating least squaresrandomized algorithmsketchingSVDfully-connected tensor network decomposition
Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Randomized algorithms (68W20) Approximation algorithms (68W25) Decomposition methods (49M27)
Cites Work
- Tensor Decompositions and Applications
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Tensor-train decomposition
- A Multilinear Singular Value Decomposition
- Randomized numerical linear algebra: Foundations and algorithms
- A fast randomized algorithm for the approximation of matrices
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
- Tensor Decomposition for Signal Processing and Machine Learning
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Subspace Iteration Randomization and Singular Value Problems
- On algorithms for and computing with the tensor ring decomposition
- The expression of a tensor or a polyadic as a sum of products.
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- 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
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Streaming Tensor Train Approximation
- Randomized Algorithms for Rounding in the Tensor-Train Format
- Fully-connected tensor network decomposition for robust tensor completion problem
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
This page was built for publication: SVD-based algorithms for fully-connected tensor network decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563146)