SFBS: a Forward-Backward Splitting algorithm for constrained tensor decomposition - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

SFBS: a Forward-Backward Splitting algorithm for constrained tensor decomposition

Résumé

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.
Fichier principal
Vignette du fichier
SFBS-hal.pdf (2.06 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02929348 , version 1 (03-09-2020)
hal-02929348 , version 2 (10-02-2023)

Identifiants

  • HAL Id : hal-02929348 , version 2

Citer

Elaheh Sobhani, Pierre Comon, Christian Jutten, Massoud Babaie-Zadeh. SFBS: a Forward-Backward Splitting algorithm for constrained tensor decomposition. 2023. ⟨hal-02929348v2⟩
559 Consultations
182 Téléchargements

Partager

Gmail Facebook X LinkedIn More