Hard-Negative-Aware Contrastive Learning for Knowledge Inference on N-Ary Facts

N-ary relational Knowledge Bases (KBs) allow knowledge to be represented beyond binary relational facts. With a surge in interest in modeling n-ary relational facts, recent approaches have achieved considerable progress on the knowledge inference task. However, these models have generally ignored the hard negative entities. The hard negative entities share the same entity-relation query couple in the primary triple with the ground truth entity, but do not satisfy the n-ary relational query. The existence of hard negative entities is a very important and unique characteristic of n-ary relational KBs in contrast to binary relational KBs. We propose a hard-negative-aware contrastive learning based method for knowledge inference on n-ary relational facts. Our framework is simple and effective, and can be directly applied to any recent approaches on n-ary relational facts without further modification. The empirical findings across three real-world datasets demonstrate the superiority of this framework.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/icaace65325.2025.11019736
Primary Topic
Imbalanced Data Classification Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hard-Negative-Aware Contrastive Learning for Knowledge Inference on N-Ary Facts

Xuan Zhang, Zili Zhang
Imbalanced Data Classification Techniques
article

Hard-Negative-Aware Contrastive Learning for Knowledge Inference on N-Ary Facts

Xuan Zhang, Zili Zhang
article en

Abstract

N-ary relational Knowledge Bases (KBs) allow knowledge to be represented beyond binary relational facts. With a surge in interest in modeling n-ary relational facts, recent approaches have achieved considerable progress on the knowledge inference task. However, these models have generally ignored the hard negative entities. The hard negative entities share the same entity-relation query couple in the primary triple with the ground truth entity, but do not satisfy the n-ary relational query. The existence of hard negative entities is a very important and unique characteristic of n-ary relational KBs in contrast to binary relational KBs. We propose a hard-negative-aware contrastive learning based method for knowledge inference on n-ary relational facts. Our framework is simple and effective, and can be directly applied to any recent approaches on n-ary relational facts without further modification. The empirical findings across three real-world datasets demonstrate the superiority of this framework.

Peking University (CN)
China Postdoctoral Science Foundation
Openalex Percentile: Top 94%
Imbalanced Data Classification Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.