A further improvement of a fast damped Gauss-Newton algorithm for candecomp-parafac tensor decomposition
Lists
Only you see this
Abstract
In this paper, a novel implementation of the damped Gauss-Newton algorithm (also known as Levenberg-Marquart) for the CANDECOMP-PARAFAC (CP) tensor decomposition is proposed. The method is based on a fast inversion of the approximate Hessian for the problem. It is shown that the inversion can be computed on O(NR <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">6</sup> ) operations, where N and R is the tensor order and rank, respectively. It is less than in the best existing state-of-the art algorithm with O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">6</sup> ) operations. The damped Gauss-Newton algorithm is suitable namely for difficult scenarios, where nearly-colinear factors appear in several modes simultaneously. Performance of the method is shown on decomposition of large tensors (100 × 100 × 100 and 100 × 100 × 100 × 100) of rank 5 to 90.
BibTeX
@inproceedings{tichavsky2013further,
author = {Petr Tichavský and Anh Huy Phan and Andrzej Cichocki},
title = {{A further improvement of a fast damped Gauss-Newton algorithm for candecomp-parafac tensor decomposition}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2013},
url = {https://openreview.net/forum?id=5vuClT3-3Cn},
}Loading related content...