Random Walk Guided Hyperbolic Graph Distillation
Yunbo Long, Liming Xu, Stefan Schoepf, and Alexandra Brintrup

TL;DR
HyDRO introduces a hyperbolic graph distillation method guided by random walks, effectively capturing complex geometric and dynamic properties of graphs, leading to improved task performance and robustness in graph learning tasks.
Contribution
The paper proposes HyDRO, a novel hyperbolic graph distillation approach that captures geometric and dynamic graph properties, outperforming existing Euclidean-based methods.
Findings
HyDRO outperforms state-of-the-art methods in node classification and link prediction.
HyDRO preserves graph random walk properties for better continual learning.
HyDRO achieves competitive results on graph distillation benchmarks with strong privacy-utility balance.
Abstract
Graph distillation (GD) is an effective approach to extract useful information from large-scale network structures. However, existing methods, which operate in Euclidean space to generate condensed graphs, struggle to capture the inherent tree-like geometry of real-world networks, resulting in distilled graphs with limited task-specific information for downstream tasks. Furthermore, these methods often fail to extract dynamic properties from graphs, which are crucial for understanding information flow and facilitating graph continual learning. This paper presents the Hyperbolic Graph Distillation with Random Walks Optimization (HyDRO), a novel graph distillation approach that leverages hyperbolic embeddings to capture complex geometric patterns and optimize the spectral gap in hyperbolic space. Experiments show that HyDRO demonstrates strong task generalization, consistently…
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.
Taxonomy
TopicsAlgorithms and Data Compression · Graph Theory and Algorithms · Quantum Computing Algorithms and Architecture
