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.
By Bo Li, Xin Zheng, Ming Jin, Can Wang, Shirui Pan
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...
By Muhammad Sudipto Siam Dip, Ali Etemad
The paper introduces query‑conditioned hypernetworks that predict distributions over LoRA weight updates for large language models. By learning a distribution rather than a single point estimate, the method allows sampling multiple adapted models for the same query, improving performance over deterministic hypernetworks and token‑sampling baselines. The study also shows that these learned updates can transfer across different queries, indicating reusable adaptation patterns.
By Azal Ahmad Khan, Keshav Ramji, Tahira Naseem, Ali Anwar, Ram\'on Fernandez Astudillo
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).
By Weishuo Ma, Yanbo Wang, Xiyuan Wang, Lei Zou, Muhan Zhang
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
By Dooho Lee, Jaemin Yoo
arXiv:2607. 05017v1 Announce Type: cross Abstract: The performance of deep learning models crucially depends on the settings of hyperparameters like learning rate, initialization scale, and weight decay.
By Gage DeZoort, Boris Hanin
arXiv:2608. 01672v1 Announce Type: cross Abstract: Effective long-context modeling is not merely about retaining more of the past, but about preserving the information that may prove relevant later.
By Zixuan Wang, Xingyu Dang, Rui-Jie Zhu, Zixin Wen, Hengyu Fu, Wenhao Chai, Jason D. Lee
Hypernetworks have recently shown success in dynamically adapting the parameters of Large Language Models (LLMs) at runtime based on signals such as task descriptions or additional demostrations. Here...
arXiv:2609.39673v1 Announce Type: new
Abstract: Can a pretrained graph model replace training and tuning a separate predictor for each dataset? Answering this requires evaluating prediction quality a...
By Jinmo Lee, Dooho Lee, Minho Jeong, Jaemin Yoo
arXiv:2607. 03900v1 Announce Type: cross Abstract: Test-time adaptation (TTA) has emerged as a popular paradigm for improving the performance of vision-language models (e.
By Siru Jiang, Jian Liang, Ran He, Tieniu Tan
arXiv:2311. 07461v3 Announce Type: replace Abstract: Autonomous systems (AS) often rely on Deep Neural Network (DNN) classifiers to operate in complex and dynamically changing environments.
By Abanoub Ghobrial, Kerstin Eder
arXiv:2505. 13087v2 Announce Type: replace-cross Abstract: We propose a novel benchmarking methodology for graph neural networks (GNNs) based on the graph alignment problem, a combinatorial optimization task that generalizes graph isomorphism by aligning two unlabeled graphs to maximize overlapping edges.
By Adrien Lagesse, Marc Lelarge