The Effects of Randomness on the Stability of Node Embeddings

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Schumacher, Tobias, Wolf, Hinrikus, Ritzert, Martin, Lemmerich, Florian, Bachmann, Jan, Frantzen, Florian, Klabunde, Max, Grohe, Martin, Strohmaier, Markus
Format: Preprint
Published: 2020
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916642706948096
author Schumacher, Tobias
Wolf, Hinrikus
Ritzert, Martin
Lemmerich, Florian
Bachmann, Jan
Frantzen, Florian
Klabunde, Max
Grohe, Martin
Strohmaier, Markus
author_facet Schumacher, Tobias
Wolf, Hinrikus
Ritzert, Martin
Lemmerich, Florian
Bachmann, Jan
Frantzen, Florian
Klabunde, Max
Grohe, Martin
Strohmaier, Markus
contents We systematically evaluate the (in-)stability of state-of-the-art node embedding algorithms due to randomness, i.e., the random variation of their outcomes given identical algorithms and graphs. We apply five node embeddings algorithms---HOPE, LINE, node2vec, SDNE, and GraphSAGE---to synthetic and empirical graphs and assess their stability under randomness with respect to (i) the geometry of embedding spaces as well as (ii) their performance in downstream tasks. We find significant instabilities in the geometry of embedding spaces independent of the centrality of a node. In the evaluation of downstream tasks, we find that the accuracy of node classification seems to be unaffected by random seeding while the actual classification of nodes can vary significantly. This suggests that instability effects need to be taken into account when working with node embeddings. Our work is relevant for researchers and engineers interested in the effectiveness, reliability, and reproducibility of node embedding approaches.
format Preprint
id arxiv_https___arxiv_org_abs_2005_10039
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle The Effects of Randomness on the Stability of Node Embeddings
Schumacher, Tobias
Wolf, Hinrikus
Ritzert, Martin
Lemmerich, Florian
Bachmann, Jan
Frantzen, Florian
Klabunde, Max
Grohe, Martin
Strohmaier, Markus
Machine Learning
Social and Information Networks
We systematically evaluate the (in-)stability of state-of-the-art node embedding algorithms due to randomness, i.e., the random variation of their outcomes given identical algorithms and graphs. We apply five node embeddings algorithms---HOPE, LINE, node2vec, SDNE, and GraphSAGE---to synthetic and empirical graphs and assess their stability under randomness with respect to (i) the geometry of embedding spaces as well as (ii) their performance in downstream tasks. We find significant instabilities in the geometry of embedding spaces independent of the centrality of a node. In the evaluation of downstream tasks, we find that the accuracy of node classification seems to be unaffected by random seeding while the actual classification of nodes can vary significantly. This suggests that instability effects need to be taken into account when working with node embeddings. Our work is relevant for researchers and engineers interested in the effectiveness, reliability, and reproducibility of node embedding approaches.
title The Effects of Randomness on the Stability of Node Embeddings
topic Machine Learning
Social and Information Networks
url https://arxiv.org/abs/2005.10039