Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering

Published: 01 Jan 2024, Last Modified: 16 Apr 2025J. Glob. Optim. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Nonnegative tensor factorizations (NTF) have applications in statistics, computer vision, exploratory multi-way data analysis, and blind source separation. This paper studies randomized multiplicative updating algorithms for symmetric NTF via random projections and random samplings. For random projections, we consider two methods to generate the random matrix and analyze the computational complexity, while for random samplings the uniform sampling strategy and its variants are examined. The mixing of these two strategies is then considered. Some theoretical results are presented based on the bounds of the singular values of sub-Gaussian matrices and the fact that randomly sampling rows from an orthogonal matrix results in a well-conditioned matrix. These algorithms are easy to implement, and their efficiency is verified via test tensors from both synthetic and real datasets, such as for clustering facial images.
Loading