ADMM-MM Algorithm for General Tensor Decomposition
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a new unified optimization algorithm for general tensor decomposition which is formulated as an inverse problem for low-rank tensors in the general linear observation models. The proposed algorithm supports three basic loss functions (ℓ2-loss, ℓ1-loss and KL divergence) and various low-rank tensor decomposition models (CP, Tucker, TT, and TR decompositions). We derive the optimization algorithm based on hierarchical combination of the alternating direction method of multiplier (ADMM) and majorization-minimization (MM). We show that wide-range applications can be solved by the proposed algorithm, and can be easily extended to any established tensor decomposition models in a plug-and-play manner.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 28 references that are in the map. First posted on arXiv 19 Dec 2023.
Builds on
5 of 28 references.
References · 5
- 2016Plug-and-Play ADMM for Image Restoration: Fixed Point Convergence and Applicationscited by 246
- 2016Tensor Ring Decompositioncited by 127
- 2015Smooth PARAFAC Decomposition for Tensor Completioncited by 34
- 2018Generalized Canonical Polyadic Tensor Decompositioncited by 34
- 2015A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorizationcited by 30
Built on by
Not cited yet.