iGEN
Visit IGEN World Explore IGEN Expo
EXPLORE UPGRADE PLANS
BREAKING
Strait of Hormuz Reopening: Mine Clearance Delays Threaten Weeks-Long Recovery for Oil Shipping India’s REITs and InvITs May Attract Rs 11.6 Lakh Crore Investment by 2030, Avendus Report Says DualGauge: Automated Joint Security-Functionality Benchmarking of Specification-Only Code Generation by LLMs and Coding Agents Nimble SharePower: Modular Power Bank Lets You Share a Charge With a Friend OBCache Prunes KV Cache for Efficient Long-Context LLM Inference with Output-Aware Scoring 'Dangerous' AI Models: Enterprise Leaders Must Prepare for Broad Availability Air India Launches 'Basic Fare' Option Without Complimentary Meals on Select Domestic Flights New Survey Maps How Evidence Tracing and Execution Provenance Can Make LLM Agents Trustworthy New Unifying Lens for Learning to Hash Could Cut Memory Costs in Large-Scale Retrieval Mosaic: Data-Free Knowledge Distillation Framework Uses Mixture-of-Experts to Tackle Heterogeneous Federated Learning Strait of Hormuz Reopening: Mine Clearance Delays Threaten Weeks-Long Recovery for Oil Shipping India’s REITs and InvITs May Attract Rs 11.6 Lakh Crore Investment by 2030, Avendus Report Says DualGauge: Automated Joint Security-Functionality Benchmarking of Specification-Only Code Generation by LLMs and Coding Agents Nimble SharePower: Modular Power Bank Lets You Share a Charge With a Friend OBCache Prunes KV Cache for Efficient Long-Context LLM Inference with Output-Aware Scoring 'Dangerous' AI Models: Enterprise Leaders Must Prepare for Broad Availability Air India Launches 'Basic Fare' Option Without Complimentary Meals on Select Domestic Flights New Survey Maps How Evidence Tracing and Execution Provenance Can Make LLM Agents Trustworthy New Unifying Lens for Learning to Hash Could Cut Memory Costs in Large-Scale Retrieval Mosaic: Data-Free Knowledge Distillation Framework Uses Mixture-of-Experts to Tackle Heterogeneous Federated Learning
Home ›› Technology ›› Ai ›› Llms ›› Boosting Knowledge Graph Foundation Models via Enhanced Negative Sampling

Boosting Knowledge Graph Foundation Models via Enhanced Negative Sampling

Researchers propose KMAS, an adaptive negative sampling approach that enhances knowledge graph foundation models (KGFMs) by generating hard negative triples from relation embeddings. The method dynamically adjusts the ratio of hard negatives during training, improving performance across 44 datasets without significant extra time or memory.

iG
iGEN Editorial
June 16, 2026
Boosting Knowledge Graph Foundation Models via Enhanced Negative Sampling

Knowledge graphs (KGs) power downstream tasks such as question answering and recommender systems, but they are often very incomplete. To perform zero-shot knowledge graph completion in unseen KGs with different relational vocabularies, knowledge graph foundation models (KGFMs) have gained wide attention. A new paper on arXiv by Liu, Yinan; Xu, Wenjin; Zha, Zhiyuan; Yang, Xiaochun; and Wang, Bin introduces a simple yet effective adaptive negative sampling approach called KMAS to boost existing KGFMs.

The Challenge of Negative Sampling in KGFM Training

Existing KGFMs typically train using random negative triples, constructed by replacing the head or tail entity of a positive triple with a random entity. According to the paper, these negative triples are often of limited quality, providing weak supervision for KGFM training. This undermines the model's ability to generalize to new knowledge graphs. KMAS addresses this by constructing hard negative triples through updated relation embeddings generated from the existing KGFM's relation encoder.

How KMAS Adapts During Training

