Joint Majorization-Minimization for Nonnegative CP and Tucker Decompositions under $β$-Divergences: Unfolding-Free Updates
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914379350409216 |
|---|---|
| author | Leplat, Valentin |
| author_facet | Leplat, Valentin |
| contents | We study majorization-minimization methods for nonnegative tensor decompositions under the $β$-divergence family, focusing on nonnegative CP and Tucker models. Our aim is to avoid explicit mode unfoldings and large auxiliary matrices by deriving separable surrogates whose multiplicative updates can be implemented using only tensor contractions (einsum-style operations). We present both classical block-MM updates in contraction-only form and a joint majorization strategy, inspired by joint MM for matrix $β$-NMF, that reuses cached reference quantities across inexpensive inner updates. We prove tightness of the proposed majorizers, establish monotonic decrease of the objective, and show convergence of the sequence of objective values. For block-MM, we discuss how BSUM theory applies to the analysis of stationary accumulation points. For J-CoMM, we further establish, under a set of standard regularity assumptions and for one inner sweep per outer iteration, convergence of the iterates to a critical point through a KL-based analysis. Finally, experiments on synthetic tensors and the Uber spatiotemporal count tensor demonstrate substantial speedups over unfolding-based baselines and competitive runtime relative to a recent einsum-factorization framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_14683 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Joint Majorization-Minimization for Nonnegative CP and Tucker Decompositions under $β$-Divergences: Unfolding-Free Updates Leplat, Valentin Optimization and Control Numerical Analysis We study majorization-minimization methods for nonnegative tensor decompositions under the $β$-divergence family, focusing on nonnegative CP and Tucker models. Our aim is to avoid explicit mode unfoldings and large auxiliary matrices by deriving separable surrogates whose multiplicative updates can be implemented using only tensor contractions (einsum-style operations). We present both classical block-MM updates in contraction-only form and a joint majorization strategy, inspired by joint MM for matrix $β$-NMF, that reuses cached reference quantities across inexpensive inner updates. We prove tightness of the proposed majorizers, establish monotonic decrease of the objective, and show convergence of the sequence of objective values. For block-MM, we discuss how BSUM theory applies to the analysis of stationary accumulation points. For J-CoMM, we further establish, under a set of standard regularity assumptions and for one inner sweep per outer iteration, convergence of the iterates to a critical point through a KL-based analysis. Finally, experiments on synthetic tensors and the Uber spatiotemporal count tensor demonstrate substantial speedups over unfolding-based baselines and competitive runtime relative to a recent einsum-factorization framework. |
| title | Joint Majorization-Minimization for Nonnegative CP and Tucker Decompositions under $β$-Divergences: Unfolding-Free Updates |
| topic | Optimization and Control Numerical Analysis |
| url | https://arxiv.org/abs/2602.14683 |