PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 18, 2025Frontiers in Applied Mathematics and Statistics2 citationsOpen Access

Plug-and-play low-rank tensor completion and reconstruction algorithms with improved applicability of tensor decompositions

View Full Paper
MMM. MukaiHHHidekata HontaniTYTatsuya Yokota

Key Points

  • The algorithm effectively solves various tensor completion and reconstruction problems.
  • It supports multiple loss functions like ℓ2 loss, ℓ1 loss, and generalized KL divergence.
  • The optimization technique combines alternating direction method of multipliers and majorization-minimization.
  • This plug-and-play framework enhances feasibility for established tensor decomposition models.

Abstract

In this paper, we propose a new unified optimization algorithm for general tensor completion and reconstruction problems, which is formulated as an inverse problem for low-rank tensors in general linear observation models. The proposed algorithm supports at least three basic loss functions (ℓ 2 loss, ℓ 1 loss, and generalized KL divergence) and various TD models (CP, Tucker, TT, TR decompositions, non-negative matrix/tensor factorizations, and other constrained TD models). We derive the optimization algorithm based on a hierarchical combination of the alternating direction method of multipliers (ADMM) and majorization-minimization (MM). We show that the proposed algorithm can solve a wide range of applications and can be easily extended to any established TD model in a plug-and-play manner.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Mukai et al. (2025) studied this question.

synapsesocial.com/papers/68d462db31b076d99fa62826https://doi.org/10.3389/fams.2025.1594873
Ask AI
Helpful
Bookmark
Share
View Full Paper