Accelerated doubly stochastic gradient descent for tensor CP decomposition
From MaRDI portal
Recommendations
- Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
- Stochastic gradients for large-scale tensor decomposition
- Nesterov acceleration of alternating least squares for canonical tensor decomposition: momentum step size selection and restart mechanisms.
- A primal-dual algorithm for nonnegative N-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis
- Accelerating variance-reduced stochastic gradient methods
Cites work
- A Practical Randomized CP Tensor Decomposition
- A Stochastic Approximation Method
- Accelerated optimization for machine learning. First-order algorithms. With forewords by Michael I. Jordan, Zongben Xu and Zhi-Quan Luo
- Adaptive subgradient methods for online learning and stochastic optimization
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- First-order and stochastic optimization methods for machine learning
- Generalized canonical polyadic tensor decomposition
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 7255141 (Why is no real title available?)
- scientific article; zbMATH DE number 7410754 (Why is no real title available?)
- Large-scale machine learning with stochastic gradient descent
- Lower bounds for non-convex stochastic optimization
- Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization
- Optimization methods for large-scale machine learning
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Some methods of speeding up the convergence of iteration methods
- Stochastic gradients for large-scale tensor decomposition
- Stochastic nested variance reduction for nonconvex optimization
- Tensor analysis. Spectral theory and special tensors
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Variational Analysis
Cited in
(6)- Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
- Stochastic gradients for large-scale tensor decomposition
- A block-randomized stochastic method with importance sampling for CP tensor decomposition
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks
- Group sparse-based tensor CP decomposition: model, algorithm, and applications in chemometrics
This page was built for publication: Accelerated doubly stochastic gradient descent for tensor CP decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161551)
