Το έργο με τίτλο An accelerated stochastic gradient for canonical polyadic decomposition από τον/τους δημιουργό/ούς Siaminou Ioanna, Liavas Athanasios διατίθεται με την άδεια Creative Commons Αναφορά Δημιουργού 4.0 Διεθνές
Βιβλιογραφική Αναφορά
I. Siaminou and A. P. Liavas, "An accelerated stochastic gradient for canonical polyadic decomposition," in 2021 29th European Signal Processing Conference (EUSIPCO), Dublin, Ireland, 2021, pp. 1785-1789, doi: 10.23919/EUSIPCO54536.2021.9616029.
https://doi.org/10.23919/EUSIPCO54536.2021.9616029
We consider the problem of structured canonical polyadic decomposition. If the size of the problem is very big, then stochastic gradient approaches are viable alternatives to classical methods, such as Alternating Optimization and All-At-Once optimization. We extend a recent stochastic gradient approach by employing an acceleration step (Nesterov momentum) in each iteration. We compare our approach with state-of-the-art alternatives, using both synthetic and real-world data, and find it to be very competitive.