← Search

Chaoxi Niu

4 accepted papers

2026

PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs

ICML 2026poster

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 …

Cited by 0SourceScholar
2025

Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Prompts

IJCAI 2025

Graph anomaly detection (GAD), which aims to identify nodes in a graph that significantly deviate from normal patterns, plays a crucial role in broad application domains. However, existing GAD methods are one-model-for-one-dataset approaches, i.e., training a separate model for each graph dataset. T

2024

Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach

NeurIPS 2024poster

Class-incremental learning (CIL) aims to continually learn a sequence of tasks, with each task consisting of a set of unique classes. Graph CIL (GCIL) follows the same setting but needs to deal with graph tasks (e.g., node classification in a graph). The key characteristic of CIL lies in the absence…