paper-with-me

홈 › Papers

The Impact of Dimensionality on the Stability of Node Embeddings

2026-04-09 · Tobias Schumacher, Simon Reichelt, Markus Strohmaier arxiv

Previous work has shown that node embedding methods can produce different representations and downstream predictions across repeated training runs, even when trained on the same data with identical hyperparameters. However, the role of embedding dimensionality in this instability remains poorly understood. In this work, we systematically analyze how embedding dimensionality affects the stability of embeddings from five widely used node embedding methods: ASNE, DGI, GraphSAGE, node2vec, and VERSE. We evaluate stability from both representational and functional perspectives across a broad range of dimensions, datasets, and repeated training runs, and relate the resulting stability patterns to predictive performance. Our results show that dimensionality can substantially affect embedding stability, although the observed effects depend strongly on the embedding method and stability notion considered. While node2vec and ASNE generally became more stable at higher dimensions, GraphSAGE and VERSE often exhibited non-monotonic behavior or decreasing stability. We further find that dimensions associated with high stability do not necessarily coincide with those yielding the strongest downstream performance. Overall, our findings demonstrate that embedding dimensionality can have a substantial impact on the stability of node embeddings and downstream predictions.

📄 PDF Abstract BibTeX arXiv:2604.08492

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Local Intrinsic Dimensionality Measures for Graphs, with Applications to Graph Embeddings

2022-08-25 · Miloš Savić, Vladimir Kurbalija, Miloš Radovanović

The notion of local intrinsic dimensionality (LID) is an important advancement in data dimensionality analysis, with applications in data mining, machine learning and similarity search problems. Existing distance-based L…

Graph Embedding

Topology-Aware Graph Reinforcement Learning for Dynamic Routing in Cloud Networks

2025-09-05 · Yuxi Wang, Heyao Liu, Guanzi Yao, Nyutian Long 외 arxiv

This paper proposes a topology-aware graph reinforcement learning approach to address the routing policy optimization problem in cloud server environments. The method builds a unified framework for state representation a…

Reinforcement Learning

The Effects of Randomness on the Stability of Node Embeddings

2020-05-20 · Tobias Schumacher, Hinrikus Wolf, Martin Ritzert, Florian Lemmerich 외

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 embedd…

General ClassificationNode Classification

How Embeddings Shape Graph Neural Networks: Classical vs Quantum-Oriented Node Representations

2026-04-16 · Nouhaila Innan, Antonello Rosato, Alberto Marchisio, Muhammad Shafique arxiv

Node embeddings act as the information interface for graph neural networks, yet their empirical impact is often reported under mismatched backbones, splits, and training budgets. This paper provides a controlled benchmar…

Graph ClassificationGraph Learning

Understand Functionality and Dimensionality of Vector Embeddings: the Distributional Hypothesis, the Pairwise Inner Product Loss and Its Bias-Variance Trade-off

2018-03-01 · Zi Yin

Vector embedding is a foundational building block of many deep learning models, especially in natural language processing. In this paper, we present a theoretical framework for understanding the effect of dimensionality …