Back to Search
Start Over
An ATLD–ALS method for the trilinear decomposition of large third-order tensors.
- Source :
-
Soft Computing - A Fusion of Foundations, Methodologies & Applications . Sep2020, Vol. 24 Issue 18, p13535-13546. 12p. - Publication Year :
- 2020
-
Abstract
- CP decomposition of large third-order tensors can be computationally challenging. Parameters are typically estimated by means of the ALS procedure because it yields least-squares solutions and provides consistent outcomes. Nevertheless, ALS presents two major flaws which are particularly problematic for large-scale problems: slow convergence and sensitiveness to degeneracy conditions such as over-factoring, collinearity, bad initialization and local minima. More efficient algorithms have been proposed in the literature. They are, however, much less dependable than ALS in delivering stable results because the increased speed often comes at the expense of accuracy. In particular, the ATLD procedure is one of the fastest alternatives, but it is hardly employed because of the unreliable nature of its convergence. As a solution, multi-optimization is proposed. ATLD and ALS steps are concatenated in an integrated procedure with the purpose of increasing efficiency without a significant loss in precision. This methodology has been implemented and tested under realistic conditions on simulated data sets. [ABSTRACT FROM AUTHOR]
- Subjects :
- *DECOMPOSITION method
*SPEED
*MAXIMA & minima
Subjects
Details
- Language :
- English
- ISSN :
- 14327643
- Volume :
- 24
- Issue :
- 18
- Database :
- Academic Search Index
- Journal :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 145053946
- Full Text :
- https://doi.org/10.1007/s00500-019-04320-9