The paper introduces Matched Excess-Outranker Regularization (MEOR), a new host-level objective for continual knowledge graph embedding that addresses candidate-set interference caused by entity admission. MEOR compares newcomer pressure with matched old references, applying a one-sided penalty only when newcomers outcompete these references, thereby preserving the learner’s signal for legitimate new entities. Experiments on ENTITY-ComplEx and FBInc datasets show that MEOR improves historical current-universe mean reciprocal rank and reduces candidate-set interference, outperforming several baseline regularizers.
By Hao Ren, Junbin Gao, Jiaojiao Jiang
arXiv:2606. 26511v1 Announce Type: cross Abstract: Retrieval-augmented generation (RAG) gives agents access to accumulated knowledge, but has no model of time.
By Neeraj Yadav
The paper argues that evaluating continual knowledge‑updating methods solely at a final checkpoint and a single adapter rank can be misleading. By fixing a periodic hierarchy and comparing it to cumulative replay on a 24‑month Wikidata stream, the authors show that the apparent best method changes depending on the evaluation month, replay LoRA rank, and query formulation. They recommend reporting performance trajectories and capacity sweeps, and only declaring a robust winner when the ranking remains stable across the evaluation region.
By Heejin Choi
The paper investigates how scaling hard‑negative training for rerankers can improve industrial legal retrieval systems once embedding recall saturates. On Chinese legal benchmarks, a pipeline that first uses embedding‑mined negatives and then self‑mined negatives yields the best trade‑off, and a 4B‑parameter Stage2 reranker outperforms the native 4B model on STARD, CSAID, and internal datasets. The study demonstrates that evaluating retrieval and reranking stages separately is beneficial for optimizing industrial retrieval performance.
By Yunhan Li, Mingjie Xie, Zeyang Shi, Gengshen Wu, Min Yang
The paper introduces CGM-Rec, a continual graph memory framework designed for adaptive recommendation in the presence of intent drift. CGM-Rec treats the knowledge graph as writable memory, comprising a conservative Semantic Graph Memory for stable relational knowledge and a fast-reactive Episodic Lesson Memory for recent outcomes and corrective hints. Experiments show that, with frozen model parameters and one-pass reranking, CGM-Rec outperforms neural and LLM-based baselines across multiple recommendation settings, achieving significant gains such as a 29.58% improvement in HR@1 over the strongest LLM baseline on Bundle.
By Hao Nguyen Ngoc, Tung Nguyen, Nguyen Thi Hanh, Hoang Thai Dinh, Nguyen Xuan Tung
arXiv:2610.09835v1 Announce Type: new
Abstract: Continual pre-training and fine-tuning in Large Language Models (LLMs) inevitably induce catastrophic forgetting, typically mitigated by replay using o...
By Jonghyun Han, Younghoon Song, Jongyoul Park
The paper examines LLM-based recommendation rerankers that are often evaluated under an oracle protocol, which guarantees the ground-truth item is present in the scored set. Across Amazon datasets, this protocol overestimates realistic NDCG@10 by 92–95% because realistic retrieval only covers 2–19% of relevant items at K=100, creating a recall ceiling that limits any closed-candidate reranker's top‑k NDCG. The authors find that various optimisation strategies—including prompt engineering, model scaling, sequential models, supervised neural rerankers, LoRA fine‑tuning, hybrid retrieval, score‑aware prompting, and LLM+CF fusion—do not significantly improve over a collaborative‑filtering baseline under realistic retrieval, and they propose a Recall‑Aware Evaluation Protocol (RAEP) to better assess rerankers in low‑recall regimes.
By Zhaohui Wang
arXiv:2608.28978v1 Announce Type: new
Abstract: Knowledge graphs have been proposed as a structured alternative to flat retrieval-augmented generation for long-term agent memory, on the assumption th...
By Theo Rusu, Sourena Khanzadeh, Manar Alalfi
arXiv:2605. 04495v2 Announce Type: replace-cross Abstract: Retrieval-augmented generation (RAG) relies on evidence ranking to determine what information is exposed to the generator, yet existing retrieval and reranking methods primarily estimate query--document relevance.
By Zhipeng Song, Yizhi Zhou, Xiangyu Kong, Jiulong Jiao, Xuezhou Ye, Chunqi Gao, Xueqing Shi, Yu Wang, Yuhang Zhou, Heng Qi
The paper investigates time‑incremental continued pretraining (CPT) of large language models using web‑scale data that overlaps across snapshots. Across six open‑weight models, CPT improves factual recall without catastrophic forgetting, while the cost is negligible and data quality outweighs quantity. The study identifies optimal learning rates, shows LoRA can match full CPT, and demonstrates that CPT gains transfer to fine‑tuned models.
By F{\i}rat \"Oncel, Salman Hussain Ali, Mirco Ravanelli, Cem Subakan, \c{C}a\u{g}atay Y{\i}ld{\i}z
The paper introduces Kernel-Anticipated Unlearning (KAU), a method for approximate unlearning of knowledge-graph embeddings that accounts for relearning during continued training. KAU uses the tangent kernel to model how forgotten facts’ scores change, expressing this response in closed form and guiding edits to minimize future leakage. Experiments show KAU reduces leakage by 46‑63% on FB15k-237 and 50‑82% on CoDEx-L compared to the strongest existing unlearner, while preserving higher utility.
By Parnian Fazel, Mohammad M Maheri, Hamed Haddadi
HERO is a heterogeneous continual graph learning framework that preserves historical knowledge at both structural and semantic levels while adapting to new tasks. It uses DiSCo to select representative target nodes and reconstruct compact heterogeneous contexts, and applies multi-level knowledge distillation to align task-conditioned predictions with semantic responses. Experiments on four datasets with three HGNN backbones show HERO achieves best or tied-best average performance while maintaining competitive forgetting.
By Guiquan Sun, Xikun Zhang, Jingchao Ni, Dongjin Song