Title: LoRE: Robust and Adaptive Graph Embeddings via Local Self-Reconstruction Mechanisms
Primary area: learning on graphs and other geometries & topologies
Keywords: Graph Learning, Graph Embeddings, Graph Neural Networks, Knowledge Graphs, Self-Supervised Learning

Abstract: Graph embeddings aim to project nodes into numeric vector spaces while preserving structural and semantic properties for downstream tasks such as community detection, node classification, and link prediction. However, existing embedding methods distort local geometry through negative sampling, fail to enforce semantic consistency, and require expensive retraining when graphs evolve. Therefore, we introduce LoRE, a versatile graph embedding framework based on attention-driven self-reconstruction mechanisms and a perspective-preserving training procedure. Built on a generalized formulation, LoRE can be applied to a wide range of graph types, from undirected graphs to relational knowledge graphs and even attributed node sets without inherent topologies. It enforces identical embeddings for structurally equivalent nodes, respects local context during training, and reduces the likelihood of violations of the open-world assumption. Unlike traditional methods, LoRE supports efficient on-the-fly adaptation: embeddings can be updated in real time as graphs change, without full retraining. Its reconstruction mechanism acts as a self-supervised training signal that improves embedding robustness, yielding superior performance compared to existing approaches. Extensive experiments demonstrate that LoRE consistently matches or outperforms baseline results while maintaining stability under dynamic conditions. Qualitative analyses further show that LoRE produces more separable and compact clusters in embedding spaces. Together, these results underscore its enhanced generalizability and practical value in real-world graph embedding applications.

TL;DR: This work presents LoRE, a generalized graph embedding framework that uses attention-driven self-reconstruction to improve robustness, preserve local semantics during training, and adapt efficiently to evolving graphs without costly retraining.