TL;DR
This paper investigates what topological features are encoded in graph autoencoder embeddings, revealing that certain features are preserved in the first layer and can influence downstream task performance.
Contribution
It provides an extensive empirical analysis showing specific topological features are encoded in graph autoencoder embeddings and links these features to task performance.
Findings
Five topological features are preserved in the first layer of certain graph autoencoders.
A hierarchy exists in the distribution of topological features within embeddings.
Models preserving these features can outperform others on relevant downstream tasks.
Abstract
While representation learning has yielded a great success on many graph learning tasks, there is little understanding behind the structures that are being captured by these embeddings. For example, we wonder if the topological features, such as the Triangle Count, the Degree of the node and other centrality measures are concretely encoded in the embeddings. Furthermore, we ask if the presence of these structures in the embeddings is necessary for a better performance on the downstream tasks, such as clustering and classification. To address these questions, we conduct an extensive empirical study over three classes of unsupervised graph embedding models and seven different variants of Graph Autoencoders. Our results show that five topological features: the Degree, the Local Clustering Score, the Betweenness Centrality, the Eigenvector Centrality, and Triangle Count are concretely…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
