Pith. sign in

RWR-GAE: Random Walk Regularization for Graph Auto Encoders

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Node embeddings have become an ubiquitous technique for representing graph data in a low dimensional space. Graph autoencoders, as one of the widely adapted deep models, have been proposed to learn graph embeddings in an unsupervised way by minimizing the reconstruction error for the graph data. However, its reconstruction loss ignores the distribution of the latent representation, and thus leading to inferior embeddings. To mitigate this problem, we propose a random walk based method to regularize the representations learnt by the encoder. We show that the proposed novel enhancement beats the existing state-of-the-art models by a large margin (upto 7.5\%) for node clustering task, and achieves state-of-the-art accuracy on the link prediction task for three standard datasets, cora, citeseer and pubmed. Code available at https://github.com/MysteryVaibhav/DW-GAE.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing cs.LG · 2025-07-27 · conditional · none · ref 38 · internal anchor

    AMLP is a simple unsupervised framework that makes a single MLP adaptive to graph aggregation through a neighbor-consistency loss and a reconstructed graph, and it reports strong clustering and classification performance.