Skip to content

Adaptive Modality Routing for Temporal Knowledge Graph Forecasting with Heterogeneous Mixture-of-Experts

Oct 2026 · Technologies · Vol 14, pp. 633 · 0 citations
Advanced Graph Neural Networks

TL;DR

Experiments indicate that the proposed H-MoE framework can improve forecasting performance under the evaluation setting and support heterogeneous expert specialization as a useful design direction, while the scope of the conclusions remains limited to the tested ICEWS benchmarks and implementation.

Abstract

Temporal knowledge graph forecasting aims to predict future missing facts from continuously evolving relational data in dynamic information systems. Such forecasting tasks are increasingly important for intelligent applications involving complex interactions among entities, events, and evolving environments. Existing approaches typically employ unified architectures that process all queries through the same representation pipeline, despite substantial variations in structural connectivity, historical availability, and semantic information among different queries. Such a homogeneous modeling strategy may limit the ability to effectively handle diverse forecasting scenarios, including highly connected entities, recurrent temporal patterns, and cold-start cases with insufficient historical evidence. To address this challenge, we propose a Heterogeneous Modality Mixture-of-Experts (H-MoE) framework that adaptively selects specialized reasoning pathways according to query characteristics. Unlike conventional mixture-of-experts architectures with homogeneous subnetworks, our framework incorporates three complementary experts with distinct inductive biases: a time-aware graph neural network for structural relational reasoning, a temporal transformer for historical sequence modeling, and a semantic representation adapter based on pretrained language models for knowledge transfer in sparse scenarios. A query-aware gating network is introduced to dynamically allocate computational resources among different experts according to the available structural, temporal, and semantic evidence. Furthermore, we employ entropy-based routing regularization to encourage confident expert selection while maintaining balanced expert utilization, together with a representation diversity constraint to promote complementary feature learning among heterogeneous reasoning pathways. Experiments on three benchmark temporal knowledge graph datasets indicate that the proposed framework can improve forecasting performance under the evaluation setting used in this study. The largest observed gains occur for queries with limited historical evidence. These findings support heterogeneous expert specialization as a useful design direction, while the scope of the conclusions remains limited to the tested ICEWS benchmarks and implementation.

Read PDF

Similar papers

#graph neural networks Conference Sep 2026

Demand prediction model based on spatiotemporal graph neural network and external knowledge fusion

A novel hybrid prediction model STKG-DemandNet that integrates spatio-temporal graph neural networks and external knowledge and integrates multi-source external knowledge to achieve fine-grained and highly robust demand forecasting is proposed.

Wen-Di Liao · 0 citations
Open access Oct 2026

TECA: Temporal Evolution with Convolutional Block Attention for Knowledge Graph Reasoning

Temporal Knowledge Graph (TKG) reasoning aims to infer time-dependent facts by modeling how entities and relations evolve. Most existing methods learn entity and relation embeddings jointly from past observations and often treat relations as auxiliary signals induced by entity interactions. This coupling can over-smoot...

Ang-Xiao Zhao, Jian-Ming Li, Wen-Ying Feng et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Time-Aligned Evolving Concept Graphs for Scientific Relation Forecasting

Forecasting scientific relations can guide discovery by identifying promising connections before they emerge. Existing approaches often model concept semantics and graph structure separately or summarize semantics over coarse historical snapshots, leaving semantic representations potentially misaligned with rapidly evo...

Fred Sun, Jing-Ze Wang, Min-Kun Xu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

PEARL: Path-Entity Aligned Relational Learning with Contextual Subgraphs for Inductive Knowledge Graph Completion

PEARL is proposed, a Path-Entity Aligned Relational Learning framework that models paths as context-conditioned reasoning signals and employs a dual-view contrastive objective that promotes representation consistency under stochastic contextual perturbations.

Yun Yang, Longlong Li, Cunquan Qu · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.