Multi-Expert Routing for Event Graph Completion
Abstract
AbstractThe task of event graph completion (EGC) aims to predict the missing relations between two events in a heterogeneous event graph (EG) to enhance its applicability in downstream tasks. Given that event graphs inherently contain both semantic and structural information, and that the effective aggregation of these two types of information can mutually reinforce their expressive power, we propose a **M**ulti-**E**xpert **R**outing (MER) framework, which leverages the mixture of experts (MoE) architecture to dynamically select appropriate experts for collaboratively addressing different key aspects of the EGC task. Specifically, our approach incorporates multiple specialized experts, leveraging prompt learning and a graph attention network, to independently model distinct semantic and structural features within EGs. Furthermore, an adaptive expert routing (AER) module is designed to dynamically fuse and select the missing relation predictions from the experts, thereby completing the EGs. Extensive experiments conducted on the EGC-MAVEN dataset demonstrate that our MER framework outperforms the state-of-the-art competitors.