A Quadratically Convergent Proximal Algorithm For Nonnegative Tensor Decomposition. Vervliet, N., Themelis, A., Patrinos, P., & De Lathauwer, L. In 2020 28th European Signal Processing Conference (EUSIPCO), pages 1020-1024, Aug, 2020.
A Quadratically Convergent Proximal Algorithm For Nonnegative Tensor Decomposition [pdf]Paper  doi  abstract   bibtex   
The decomposition of tensors into simple rank-1 terms is key in a variety of applications in signal processing, data analysis and machine learning. While this canonical polyadic decomposition (CPD) is unique under mild conditions, including prior knowledge such as nonnegativity can facilitate interpretation of the components. Inspired by the effectiveness and efficiency of Gauss-Newton (GN) for unconstrained CPD, we derive a proximal, semismooth GN type algorithm for non-negative tensor factorization. Global convergence to local minima is achieved via backtracking on the forward-backward envelope function. If the algorithm converges to a global optimum, we show that Q-quadratic rates are obtained in the exact case. Such fast rates are verified experimentally, and we illustrate that using the GN step significantly reduces number of (expensive) gradient computations compared to proximal gradient descent.

Downloads: 0