GAttNHP Improves Event Forecasting in Temporal Knowledge Graphs
Summary
This paper introduces GAttNHP, a Group Attention Neural Hawkes Process, to address challenges in forecasting future events on Temporal Knowledge Graphs (TKGs). It tackles long-range dependencies, mutual excitation/inhibition, and sparse inter-arrival times using a self-attention encoder, semantic soft-grouping, and Non-Crossing Quantile regression.
Why it matters
Professionals working with dynamic, time-sensitive data can leverage GAttNHP to build more accurate predictive models for complex event sequences, enabling better strategic planning and anomaly detection.
How to implement this in your domain
- 1Evaluate existing temporal forecasting models for their ability to handle long-range dependencies and sparse data.
- 2Explore integrating Hawkes process models with attention mechanisms for event prediction in your domain.
- 3Consider adopting quantile regression for time prediction to better capture uncertainty and heavy-tailed distributions.
- 4Investigate how semantic grouping of event chains could improve the efficiency and accuracy of your TKG analysis.
Who benefits
Key takeaways
- Forecasting in Temporal Knowledge Graphs faces challenges with long dependencies and sparse data.
- GAttNHP uses self-attention, semantic grouping, and quantile regression for improved prediction.
- The framework captures long-range temporal dependencies and inter-chain interactions.
- GAttNHP significantly outperforms baselines on TKG datasets, especially for long-tail events.
Original post by Xiangni Tian, Kaixian Yu, Runpeng Dai, Niansheng Tang, Hongtu Zhu
"arXiv:2607.14733v1 Announce Type: new Abstract: Temporal Knowledge Graphs (TKGs) record how facts evolve over time, but forecasting future events on a TKG remains difficult for three reasons: (i) long-range temporal dependencies are hard to encode; (ii) events on different chains…"
View on XOriginally posted by Xiangni Tian, Kaixian Yu, Runpeng Dai, Niansheng Tang, Hongtu Zhu on X · view source
Want to go deeper?
Turn these trends into skills with Learnijoy's hands-on AI & tech courses.
Explore coursesMore in AI Research
Decentralized PAC Learning in Turn-Based Stochastic Games
This research presents the first positive results for decentralized and private information PAC learning in turn-based stochastic games with reachability objectives. It introduces a game-theoretic generalization of the Expected Conditional Distance parameter and establishes polynomial-sample complexity bounds.
New Loss Function Improves Peak Prediction in Time Series
This paper introduces Asymmetric Peak-Aware Loss (APAL), a model-agnostic objective function that significantly improves the prediction of rare demand spikes in time series forecasting. APAL penalizes under-predictions more heavily and increases the training weight of peak regions, outperforming symmetric objectives in peak-critical applications.
New Framework for Evaluating Epistemic Uncertainty in AI
This paper proposes evaluating epistemic uncertainty based on its ability to identify regret (reducible error), moving beyond traditional metrics like OOD detection and active learning. It proves that the optimal selective predictor is a thresholded convex combination of aleatoric and epistemic uncertainties.