SVD-based algorithms for fully-connected tensor network decomposition
From MaRDI portal
Publication:6563146
Recommendations
- A random sampling algorithm for fully-connected tensor network decomposition with applications
- SVD-based algorithms for tensor wheel decomposition
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Fully-connected tensor network decomposition for robust tensor completion problem
- Tensor completion via fully-connected tensor network decomposition with regularized factors
Cites work
- A Multilinear Singular Value Decomposition
- A fast randomized algorithm for the approximation of matrices
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Fully-connected tensor network decomposition for robust tensor completion problem
- Low-rank Tucker approximation of a tensor from streaming data
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- On algorithms for and computing with the tensor ring decomposition
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized Algorithms for Rounding in the Tensor-Train Format
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Randomized algorithms for the low multilinear rank approximations of tensors
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Randomized numerical linear algebra: Foundations and algorithms
- Streaming Tensor Train Approximation
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Subspace Iteration Randomization and Singular Value Problems
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor-train decomposition
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The expression of a tensor or a polyadic as a sum of products.
Cited in
(3)
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)
