URI | http://purl.tuc.gr/dl/dias/4163C723-F3A5-4838-BEAF-2A8104F02EB3 | - |
Αναγνωριστικό | https://doi.org/10.23919/EUSIPCO54536.2021.9616029 | - |
Αναγνωριστικό | https://ieeexplore.ieee.org/document/9616029 | - |
Γλώσσα | en | - |
Μέγεθος | 5 pages | en |
Τίτλος | An accelerated stochastic gradient for canonical polyadic decomposition | en |
Δημιουργός | Siaminou Ioanna | en |
Δημιουργός | Σιαμινου Ιωαννα | el |
Δημιουργός | Liavas Athanasios | en |
Δημιουργός | Λιαβας Αθανασιος | el |
Εκδότης | Institute of Electrical and Electronics Engineers | en |
Περίληψη | 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. | en |
Τύπος | Δημοσίευση σε Συνέδριο | el |
Τύπος | Conference Publication | en |
Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
Ημερομηνία | 2023-05-26 | - |
Ημερομηνία Δημοσίευσης | 2021 | - |
Θεματική Κατηγορία | Tensor factorization | en |
Θεματική Κατηγορία | Stochastic optimization | en |
Θεματική Κατηγορία | CPD/PARAFAC | en |
Θεματική Κατηγορία | Nesterov acceleration | en |
Βιβλιογραφική Αναφορά | 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. | en |