DOE OSTI · 1798617
Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization
Abstract
We develop the first distributed-memory parallel implementation of Symmetric Nonnegative Matrix Factorization (SymNMF), a key data analytics kernel for clustering and dimensionality reduction. Our implementation includes two different algorithms for SymNMF, which give comparable results in terms of time and accuracy. The first algorithm is a parallelization of an existing sequential approach that uses solvers for non symmetric NMF. The second algorithm is a novel approach based on the Gauss-Newton method. It exploits second-order information without incurring large computational and memory costs. We evaluate the scalability of our algorithms on the Summit system at Oak Ridge National Laboratory, scaling up to 128 nodes (4,096 cores) with 70% efficiency. Additionally, we demonstrate our software on an image segmentation task.
Keep this discovery
Explore connections, maps & timelines
Eswar, Srinivas, Hayashi, Koby, Ballard, Grey, Kannan, Ramakrishnan {ramki}, Vuduc, Richard, Park, Haesun. 2020-11-01. Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization. https://doi.org/10.1109/sc41405.2020.00078. https://engineeringpapers.com/record/osti%3A1798617/distributed-memory-parallel-symmetric-nonnegative-matrix-factorization
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.