NumCoKE: Ordinal-Aware Numerical Reasoning over Knowledge Graphs with Mixture-of-Experts and Contrastive Learning
Ming Yin, Zongsheng Cao, Qiqing Xia, Chenyang Tu, Neng Gao
摘要
Knowledge graphs (KGs) serve as a vital backbone for a wide range of AI applications, including natural language understanding and recommendation. A promising yet underexplored direction is numerical reasoning over KGs, which involves inferring new facts by leveraging not only symbolic triples but also numerical attribute values (e.g., length, weight). However, existing methods fall short in two key aspects: (1) Incomplete semantic integration: Most models struggle to jointly encode entities, relations, and numerical attributes in a unified representation space, limiting their ability to extract relation-aware semantics from numeric information. (2) Ordinal indistinguishability: Due to subtle differences between close values and sampling imbalance, models often fail to capture fine-grained ordinal relationships (e.g., longer, heavier), especially in the presence of hard negatives. To address these challenges, we propose NumCoKE—a numerical reasoning framework for KGs based on Mixture-of-Experts and Ordinal Contrastive Embedding. To overcome (C1), we introduce a Mixture-of-Experts Knowledge-Aware (MoEKA) encoder that jointly aligns symbolic and numeric components into a shared semantic space, while dynamically routing attribute features to relation-specific experts. To handle (C2), we propose Ordinal Knowledge Contrastive Learning (OKCL), which constructs ordinal-aware positive and negative samples using prior knowledge, enabling the model to better discriminate subtle semantic shifts. Extensive experiments on three public KG benchmarks demonstrate that NumCoKE consistently outperforms competitive baselines across diverse attribute distributions, validating its superiority in both semantic integration and ordinal reasoning.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper17
- Composition-based Multi-Relational Graph Convolutional NetworksShikhar Vashishth, Soumya Sanyal, Vikram Nitin, Partha P. TalukdarICLR 2020 · 被引用 1,105 次
- Are Graph Augmentations Necessary?: Simple Graph Contrastive Learning for RecommendationJunliang Yu, Hongzhi Yin, Xin Xia, Tong Chen 等SIGIR 2022 · 被引用 658 次
- Learning Hierarchy-Aware Knowledge Graph Embeddings for Link PredictionZhanqiu Zhang, Jianyu Cai, Yongdong Zhang, Jie WangAAAI 2020 · 被引用 481 次
- Self-supervised Heterogeneous Graph Neural Network with Co-contrastive LearningXiao Wang, Nian Liu, Hui Han, Chuan ShiKDD 2021 · 被引用 388 次
- Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic ConesYushi Bai, Zhitao Ying, Hongyu Ren, Jure LeskovecNeurIPS 2021 · 被引用 84 次
相关 Paper
- Exploiting Relation-aware Attribute Representation Learning in Knowledge Graph Embedding for Numerical ReasoningGayeong Kim, Sookyung Kim, Ko Keun Kim, Suchan Park 等KDD 2023 · 被引用 4 次
- Complex Numerical Reasoning with Numerical Semantic Pre-training FrameworkJun Zhang, Haihong E, Tianyi Hu, Yifan Zhu 等EMNLP 2025
- Differential-Aware Synergy of Quantity and Topology for Hyper-Relational Knowledge Graphs with Numeric EntitiesMing Yin, Neng GaoKDD 2026
- Multiple Heads are Better than One: Mixture of Modality Knowledge Experts for Entity Representation LearningYichi Zhang, Zhuo Chen, Lingbing Guo, Yajing Xu 等ICLR 2025 · 被引用 1 次
- ChainsFormer: Numerical Reasoning on Knowledge Graphs From a Chain PerspectiveZe Zhao, Bin Lu, Xiaoying Gan, Gu Tang 等ICDE 2025 · 被引用 1 次
