The paper introduces DGOTTA, a framework for temporal memory‑aware online test‑time adaptation on dynamic graphs. DGOTTA comprises three modules: temporal‑aware augmentation to diversify test graphs, memory‑aware model prediction to mitigate catastrophic forgetting, and consistency‑guided online adaptation to enforce temporal alignment and smoothness. Experiments on three real‑world datasets and four DGNN backbones show that DGOTTA improves generalization under diverse distribution shifts and across multiple model architectures.
Generalizable dynamic graph anomaly detection (DGAD) enables pretrained detectors to identify anomalies in unseen target domains without costly retraining. However, existing methods often fail for two reasons.
arXiv:2608. 19858v1 Announce Type: new Abstract: Generalizable dynamic graph anomaly detection (DGAD) enables pretrained detectors to identify anomalies in unseen target domains without costly retraining.
arXiv:2606. 30011v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) deployed in real-world systems typically have fixed weights, often leading to degraded performance under distribution shifts.
Efficient Memory Crystallization (EMC) is a training‑free, test‑time framework that transforms each incoming graph domain into a compact, semantically faithful memory via a closed‑form distribution‑matching solution. By eliminating the need for auxiliary generative modules, EMC reduces redundant domain information and models inter‑domain dependencies through state‑evolving memories, yielding a tighter generalization error bound. Experiments show EMC outperforms state‑of‑the‑art baselines on non‑stationary graph data, cutting average runtime by 87.4% and GPU memory usage by 92.4% compared to a recent competitor.
This paper introduces TestDG, an online test-time domain generalization framework for continual test-time adaptation (CTTA). TestDG learns features invariant to both current and past test domains during testing, using a new model architecture, adaptation strategy, and prototype selection/update mechanisms. It achieves state‑of‑the‑art results on four CTTA benchmarks and demonstrates superior generalization to unseen test domains.
Deep neural nets achieve remarkable performance when training and test data share the same distribution, but this assumption frequently breaks in real-world deployment, where data undergoes continual distributional shifts. Continual Test-Time Adaptation (CTTA) addresses this challenge by adapting pretrained models to non-stationary target distributions on-the-fly, without access to source data or labeled targets, while mitigating two critical failure modes: catastrophic forgetting of source knowledge and error accumulation from noisy pseudo-labels over extended time horizons.
arXiv:2606. 31420v1 Announce Type: new Abstract: Test-Time Adaptation (TTA) enables models trained on a source domain to adapt online to unlabeled test data under distribution shifts.
The paper surveys Continual Test-Time Adaptation (CTTA), a framework that adapts pretrained computer‑vision models to non‑stationary target distributions without source data or labeled targets, while avoiding catastrophic forgetting and error accumulation. It formally defines the CTTA problem, categorizes existing methods into optimization‑based, parameter‑efficient, and architecture‑based families, and reviews representative techniques and benchmarks across standard evaluation settings. The survey also outlines current limitations and proposes future research directions, such as adapting foundation models and black‑box systems.
arXiv:2511. 18468v2 Announce Type: replace Abstract: Continual Test-Time Adaptation (CTTA) is crucial for deploying models in real-world applications with unseen, evolving target domains.
arXiv:2609.24111v1 Announce Type: new Abstract: Test-time adaptation (TTA) addresses distribution shift using only unlabeled test data. Existing methods typically adapt pretrained models by updating...
arXiv:2608. 13023v1 Announce Type: new Abstract: Relational Deep Learning (RDL) models multi-tabular databases as temporal heterogeneous graphs to enable end-to-end representation learning.
arXiv:2610.20238v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) excel on graph-structured data but suffer catastrophic forgetting when classes arrive sequentially. In class-incremental g...