Algorithm analysis demonstrates improved time efficiency and accuracy in constrained tensor optimization, indicating enhanced practical utility for multidimensional data processing.
Leveraging Tucker low-rank decomposition for dimensionality reduction and over-fitting mitigation, this study investigates stochastic tensor Tucker optimization problems subject to deterministic constraints, with an emphasis on designing a Stochastic Proximal Alternating Direction Method of Multipliers (SPADMM). Instead of treating the underlying polynomial structures as general smooth nonlinear functions, we introduce block conservative functions based on the tensor Tucker decomposition, and further analyse the convergence rate and high probability performance for the proposed stochastic algorithm. Both numerical tests and background/foreground separation experiments demonstrate that our approach is promising in time efficiency and solution accuracy.
No takes yet. Share an insight, caveat, or question.
Guo et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: