惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

大猫的无限游戏
大猫的无限游戏
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
AWS News Blog
AWS News Blog
V
V2EX - 技术
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
Cloudbric
Cloudbric
S
Securelist
L
LINUX DO - 最新话题
Scott Helme
Scott Helme
T
Threat Research - Cisco Blogs
S
Schneier on Security
Simon Willison's Weblog
Simon Willison's Weblog
G
GRAHAM CLULEY
I
Intezer
C
Cybersecurity and Infrastructure Security Agency CISA
C
CERT Recently Published Vulnerability Notes
SecWiki News
SecWiki News
cs.CV updates on arXiv.org
cs.CV updates on arXiv.org
TaoSecurity Blog
TaoSecurity Blog
D
Darknet – Hacking Tools, Hacker News & Cyber Security
Attack and Defense Labs
Attack and Defense Labs
S
Security Affairs
D
Docker
The Cloudflare Blog
博客园 - 三生石上(FineUI控件)
爱范儿
爱范儿
美团技术团队
W
WeLiveSecurity
阮一峰的网络日志
阮一峰的网络日志
月光博客
月光博客
Recent Commits to openclaw:main
Recent Commits to openclaw:main
博客园_首页
G
Google Developers Blog
C
Cisco Blogs
T
Tor Project blog
B
Blog RSS Feed
Vercel News
Vercel News
宝玉的分享
宝玉的分享
Recorded Future
Recorded Future
Cisco Talos Blog
Cisco Talos Blog
P
Palo Alto Networks Blog
Application and Cybersecurity Blog
Application and Cybersecurity Blog
E
Exploit-DB.com RSS Feed
PCI Perspectives
PCI Perspectives
K
Kaspersky official blog
量子位
Google Online Security Blog
Google Online Security Blog
Jina AI
Jina AI
Hacker News - Newest:
Hacker News - Newest: "LLM"
aimingoo的专栏
aimingoo的专栏

cs updates on arXiv.org

暂无文章

Boosting Knowledge Graph Foundation Models via Enhanced Negative Sampling
Yinan Liu, Wenjin Xu, Zhiyuan Zha, Xiaochun Yang, Bin Wang · 2026-05-26 · via cs updates on arXiv.org

Knowledge graphs (KGs) have become the core backbone of numerous downstream tasks such as question answering and recommender systems. However, despite all this, KGs are often very incomplete. To perform zero-shot knowledge graph completion in unseen KGs, which have different relational vocabularies from those used for pre-training, KG foundation models (KGFMs) receive a wide range of attention. Existing KGFMs often perform training using random negative triples, which are constructed by replacing the head or tail entity of a positive triple with a random entity. However, these negative triples are often constructed with limited quality, providing weak supervision for KGFM training. In this paper, we propose a simple yet effective adaptive negative sampling approach, KMAS, to enhance existing KGFMs. KMAS constructs hard negative triples through the updated relation embeddings generated from the existing KGFM's relation encoder. To further adaptively align with the evolving capability of the KGFM during the training process, KMAS adjusts the ratio of hard negative triples dynamically throughout the whole training process: after a warmup phrase, it increases the ratio linearly and then decreases linearly. Extensive experiments are conducted over 44 data sets. Experimental results demonstrate that our proposed negative sampling method can enhance many SOTA KGFMs without requiring excessive additional time or memory consumption.