![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/B9A717B4-52C9-4D92-B58A-5B5322129073 | - |
| Identifier | https://doi.org/10.26233/heallink.tuc.88551 | - |
| Language | en | - |
| Extent | 49 pages | el |
| Title | Stochastic optimization on tensor factorization and completion | en |
| Creator | Siaminou Ioanna | en |
| Creator | Σιαμινου Ιωαννα | el |
| Contributor [Thesis Supervisor] | Liavas Athanasios | en |
| Contributor [Thesis Supervisor] | Λιαβας Αθανασιος | el |
| Contributor [Committee Member] | Karystinos Georgios | en |
| Contributor [Committee Member] | Καρυστινος Γεωργιος | el |
| Contributor [Committee Member] | Samoladas Vasilis | en |
| Contributor [Committee Member] | Σαμολαδας Βασιλης | el |
| Publisher | Πολυτεχνείο Κρήτης | el |
| Publisher | Technical University of Crete | en |
| Academic Unit | Technical University of Crete::School of Electrical and Computer Engineering | en |
| Academic Unit | Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών | el |
| Content Summary | We consider the problem of structured canonical polyadic decomposition (CPD). If the size of the problem is very big, then stochastic optimization approaches are viable alternatives to classical methods, such as Alternating Optimization (AO) and All-At-Once (AAO) 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. Furthermore, we examine the drawbacks of a parallel implementation of our accelerated stochastic algorithm and describe an alternative method that deals with these limitations. Finally, we propose an accelerated stochastic algorithm for the Nonnegative Tensor Completion problem and its parallel implementation via the shared–memory API OpenMP. Through numerical experiments, we test its efficiency in very large problems. | en |
| Type of Item | Μεταπτυχιακή Διατριβή | el |
| Type of Item | Master Thesis | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2021-03-05 | - |
| Date of Publication | 2021 | - |
| Subject | Tensor factorization | en |
| Subject | Tensor completion | en |
| Subject | Stochastic optimization | en |
| Subject | Nesterov acceleration | en |
| Subject | OpenMP | en |
| Subject | Parallel algorithms | en |
| Bibliographic Citation | Ioanna Siaminou, "Stochastic optimization on tensor factorization and completion", Master Thesis, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2021 | en |
| Bibliographic Citation | Ιωάννα Σιάμινου, "Stochastic optimization on tensor factorization and completion", Μεταπτυχιακή Διατριβή, Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2021 | el |
Copyright © DIAS 2013
