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 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: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
arXiv:2608. 06196v1 Announce Type: new Abstract: Agents backed by large skill libraries must decide which skills to load and in what order.
By Indivara Kolluru, Nathan Sportsman
arXiv:2608.22767v1 Announce Type: new
Abstract: Long-term language-model agents accumulate memories across interactions, but their retrievers typically do not accumulate retrieval experience. Semanti...
By Qi Feng, Chris Ding, Jicong Fan
The study evaluates large language models (LLMs) as rerankers in conversational movie recommendation, comparing proprietary, open-weight, and fine-tuned LLMs against collaborative-filtering and sequential baselines on the ReDial benchmark. Results show that the best proprietary LLM achieves an NDCG@10 of 0.1497 with a shared semantic candidate pool, outperforming non-LLM baselines, while open-weight LLMs do not surpass a tuned shallow autoencoder under the same protocol. The analysis also highlights that reranker performance is highly sensitive to candidate generation, pool size, scoring policy, and decoding temperature, suggesting these factors should be reported as standard evaluation fields.
By Ante Kapetanovic, Tomislav Duricic, Andro Mercep, Emanuel Lacic
The paper investigates how synthetic data used for fine‑tuning large language model (LLM) skill routers can lead to catastrophic forgetting of real and out‑of‑distribution (OOD) skills. By evaluating a production router with 34,396 skills, the authors show that synthetic‑data fine‑tuning improves in‑distribution retrieval but degrades performance on real and OOD data. They test several continual‑learning inspired mitigation methods—embedding‑anchor regularization, Learning without Forgetting, Elastic Weight Consolidation, and L2‑initialization—and find that these approaches both preserve OOD retrieval performance and boost synthetic in‑distribution retrieval by up to 13.98% for a 0.6B Qwen retriever and reranker.
By Syed Shariyar Murtaza, Yifan Nie, Utkarsh Soni, Eugene Wen, Arvid Frydenlund
arXiv:2606. 29947v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used as rerankers in recommender systems, with the expectation that semantic understanding will help in cold-start and long-tail regimes.
By Zhe Dong (University of Maine at Presque Isle), Fang Qin (Stanford University), Manish Shah (Independent Researcher), Yicheng Wang (Independent Researcher)
arXiv:2607. 12204v1 Announce Type: new Abstract: Attention can be viewed as an online learner over context, yet existing test-time memories cannot certify that dropping a token leaves outputs unchanged or delete its influence outright.
By Vishwajith Ramesh