arXiv:2608. 12720v1 Announce Type: cross Abstract: While Large Language Model (LLM) agents increasingly rely on long-term memory for persistent interactions, the retrieval mechanisms governing this memory are rarely treated as evolvable components.
By Haolong Chen, Liang Zhang, Zhuo Li, Lei Xue, Guanrxu Zhu
The paper introduces a search‑aware reinforcement learning framework for multi‑component query understanding in Roblox game search. It first uses teacher‑student supervised fine‑tuning to create a schema‑compliant policy, then applies reinforcement learning that optimizes each query‑understanding component with component‑specific rewards derived from live search engine interactions. Experiments show that this approach improves per‑component utility and overall search quality, raising NDCG@20 by 8.9 points over the supervised baseline and 3.5 points over a single end‑to‑end reward strategy.
By Nayoung Choi, Shengjian Chen, Xiaokai Wei, Wenzheng Zhang, Daiyao Yi, Rachit Pareek, Vincent Su, Michelle Gong, Jinho D. Choi
SkillFM is a generative framework that creates task‑conditioned textual skills for large language model agents without relying on manual skill banks or reinforcement learning. It encodes skills into a continuous latent space using a codec and trains a conditional flow model with improved MeanFlow, allowing single‑step latent sampling at inference. The sampled latent is decoded by an LLM into textual guidance, and the method outperforms other vector‑based skill approaches on ALFWorld, Search‑QA, and other tasks.
By Zuming Zhang, Jie He, Yizhe Zhang, Jeff Z. Pan
arXiv:2607. 29468v1 Announce Type: new Abstract: Self-play agents can generate training problems without questions from target benchmarks, but their curricula lack persistent state: failures affect gradients yet do not explicitly shape future practice.
By Zenghuang Fu, Zhaoyang Li, Qiuyuan Ai, Haoyu Wu, Minghui Wu, Chenxu Zhao, Ante Wang, Guannan He, Changwei Wang
SEEK (Skill‑Routed Evaluation with Evolvable Knowledge) is a framework that externalizes search evaluation criteria into a skill bank, dynamically routes relevant skills for each query‑result pair, and uses a task‑adapted listwise evaluator to generate page‑level judgments and failure‑mode attribution. It employs a two‑stage training pipeline to align evaluation with human preferences and a replay‑gated skill bank to incorporate new evaluation knowledge without retraining the model. Experiments on industrial short‑video search demonstrate that SEEK improves listwise quality evaluation accuracy and significantly advances attribution diagnosis, leading to its deployment at Kuaishou with over 400 million daily active users.
By Zhongxin Huang, Songyang Li, Renzhe Zhou, Feiran Zhu, Chenglei Dai, Zhen Xiao, Xuanping Li, Jingwei Zhuo
Agent skills are increasingly used to equip large language model (LLM) agents with reusable procedural knowledge. Although recent work has substantially improved skill retrieval due to the increasing skill libraries, retrieving a plausible skill bundle does not guarantee that executing it is worthwhile.
arXiv:2608. 05245v1 Announce Type: new Abstract: Reusable skills, which encapsulate the procedural knowledge required to solve real-world professional tasks, offer LLM-based agents a path toward self-evolution in expert domains.
By Muyang Ye, Tian Lan, Feihu Jiang, Yongshi Ye, Wuyunsiqin, Bin Zhu, Qianghuai Jia, Zhao Xu, Weihua Luo, Ye Wang, Jinyang Zhang, Longyue Wang, Lingfeng Bao
Clarify-Then-Search is a benchmark that tests whether large language models can ask clarification questions to improve the usefulness of deep search results. It uses 518 real-world query pairs from Baidu, where each intent query is paired with an underspecified version. The evaluation involves a clarifier asking up to three questions, a user answerer providing only explicit information, and a rewriter generating a new query that is then searched; performance is measured by a weighted nugget-recall score.
By Deqiang Huang, Jingbo Zhou, Xinjiang Lu, Tong Xu, Hua Wu, Enhong Chen
The paper investigates how trajectory fine‑tuning can enhance small language models (SLMs) as next‑action controllers in retrieval‑augmented question answering. By building a seven‑way action‑prediction task from teacher search traces, the authors fine‑tune SLMs and cross‑lingual SLMs (xSLMs) using LoRA and evaluate on 1,646 held‑out examples, achieving a macro‑F1 of 0.6536 with Granite 4.1 3B. In an end‑to‑end controller/generator swap experiment on 149 trajectories, the fine‑tuned model improves Exact Match from 0.7530 to 0.7946 and token F1 from 0.7783 to 0.8295, demonstrating that trajectory supervision boosts action prediction and evidence‑recording behavior.
By Mohammed Al-Maamari, Saber Zerhoudi, Michael Granitzer, Jelena Mitrovi\'c
arXiv:2605.05726v2 Announce Type: replace
Abstract: As LLM agents are increasingly deployed with large libraries of reusable skills, selecting the right skill for a user request has become a critical...
By Hongcheol Cho, Ryangkyung Kang, Youngeun Kim
The paper introduces DRAG, a query‑adaptive framework that jointly selects retriever and generator configurations for Retrieval‑Augmented Generation (RAG) systems. Two variants are presented: DRAG_QPP, a training‑free routing method using Query Performance Prediction and perplexity signals, and DRAG_SFT, a supervised approach that fine‑tunes an LLM to predict configurations. Experiments on three LLM families and four QA benchmarks show that DRAG_QPP matches strong static baselines while cutting inference latency, and DRAG_SFT consistently outperforms both static and training‑free adaptive baselines, demonstrating a better effectiveness‑efficiency trade‑off.
By Neeraj Anand, Payel Santra, Partha Basuchowdhuri, Debasis Ganguly, Sumit Bhatia
arXiv:2608. 09168v1 Announce Type: new Abstract: Agent skills are increasingly used to equip large language model (LLM) agents with reusable procedural knowledge.
By Liang He, Jingbo Wen, Hongyu Gu, Hao Li, Haoyu Wang, Yixiong Chen, Kangning Cui, Xilu Wang