Temporal graph training made faster by skipping redundant events
RAFT: Redundancy-Aware Input Filtering for Temporal Graph Neural Network Training
Machine LearningArtificial Intelligence
Summary
Graphs that change over time are tricky to teach computers to understand because every new event can affect how previous information is used. The authors found that not all these events are needed to learn well—some bring redundant information. They created a method called RAFT that watches how much information changes and skips the less useful events during training. This speeds up training by over half while keeping the accuracy about the same.
What this means in practice
- •For machine learning engineers: Reduce training time and resource use when building models that analyze evolving graphs by filtering out unhelpful historical events.
- •For network operations teams: Improve monitoring of communication or transaction networks by enabling faster temporal graph model updates using fewer events without losing accuracy.
Authors
Yue Dai, Sarah Zhou, Youtao Zhang
Abstract
Temporal graph neural networks (TGNNs) have shown strong performance on dynamic graph learning tasks by continuously updating node memories from evolving interactions (i.e., events) and leveraging these memories for downstream predictions. As graphs grow rapidly in modern applications, training requires processing an increasing number of events; meanwhile, each event can update node memories used by later events, creating dependencies that constrain parallel execution and limit the benefits of additional computing resources. These costs motivate an upstream question: Are all events, and the dependencies they introduce, necessary for learning? We investigate this question through two roles of temporal events: prediction targets and historical events sampled as inputs. We observe that targets involving stable node memories tend to exhibit lower prediction loss, while filtering historical events associated with stable memories can retain similar training-loss trajectories in several evaluated settings. Together, these observations suggest an opportunity to identify input redundancy through changes in node memories. Building on this opportunity, we propose RAFT, a redundancy-aware input-filtering framework for TGNN training. RAFT tracks memory changes during training and uses them to guide two filters: a root-event filter removes selected prediction targets before training, and a support-event filter excludes selected historical context during sampling. Filtering inputs before their downstream preparation and processing reduces the work they trigger. Across three TGNN models and five datasets, RAFT reduces training inputs by 35.23% on average and up to 97.11%, while reducing recorded training time by up to 52.56\% with negligible changes to model precisions.