The University of Southampton
University of Southampton Institutional Repository

A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix factorization

A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix factorization
A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a given nonnegative matrix M through the product of two nonnegative low-rank matrices W and H. Traditionally NMF is tackled by optimizing a specific objective function evaluating the quality of the approximation. This assessment is often done based on the Frobenius norm (F-norm). In this work, we argue that the F-norm, as the “point-to-point” distance, may not always be appropriate. Viewing from the perspective of cone, NMF may not naturally align with F-norm. So, a ray-to-ray chordal distance is proposed as an alternative way of measuring the quality of the approximation. As this measure corresponds to the Euclidean distance on the sphere, it motivates the use of manifold optimization techniques. We apply Riemannian optimization technique to solve chordal-NMF by casting it on a manifold. Unlike works on Riemannian optimization that require the manifold to be smooth, the nonnegativity in chordal-NMF defines a non-differentiable manifold. We propose a Riemannian Multiplicative Update (RMU), and showcase the effectiveness of the chordal-NMF on synthetic and real-world datasets.
Chordal distance, Manifold, Multiplicative Update, Nonconvex Optimization, Nonnegative Matrix Factorization, Riemannian gradient
0925-5001
Esposito, Flavia
8dc4f35b-400e-4260-82ae-4cd8fbe2e680
Ang, Andersen
ed509ecd-39a3-4887-a709-339fdaded867
Esposito, Flavia
8dc4f35b-400e-4260-82ae-4cd8fbe2e680
Ang, Andersen
ed509ecd-39a3-4887-a709-339fdaded867

Esposito, Flavia and Ang, Andersen (2025) A new Riemannian Multiplicative Updates for Chordal Nonnegative Matrix factorization. Journal of Global Optimization, 93 (1). (doi:10.1007/s10898-025-01548-8).

Record type: Article

Abstract

Nonnegative Matrix Factorization (NMF) is the problem of approximating a given nonnegative matrix M through the product of two nonnegative low-rank matrices W and H. Traditionally NMF is tackled by optimizing a specific objective function evaluating the quality of the approximation. This assessment is often done based on the Frobenius norm (F-norm). In this work, we argue that the F-norm, as the “point-to-point” distance, may not always be appropriate. Viewing from the perspective of cone, NMF may not naturally align with F-norm. So, a ray-to-ray chordal distance is proposed as an alternative way of measuring the quality of the approximation. As this measure corresponds to the Euclidean distance on the sphere, it motivates the use of manifold optimization techniques. We apply Riemannian optimization technique to solve chordal-NMF by casting it on a manifold. Unlike works on Riemannian optimization that require the manifold to be smooth, the nonnegativity in chordal-NMF defines a non-differentiable manifold. We propose a Riemannian Multiplicative Update (RMU), and showcase the effectiveness of the chordal-NMF on synthetic and real-world datasets.

Text
s10898-025-01548-8 - Version of Record
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 29 September 2025
e-pub ahead of print date: 11 October 2025
Additional Information: Publisher Copyright: © The Author(s) 2025.
Keywords: Chordal distance, Manifold, Multiplicative Update, Nonconvex Optimization, Nonnegative Matrix Factorization, Riemannian gradient

Identifiers

Local EPrints ID: 505915
URI: http://eprints.soton.ac.uk/id/eprint/505915
ISSN: 0925-5001
PURE UUID: b1e46f9b-c131-48d1-91ac-0f4bd2311a3b
ORCID for Andersen Ang: ORCID iD orcid.org/0000-0002-8330-758X

Catalogue record

Date deposited: 23 Oct 2025 16:35
Last modified: 24 Oct 2025 02:07

Export record

Altmetrics

Contributors

Author: Flavia Esposito
Author: Andersen Ang ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×