Loading [a11y]/accessibility-menu.js
Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization | IEEE Journals & Magazine | IEEE Xplore

Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization


Abstract:

Given a symmetric nonnegative matrix A, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix H, usually with much fewer colu...Show More

Abstract:

Given a symmetric nonnegative matrix A, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix H, usually with much fewer columns than A, such that A ≈ HHT. SymNMF can be used for data analysis and in particular for various clustering tasks. Unlike standard NMF, which is traditionally solved by a series of quadratic (convex) subproblems, we propose to solve symNMF by directly solving the nonconvex problem, namely, minimize ∥A - HHT2, which is a fourth-order nonconvex problem. In this paper, we propose simple and very efficient coordinate descent schemes, which solve a series of fourth-order univariate subproblems exactly. We also derive convergence guarantees for our methods and show that they perform favorably compared to recent state-of-the-art methods on synthetic and real-world datasets, especially on large and sparse input matrices.
Published in: IEEE Transactions on Signal Processing ( Volume: 64, Issue: 21, 01 November 2016)
Page(s): 5571 - 5584
Date of Publication: 14 July 2016

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.