Globally Convergent Jacobi-Type Algorithms for Robust Approximate Diagonalization of Higher-Order Cumulant Tensors
Abstract
The sums of the absolute values of higher-order cumulants are classical contrast functions for independent component analysis (ICA) and lead naturally to robust approximate diagonalization of higher-order cumulant tensors using ℓ1-based diagonalization over the orthogonal or unitary group. We propose Jacobi-SubG, a Jacobi-type framework that selects index pairs using Riemannian subdifferential information and performs plane rotations with a refinement step that preserves nonzero diagonal contractions. For the general tensor model, we prove global convergence of the entire iterate sequence from any initialization with nonzero diagonal contractions, provided that the subproblem solvers satisfy a uniform sufficient-ascent estimate. For real and complex third- and fourth-order cumulant tensors, which are widely used in ICA, we develop specialized subproblem solvers satisfying these conditions. The resulting algorithms thus enjoy global convergence under the simple initialization condition that all diagonal contractions are nonzero. Numerical experiments on ICA and tensor diagonalization show that the proposed Jacobi-SubG variants achieve better source recovery and higher final objective values in several settings, particularly at the higher tested noise levels.
Related
- Globally Convergent Block Coordinate Descent Algorithms for Semi-Nonnegative Independent Component Analysis
- A globally convergent stochastic semismooth Newton method for strongly convex problems in Hilbert spaces
- A Globally Convergent Newton Method for Nonsmooth Optimization in the absence of Smooth Surrogates
- Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problems
- Deformed Convolution, Cumulant Transforms, and Semigroup Generators in Hurwitz Series Rings
BibTeX
@misc{li2026globally,
title = {{Globally Convergent Jacobi-Type Algorithms for Robust Approximate Diagonalization of Higher-Order Cumulant Tensors}},
author = {Jianze Li and Zhenyu Cai and Wentao Ding and Konstantin Usevich},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16649},
eprint = {2610.16649},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16649},
}
RIS
TY - UNPB
TI - Globally Convergent Jacobi-Type Algorithms for Robust Approximate Diagonalization of Higher-Order Cumulant Tensors
AU - Jianze Li
AU - Zhenyu Cai
AU - Wentao Ding
AU - Konstantin Usevich
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.16649
UR - https://arxiv.org/abs/2610.16649
AB - The sums of the absolute values of higher-order cumulants are classical contrast functions for independent component analysis (ICA) and lead naturally to robust approximate diagonalization of higher-order cumulant tensors using ℓ_1-based diagonalization over the orthogonal or unitary group. We propose Jacobi-SubG, a Jacobi-type framework that selects index pairs using Riemannian subdifferential information and performs plane rotations with a refinement step that preserves nonzero diagonal contractions. For the general tensor model, we prove global convergence of the entire iterate sequence from any initialization with nonzero diagonal contractions, provided that the subproblem solvers satisfy a uniform sufficient-ascent estimate. For real and complex third- and fourth-order cumulant tensors, which are widely used in ICA, we develop specialized subproblem solvers satisfying these conditions. The resulting algorithms thus enjoy global convergence under the simple initialization condition that all diagonal contractions are nonzero. Numerical experiments on ICA and tensor diagonalization show that the proposed Jacobi-SubG variants achieve better source recovery and higher final objective values in several settings, particularly at the higher tested noise levels.
ER -