arXiv — cs.AI preprintsInternational16 October 2026
STAMP: Symmetric Temporal Averaging Message Passing for Domain Adaptation in Chronologically Split Graphs
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2411.10957v2 Announce Type: replace-cross Abstract: This paper addresses domain adaptation in graph-structured data under chronological splits. We consider transductive semi-supervised node classification (SSNC), in which labels of historical nodes are used to predict labels of more recent nodes. Temporal dependencies in graph connectivity induce distribution shifts across time, often degrading the performance of models trained on past nodes. Despite its practical relevance, domain adaptation under chronological graph splits remains relatively underexplored. We propose Symmetric Temporal
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- The World Won't Wait: Evaluating and Teaching Agents Under a Live Clock16 October 2026
- Evaluating Model Capabilities After Benchmark Saturation16 October 2026
- Value-Informed Schedule Trimming for Accelerated Sequential Monte Carlo Guidance in Discrete Diffusion16 October 2026
- AlphaDiana: A Measurement System for Agents in Verifiable Reasoning Tasks16 October 2026
- When Correctness Feedback Erases Evidence: Phase-Separated Completeness Auditing in Verus16 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.