PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs

Guoguo Ai, Chaoxi Niu, Hui Yan, Joey Tianyi Zhou, Yew-Soon Ong, Guansong Pang
Proceedings of the 43rd International Conference on Machine Learning, PMLR 306:1291-1310, 2026.

Abstract

Activities in numerous evolving systems can be represented as dynamic graphs in snapshot form at different time intervals, i.e., discrete-time dynamic graphs (DTDGs). Existing methods show impressive advances in capturing historical temporal evolution patterns in DTDGs, but they focus on addressing an offline learning setting, where models are trained using historical snapshots once and then evaluated to all subsequent graph snapshots without further updating. This fails to capture 1) the nature of evolving complexities across graph snapshots and 2) the distribution shift in the testing graph snapshots. To address these problems, we propose PromptDyG, a novel framework that leverages unsupervised test-time Prompt adaptation for Dynamic Graph learning under a live-update online setting. The key insight is that an expressive dynamic graph prompt can be learned on a frozen backbone via minimization of feature-wise, label-free entropy to efficiently and continuously model the evolving patterns. We show theoretically that this unsupervised prompt adaptation can guarantee a larger similarity margin between positive and negative pairs, facilitating more accurate dynamic predictions. It is further confirmed by our extensive empirical results on six benchmark datasets that show consistent and significant improvements of PromptDyG over state-of-the-art baselines. Code is available at https://github.com/mala-lab/PromptDyG.

Cite this Paper


BibTeX
@InProceedings{pmlr-v306-ai26c, title = {{P}rompt{D}y{G}: Test-Time Prompt Adaptation on Dynamic Graphs}, author = {Ai, Guoguo and Niu, Chaoxi and Yan, Hui and Zhou, Joey Tianyi and Ong, Yew-Soon and Pang, Guansong}, booktitle = {Proceedings of the 43rd International Conference on Machine Learning}, pages = {1291--1310}, year = {2026}, editor = {Zhang, Tong and Dudik, Miroslav and Jaggi, Martin and Agarwal, Alekh and Li, Sharon and Schuurmans, Dale and Zhu, Jerry and Berkenkamp, Felix and Dong, Hanze and Bietti, Alberto}, volume = {306}, series = {Proceedings of Machine Learning Research}, month = {06--11 Jul}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v306/main/assets/ai26c/ai26c.pdf}, url = {https://proceedings.mlr.press/v306/ai26c.html}, abstract = {Activities in numerous evolving systems can be represented as dynamic graphs in snapshot form at different time intervals, i.e., discrete-time dynamic graphs (DTDGs). Existing methods show impressive advances in capturing historical temporal evolution patterns in DTDGs, but they focus on addressing an offline learning setting, where models are trained using historical snapshots once and then evaluated to all subsequent graph snapshots without further updating. This fails to capture 1) the nature of evolving complexities across graph snapshots and 2) the distribution shift in the testing graph snapshots. To address these problems, we propose PromptDyG, a novel framework that leverages unsupervised test-time Prompt adaptation for Dynamic Graph learning under a live-update online setting. The key insight is that an expressive dynamic graph prompt can be learned on a frozen backbone via minimization of feature-wise, label-free entropy to efficiently and continuously model the evolving patterns. We show theoretically that this unsupervised prompt adaptation can guarantee a larger similarity margin between positive and negative pairs, facilitating more accurate dynamic predictions. It is further confirmed by our extensive empirical results on six benchmark datasets that show consistent and significant improvements of PromptDyG over state-of-the-art baselines. Code is available at https://github.com/mala-lab/PromptDyG.} }
Endnote
%0 Conference Paper %T PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs %A Guoguo Ai %A Chaoxi Niu %A Hui Yan %A Joey Tianyi Zhou %A Yew-Soon Ong %A Guansong Pang %B Proceedings of the 43rd International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2026 %E Tong Zhang %E Miroslav Dudik %E Martin Jaggi %E Alekh Agarwal %E Sharon Li %E Dale Schuurmans %E Jerry Zhu %E Felix Berkenkamp %E Hanze Dong %E Alberto Bietti %F pmlr-v306-ai26c %I PMLR %P 1291--1310 %U https://proceedings.mlr.press/v306/ai26c.html %V 306 %X Activities in numerous evolving systems can be represented as dynamic graphs in snapshot form at different time intervals, i.e., discrete-time dynamic graphs (DTDGs). Existing methods show impressive advances in capturing historical temporal evolution patterns in DTDGs, but they focus on addressing an offline learning setting, where models are trained using historical snapshots once and then evaluated to all subsequent graph snapshots without further updating. This fails to capture 1) the nature of evolving complexities across graph snapshots and 2) the distribution shift in the testing graph snapshots. To address these problems, we propose PromptDyG, a novel framework that leverages unsupervised test-time Prompt adaptation for Dynamic Graph learning under a live-update online setting. The key insight is that an expressive dynamic graph prompt can be learned on a frozen backbone via minimization of feature-wise, label-free entropy to efficiently and continuously model the evolving patterns. We show theoretically that this unsupervised prompt adaptation can guarantee a larger similarity margin between positive and negative pairs, facilitating more accurate dynamic predictions. It is further confirmed by our extensive empirical results on six benchmark datasets that show consistent and significant improvements of PromptDyG over state-of-the-art baselines. Code is available at https://github.com/mala-lab/PromptDyG.
APA
Ai, G., Niu, C., Yan, H., Zhou, J.T., Ong, Y. & Pang, G.. (2026). PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs. Proceedings of the 43rd International Conference on Machine Learning, in Proceedings of Machine Learning Research 306:1291-1310 Available from https://proceedings.mlr.press/v306/ai26c.html.

Related Material