Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
From MaRDI portal
Recommendations
- Stochastic gradients for large-scale tensor decomposition
- A random sampling algorithm for fully-connected tensor network decomposition with applications
- SVD-based algorithms for fully-connected tensor network decomposition
- Faster tensor train decomposition for sparse data
- Parallel Algorithms for Computing the Tensor-Train Decomposition
Cites work
- A Practical Randomized CP Tensor Decomposition
- A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils
- A fast algorithm for deconvolution and Poisson noise removal
- A new TV-Stokes model for image deblurring and denoising with fast algorithms
- A randomized tensor singular value decomposition based on the t-product.
- Accelerated doubly stochastic gradient descent for tensor CP decomposition
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Blind Identification of Underdetermined Mixtures by Simultaneous Matrix Diagonalization
- Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain
- Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Efficient construction of tensor ring representations from sampling
- Exact Tensor Completion Using t-SVD
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- Orthogonal nonnegative Tucker decomposition
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized algorithms for the low multilinear rank approximations of tensors
- Rank properties and computational methods for orthogonal tensor decompositions
- Robust Multilinear Tensor Rank Estimation Using Higher Order Singular Value Decomposition and Information Criteria
- Robust low transformed multi-rank tensor methods for image alignment
- Smooth PARAFAC Decomposition for Tensor Completion
- Stochastic gradients for large-scale tensor decomposition
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor-train decomposition
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
Cited in
(3)
This page was built for publication: Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184280)
