PrimeKG-CL: A Continual Graph Learning Benchmark on Evolving Biomedical Knowledge Graphs

• URL: http://arxiv.org/abs/2605.10529v1
• Date: Mon, 11 May 2026 13:14:02 GMT
• Title: PrimeKG-CL: A Continual Graph Learning Benchmark on Evolving Biomedical Knowledge Graphs
• Abstract summary: Existing continual graph learning has been studied almost exclusively on synthetic random, generic KGs.<n>We introduce a benchmark built from nine authoritative biomedical databases.<n>We evaluate six CL strategies across four KGE decoders, plus LKGE, an CK-hugging agent, and CMKL.
• Score: 19.859134741964805
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Biomedical knowledge graphs underwrite drug repurposing and clinical decision support, yet the upstream ontologies they depend on update on independent cycles that add millions of edges and deprecate hundreds of thousands more between releases. Yet existing continual graph learning has been studied almost exclusively on synthetic random splits of static, generic KGs, a regime that cannot reproduce the asynchronous, structured evolution real biomedical KGs undergo. To this end, we introduce PrimeKG-CL, a CGL benchmark built from nine authoritative biomedical databases (129K+ nodes, 8.1M+ edges, 10 node types, 30 relation types) with two genuine temporal snapshots (June 2021, July 2023; 5.83M edges added, 889K removed, 7.21M persistent), 10 entity-type-grouped tasks, multimodal node features, and a per-task persistent/added/removed test stratification. On three tasks (biomedical relationship prediction, entity classification, KGQA), we evaluate six CL strategies across four KGE decoders, plus LKGE, an LLM-RAG agent, and CMKL. We find that decoder choice and continual learning strategy interact strongly: no single strategy performs best across all decoders, and mismatched combinations can significantly degrade performance. Moreover, only DistMult exhibits a clear separation between persistent and deprecated knowledge, indicating that standard metrics conflate retention of still-valid facts with failure to forget outdated ones; this effect is absent under RotatE. In addition, multimodal features improve entity-level tasks by up to 60%, and a recent CKGE framework (IncDE) failed to scale to our 5.67M-triple base task across five attempts up to 350GB RAM. Data, pipeline, baselines, and the stratified split are released openly. Dataset:huggingface.co/datasets/yradwan147/PrimeKGCL|Code:github.com/yradwan147/primekg-cl-neurips2026

Related papers

• SkillDAG: Self-Evolving Typed Skill Graphs for LLM Skill Selection at Scale [54.70985426016736]
  We present SkillDAG, which models inter-skill relationships as a typed directed graph.<n>Each search returns vector matches, typed-edge neighbors, and conflict signals, and a propose-then-commit protocol lets the agent register execution-backed edges.<n>On ALFWorld and SkillsBench with MiniMax-M2.7, SkillDAG reaches 67.1% success and 27.3% reward.
  arXiv  Detail & Related papers  (2026-06-02T02:45:21Z)
• CMKL: Modality-Aware Continual Learning for Evolving Biomedical Knowledge Graphs [11.909154331954456]
  We propose a CL framework for biomedical KGs that encodes structure, text, and molecules and protects previously learned knowledge.<n>We evaluate CMKL on a 129K-entity biomedical continual benchmark with 10 tasks.
  arXiv  Detail & Related papers  (2026-05-11T13:03:37Z)
• Graph-Aware Late Chunking for Retrieval-Augmented Generation in Biomedical Literature [0.0]
  GraLC-RAG is a framework that unifies late chunking with graph-aware structural intelligence.<n>We evaluate six strategies on 2,359 IMRaD-filtered Central articles using 2,033 cross-section questions.
  arXiv  Detail & Related papers  (2026-03-23T23:22:58Z)
• Open Biomedical Knowledge Graphs at Scale: Construction, Federation, and AI Agent Access with Samyama Graph Database [0.0]
  We present three open-source biomedical knowledge graphs -- Pathways KG, Clinical Trials KG, and Drug Interactions KG.<n>Our contributions are threefold. First, we describe a high-performance graph for constructing large-scale KGs from heterogeneous public data sources.<n>Second, we demonstrate cross-KG federation: loading all three snapshots into a single graph tenant enables property-based joins.
  arXiv  Detail & Related papers  (2026-03-16T10:36:13Z)
• MePo: Meta Post-Refinement for Rehearsal-Free General Continual Learning [47.195830952416294]
  We introduce an innovative approach named Meta Post-Refinement (MePo) for PTMs-based general continual learning (GCL)<n>MePo constructs pseudo task sequences from pretraining data and develops a bi-level meta-learning paradigm to refine the pretrained backbone.<n>MePo serves as a plug-in strategy that achieves significant performance gains across a variety of GCL benchmarks and pretrained checkpoints.
  arXiv  Detail & Related papers  (2026-02-08T12:15:35Z)
• Encyclo-K: Evaluating LLMs with Dynamically Composed Knowledge Statements [78.87065404966002]
  Existing benchmarks predominantly curate questions at the question level.<n>We propose Encyclo-K, a statement-based benchmark that rethinks benchmark construction from the ground up.
  arXiv  Detail & Related papers  (2025-12-31T13:55:54Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• MedKGent: A Large Language Model Agent Framework for Constructing Temporally Evolving Medical Knowledge Graph [57.54231831309079]
  We introduce MedKGent, a framework for constructing temporally evolving medical Knowledge Graphs.<n>We simulate the emergence of biomedical knowledge via a fine-grained daily time series.<n>The resulting KG contains 156,275 entities and 2,971,384 relational triples.
  arXiv  Detail & Related papers  (2025-08-17T15:14:03Z)
• Improving the U-Net Configuration for Automated Delineation of Head and Neck Cancer on MRI [0.0]
  Tumor volume segmentation on MRI is a challenging and time-consuming process.<n>This work presents an approach to automated delineation of head and neck tumors on MRI scans.<n>The focus of this research was to propose improvements to the configuration commonly used in medical segmentation tasks.
  arXiv  Detail & Related papers  (2025-01-09T10:22:35Z)
• Predicting Drug-Drug Interactions Using Knowledge Graphs [0.0]
  We propose the medicX end-to-end framework that integrates several drug features from public drug repositories into a Knowledge Graph. Ultimately, we use a Machine Learning (ML) algorithm that predicts unknown Drug-Drug Interactions (DDIs) We also develop a graph auto-encoder model that uses a Graph Neural Network (GNN), which achieved an F1-score of 91.94%.
  arXiv  Detail & Related papers  (2023-08-08T10:07:22Z)
• Generalizing electrocardiogram delineation: training convolutional neural networks with synthetic data augmentation [63.51064808536065]
  Existing databases for ECG delineation are small, being insufficient in size and in the array of pathological conditions they represent. This article delves has two main contributions. First, a pseudo-synthetic data generation algorithm was developed, based in probabilistically composing ECG traces given "pools" of fundamental segments, as cropped from the original databases, and a set of rules for their arrangement into coherent synthetic traces. Second, two novel segmentation-based loss functions have been developed, which attempt at enforcing the prediction of an exact number of independent structures and at producing closer segmentation boundaries by focusing on a reduced number of samples.
  arXiv  Detail & Related papers  (2021-11-25T10:11:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.