KMAS dynamically adjusts the ratio of hard negative triples throughout the entire training process. After a warmup phase, it increases the ratio linearly and then decreases it linearly. This adaptivity aligns with the evolving capability of the KGFM, ensuring that the model is challenged with appropriately difficult negatives at each stage.

Experimental Validation Across 44 Datasets

Extensive experiments were conducted over 44 datasets. The results demonstrate that KMAS can enhance many state-of-the-art (SOTA) KGFMs without requiring excessive additional time or memory consumption. The method is designed to be lightweight and plug-and-play, making it practical for enterprise deployments where computational resources are a concern.

Implications for Enterprise AI

While the paper focuses on academic benchmarks, improved knowledge graph completion has direct relevance for enterprise applications. KGFMs used in recommender systems, customer support, and internal knowledge bases can benefit from more accurate completion. The zero-shot capability is particularly valuable for organizations that need to integrate new domains without retraining from scratch. As enterprises increasingly rely on structured knowledge for decision-making, techniques like KMAS that improve model quality with minimal overhead are likely to see adoption in production pipelines.

Feature Random Negative Sampling KMAS Adaptive Negative Sampling
Negative triple source Random entity replacement Hard negatives from relation embeddings
Adaptivity Static Dynamic ratio adjustment
Time/memory overhead Baseline No excessive additional consumption
Supervision quality Weak (easy negatives) Strong (hard negatives)

The paper's authors are affiliated with institutions not specified in the source, but the work has been made available on arXiv under Computer Science > Artificial Intelligence. The code and data associated with the article are linked through the arXiv platform, enabling practitioners to reproduce and integrate the method into their own KGFMs.

For technology leaders evaluating AI infrastructure, the key takeaway is that improved negative sampling—a seemingly small component of the training pipeline—can yield significant gains in model performance for knowledge graph tasks. As KGFMs become a standard building block for enterprise AI, adopting methods like KMAS could reduce the cost of maintaining and updating knowledge bases while improving downstream task accuracy.


Sources:

Keep Reading

Recommended Stories

A Theoretical Roadmap to Fuse Foundation Models and Knowledge Graphs Technology

A Theoretical Roadmap to Fuse Foundation Models and Knowledge Graphs

A new theoretical paper formalizes the 'Impedance Mismatch' between Foundation Models and Knowledge Graphs, arguing that current approaches like RAG are superficial. The authors propose a roadmap including Structured Residual Streams, Vector Symbolic Architectures, and Orthogonal Subspace Editing for true semantic fusion.

June 16, 2026
Fast-dLLM++ Boosts Diffusion LLM Inference Up to 37% With Fréchet Profile Decoding Technology

Fast-dLLM++ Boosts Diffusion LLM Inference Up to 37% With Fréchet Profile Decoding

Researchers propose Fast-dLLM++, a training-free extension to Fast-dLLM that uses Fréchet profile decoding to select parallel token commit sets from the full confidence profile. Experiments on LLaDA-8B show up to 37% higher throughput at comparable accuracy on benchmarks including GSM8K, MATH, HumanEval, and MBPP.

June 16, 2026
New EEG Benchmark Promises Standardized Evaluation of Foundation Models Technology

New EEG Benchmark Promises Standardized Evaluation of Foundation Models

A new benchmark called EEG-FM-Bench aims to standardize evaluation of electroencephalography foundation models (EEG-FMs). It integrates 14 datasets across 10 paradigms and provides tools for gradient and representation analysis. Early experiments reveal critical insights about multi-task learning, pre-training efficiency, and model scaling.

June 16, 2026
G-Loss: New Graph-Guided Loss Function Boosts Language Model Fine-Tuning Accuracy Technology

G-Loss: New Graph-Guided Loss Function Boosts Language Model Fine-Tuning Accuracy

Researchers introduce G-Loss, a graph-guided loss function that leverages global semantic relationships to fine-tune language models more effectively than traditional loss functions, showing improved accuracy and faster convergence on five benchmark datasets.

June 16, 2026