SFBS: a Forward-Backward Splitting algorithm for constrained tensor decomposition
Preprint
Abstract
Tensors (multi-way arrays) and constrained tensor decomposition are very practical in various applications. The existing constrained decomposition algorithms, which are based on Alternating Direction Method of Multipliers (ADMM) or proximal methods, suffer either from a lack of complete convergence guarantee or from the lack of expected accuracy. In this paper, we propose a constrained decomposition algorithm, called SFBS, which stands for ``Simple Forward-Backward Splitting'' and is based on a particular proximal method to handle constraints. SFBS is theoretically and practically ahead compared to the state-of-the-art, since (i) not only SFBS achieves state-of-the-art performances, but also has a complete convergence guarantee, unlike ADMM-based algorithms; (ii) SFBS is much more robust against additive noise and computationally less expensive; (iii) unlike some existing algorithms, SFBS requires to adjust fewer hyperparameters, which are easy to set according to the convergence condition.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- CorrIndex: A permutation invariant performance indexSignal Processing, 2022
- Global Convergence of ADMM in Nonconvex Nonsmooth OptimizationJournal of Scientific Computing, 2018
- Fast nonnegative tensor factorization based on accelerated proximal gradient and low-rank approximationNeurocomputing, 2016
- Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysisIEEE Signal Processing Magazine, 2015
- Tensors : A brief introductionIEEE Signal Processing Magazine, 2014
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- A new efficient method for determining the number of components in PARAFAC modelsJournal of Chemometrics, 2003
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- The Expression of a Tensor or a Polyadic as a Sum of ProductsJournal of Mathematics and Physics, 1927