Skip to content
Preprint

Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts

Aug 2026 · 2 citations · 35 references
Computer Science

TL;DR

CurvPrompt is proposed, a topology-routed geometry prompting framework for dynamic graphs that significantly advances few-shot link prediction while delivering strong, consistent performance on node classification tasks, validating the necessity of geometry-adaptive prompting.

Abstract

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.

View source

Similar papers

#machine learning Preprint Sep 2026

Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport

Graph prompt learning enables parameter-efficient adaptation of frozen Graph Neural Networks to downstream tasks through lightweight prompt parameters. As routing becomes increasingly node-adaptive, however, independently optimized local decisions can collectively concentrate assignment mass on a small subset of a fini...

Xiang-Yu Wang, Shuo Wang, Rui-Yi Fang et al. · 0 citations
Conference Open access Sep 2026

Dual-Topology Learning with Adaptive Anchors for Multi-View Clustering

The Dual-tOpology learning with adapTive Anchors (DOTA) is proposed, which not only learns the sample-anchor relationship but also preserves the topology structure among anchors, significantly enhancing the discriminability of learned representation while preserving the underlying data manifold.

Cheng-Long Zhang, Chao Zhang, Jun-Hao Zhang et al. · 0 citations
Open access 2026

D2GSL: Self-Supervised Dual-Layer Structure-Driven Graph Structure Learning

D2GSL constructs a semantic similarity channel and a spectral feature channel to model node relationships from both local semantic and global spectral views and introduces a hyperadjacency matrix that explicitly models inter-layer node correspondences and enables joint structural reconstruction across channels.

Jun-Chen Zhang, Xuhao Wei, Xiaolei Gu et al. · 0 citations
Conference 2026

Adpt-STGIN: An Adaptive Spatio-Temporal Graph Inductive Network for Topology-Robust Traffic Prediction in Data Center Networks

A deeply fused GraphSAGE-GRU cell that embeds independent inductive GraphSAGE(SAmple and aggreGatE) encoders directly into each GRU gate, enabling simultaneous spatio-temporal feature extraction at every time step while remaining topology-agnostic.

Xuran Chen · 0 citations
Sep 2026

Latent Diffusion With Topology-Preserving Conditioning for Structure-Aware Data Generation.

Experiments show that TopoSegDiff produces more realistic and structurally faithful image-mask pairs, reduces topology inconsistency, and consistently improves downstream segmentation performance when used for synthetic augmentation, which support topology-preserving conditioning as an effective route toward more relia...

Qin Lei, Ce-Ran Chen, Jiang Zhong et al. · 0 citations
Conference Sep 2026

Beyond Homophily: Spectrum-Based Graph Pre-Training and Cluster-Augmented Prompt Tuning

Graph pre-training and prompt tuning provide an effective route to label-efficient node classification by learning transferable backbones and adapting them with lightweight prompts. However, existing pre-train-and-prompt pipelines often generalize poorly across graphs with diverse homophily due to two fundamental limit...

Ting-Ting Li, Yong-Hao Li, Xiang-Kun Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.