Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts
Not on the map. Why?
Abstract (arXiv)
Dynamic graph prompting freezes a pre-trained temporal backbone and adapts it to label-scarce downstream tasks using lightweight prompts. However, existing methods operate within a single, fixed embedding space. In this work, we reveal that temporal shifts in local clustering and degree heterogeneity actively reorganize the edge curvature spectrum---indicating that the optimal representation geometry dynamically evolves with local topology over time. We formalize this unaddressed mismatch as geometry under-adaptation. To overcome this limitation, we propose CurvPrompt, a topology-routed geometry prompting framework for dynamic graphs. Instead of relying on a single space, CurvPrompt maintains a bank of curvature-diverse Riemannian experts, each paired with a learnable prompt. A topology-aware gate dynamically routes each node--time instance to a sparse subset of experts, constructing a personalized mixed-curvature representation. To ensure parameter efficiency and training stability under extreme label scarcity, CurvPrompt employs soft routing during pre-training to build a continuous topology--geometry mapping, and transitions to hard Top-K routing with uniform weights during downstream adaptation. Extensive experiments across four benchmark datasets show that CurvPrompt significantly advances few-shot link prediction while delivering strong, consistent performance on node classification tasks, validating the necessity of geometry-adaptive prompting.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 26 of its 35 references that are in the map. First posted on arXiv 6 Aug 2026.
Builds on
26 of 35 references.
References · 26
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 684
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 193
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 157
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 143
- 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 138
- 2022ROLAND: Graph Learning Framework for Dynamic Graphscited by 132
- 2020Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A surveycited by 124
- 2025SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptationcited by 62
14 more
- 2021A Survey on Embedding Dynamic Graphscited by 60
- 2023Virtual Node Tuning for Few-shot Node Classificationcited by 46
- 2023HGPROMPT: Bridging Homogeneous and Heterogeneous Graphs for Few-shot Prompt Learningcited by 45
- 2024Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Modelscited by 42
- 2023Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphscited by 39
- 2024Non-Homophilic Graph Pre-Training and Prompt Learningcited by 31
- 2022A Self-supervised Riemannian GNN with Time Varying Curvature for Temporal Graph Learningcited by 24
- 2024GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Expertscited by 24
- 2024Prompt Learning on Temporal Interaction Graphscited by 13
- 2024Node-Time Conditional Prompt Learning In Dynamic Graphscited by 11
- 2025GCoT: Chain-of-Thought Prompt Learning for Graphscited by 9
- 2026The Post-GCN Decade Revisited: Curvature-Stratified Evaluation of Relational Learningcited by 3
- 2025GMoPE:A Prompt-Expert Mixture Framework for Graph Foundation Modelscited by 2
- 2026Data-centric Prompt Tuning for Dynamic Graphscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.