Pith. sign in

REVIEW 1 cited by

SymNMF-Net for The Symmetric NMF Problem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.13214 v1 pith:JPWL3XOK submitted 2022-05-26 cs.LG cs.AI

classification cs.LGcs.AI
keywords symnmf-netlayernetworksymmetricsymnmfalgorithmsblockclustering
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, many works have demonstrated that Symmetric Non-negative Matrix Factorization~(SymNMF) enjoys a great superiority for various clustering tasks. Although the state-of-the-art algorithms for SymNMF perform well on synthetic data, they cannot consistently obtain satisfactory results with desirable properties and may fail on real-world tasks like clustering. Considering the flexibility and strong representation ability of the neural network, in this paper, we propose a neural network called SymNMF-Net for the Symmetric NMF problem to overcome the shortcomings of traditional optimization algorithms. Each block of SymNMF-Net is a differentiable architecture with an inversion layer, a linear layer and ReLU, which are inspired by a traditional update scheme for SymNMF. We show that the inference of each block corresponds to a single iteration of the optimization. Furthermore, we analyze the constraints of the inversion layer to ensure the output stability of the network to a certain extent. Empirical results on real-world datasets demonstrate the superiority of our SymNMF-Net and confirm the sufficiency of our theoretical analysis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Trace-reformulated SymNMF scales to n=10^6 on GPUs; five AdaGrad-family methods converge, with Block-SVRG AdaptGrow winning on flat TPDM spectra and full-batch AdaGrad on low-rank correlation spectra.

Pith tools