Generative Representation Learning on Hyper-relational Knowledge Graphs via Masked Discrete Diffusion
This work addresses the limitation of existing HKG methods that assume only a single missing component, enabling more realistic fact completion and generation for knowledge graph applications.
KREPE introduces a generative representation learning method for hyper-relational knowledge graphs that can generate valid facts from arbitrarily masked queries, outperforming state-of-the-art link prediction methods on standard benchmarks and LLM-based baselines in fact generation.
Hyper-relational knowledge graphs (HKGs) effectively represent complex facts. While inferring new knowledge in HKGs is a critical problem, current methods cast it as a simple link prediction, assuming that nearly all entities and relations within a fact are known, leaving only a single blank to be filled. However, this restricted assumption may not hold in real-world scenarios in which multiple, or even all, constituent components of a fact may be missing simultaneously. To bridge this gap, we introduce a task called fact generation: generating a valid hyper-relational fact from an arbitrarily masked query, i.e., completing a partially observed fact or generating a fact from scratch. We propose KREPE, the first generative representation learning method for HKGs that learns to model the probability distributions of missing components conditioned on the local fact components and global structure of HKGs via a masked discrete diffusion. KREPE models both the intra-fact dependencies by contextual message passing and inter-fact correlations by aggregating stochastically sampled contexts. KREPE seamlessly unifies link prediction and fact generation within a single training framework, achieving state-of-the-art performance on standard HKG link prediction benchmarks and outperforming LLM-based baselines in generating novel and correct facts.