NeCPD: An Online Tensor Decomposition with Optimal Stochastic Gradient Descent
Ali Anaissi, Basem Suleiman, Seid Miad Zandavi

TL;DR
NeCPD introduces an efficient online tensor decomposition method using stochastic gradient descent with perturbation and Nesterov acceleration, improving convergence and accuracy in real-time multi-way data analysis.
Contribution
The paper presents a novel online CP decomposition algorithm that combines SGD, perturbation for saddle point escape, and Nesterov acceleration for faster convergence.
Findings
Outperforms existing online tensor analysis methods in accuracy.
Effectively escapes saddle points using perturbation approach.
Accelerates convergence with Nesterov's method.
Abstract
Multi-way data analysis has become an essential tool for capturing underlying structures in higher-order datasets stored in tensor . (CP) decomposition has been extensively studied and applied to approximate by loading matrices where represents the order of the tensor. We propose a new efficient CP decomposition solver named NeCPD for non-convex problem in multi-way online data based on stochastic gradient descent (SGD) algorithm. SGD is very useful in online setting since it allows us to update in one single step. In terms of global convergence, it is well known that SGD stuck in many saddle points when it deals with non-convex problems. We study the Hessian matrix to identify theses saddle points, and then try to escape them using the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Sparse and Compressive Sensing Techniques · Advanced Neuroimaging Techniques and Applications
MethodsStochastic Gradient Descent
