Inertial accelerated stochastic mirror descent for large-scale generalized tensor CP decomposition

Zehui Liu (), Qingsong Wang (), Chunfeng Cui () and Yong Xia ()
Additional contact information
Zehui Liu: Beihang University
Qingsong Wang: Xiangtan University
Chunfeng Cui: Beihang University
Yong Xia: Beihang University

Computational Optimization and Applications, 2025, vol. 91, issue 1, No 7, 233 pages

Abstract: Abstract The majority of classic tensor CP decomposition models are designed for squared loss, utilizing Euclidean distance as a local proximal term. However, the Euclidean distance is unsuitable for the generalized loss function applicable to diverse types of real-world data, such as integer and binary data. Consequently, algorithms developed under the squared loss are not easily adaptable to handle these generalized losses, partially due to the absence of the gradient Lipschitz continuity. This paper explores generalized tensor CP decomposition, employing the Bregman distance as the proximal term and introducing an inertial accelerated block randomized stochastic mirror descent algorithm (iTableSMD). Within a broader multi-block variance reduction and inertial acceleration framework, we demonstrate the sublinear convergence rate for the subsequential sequence produced by the iTableSMD algorithm. We further show that iTableSMD requires at most $$\mathcal {O}(\varepsilon ^{-2})$$ O ( ε - 2 ) iterations in expectation to attain an $$\varepsilon $$ ε -stationary point and establish the global convergence of the sequence. Numerical experiments on real datasets demonstrate that our proposed algorithm is efficient and achieves better performance than the existing state-of-the-art methods.

Keywords: Generalized tensor CP decomposition; Inertial acceleration; Stochastic mirror descent; Bregman divergence; Non-lipschitz gradient continuity; Variance reduction; 15A69; 90C26; 90C30 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00668-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:91:y:2025:i:1:d:10.1007_s10589-025-00668-x

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-025-00668-x

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().