alphaFeedback

WorksComputer Science

Two Birds with One Stone: Skill-Augmented Generation via Unified Retrieval and Utilization

AI contributions
Not recorded for this paper
View details

Abstract

Skills, as reusable external knowledge, have demonstrated substantial potential to enhance the ability of Large Language Models (LLMs) to solve complex tasks. However, existing skill-augmented generation methods typically rely on separate models for skill retrieval and skill utilization, resulting in disconnected optimization of these two processes. To address this gap, we propose Skill-Uni, a unified reinforcement learning framework that jointly optimizes skill retrieval and utilization. Specifically, we adopt a generative skill retrieval paradigm that enables a single model to both learn how to retrieve relevant skills and leverage them for task solving. To effectively train this unified framework, we introduce a two-stage training strategy consisting of warm-up instruction tuning and GRPO, allowing the model to progressively improve its skill retrieval and utilization capabilities. Extensive experiments on five skill-related benchmarks demonstrate the effectiveness of Skill-Uni, yielding average performance gains of 66.59% and 34.82% over the base Qwen3-4B and LLaMA3.1-8B models, respectively. Besides, Skill-Uni is compatible with various skill retrieval engines, demonstrating its flexibility and generalizability. Additional in-depth analyses also provide insights into the effectiveness of Skill-Uni.

CCS Concepts

• Information systems → Information retrieval.

ACM Reference Format:

Zihan Luo, Jiahui Kang, Wei Zhou, Qilin Fan, Mingyan Li, and Chao Chen. 2018. Two Birds with One Stone: Skill-Augmented Generation via Unified Retrieval and Utilization. In *Proceedings of Make sure to enter the correct conference title from your rights confirmation email (Conference acronym ’XX). ACM, New York, NY, USA, 10 pages. https://doi.org/XXXXXXX.XXXXXXX

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Conference acronym ’XX, Woodstock, NY

© 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM. ACM ISBN 978-1-4503-XXXX-X/2018/06 https://doi.org/XXXXXXX.XXXXXXX

Introduction

As Large Language Models (LLMs) continue to evolve from static question-answering systems into agents capable of autonomously planning and executing complex tasks, relying solely on knowledge encoded in model parameters is increasingly insufficient for real-world demands such as tool use, environment interaction, and long-horizon task execution. To extend the executable capabilities of LLM agents, recent work has increasingly organized reusable task-solving capabilities into modular “skills,” which describe their functionality, applicable conditions, and usage patterns in natural language and may further include instructions, scripts, and other auxiliary resources. Such skills can be retrieved, composed, and reused, and have become an important component of complex agent systems in domains such as embodied AI [30], software engineering [16], and others.

As skill libraries continue to grow, efficiently identifying the skills most relevant to a given task has emerged as a key challenge. Existing work largely follows a retrieval-then-utilize paradigm [3, 11, 28], in which a small set of candidate skills is first retrieved from a skill library based on the user query and then provided to an LLM as external context for downstream task completion. Along this line, Cho et al. introduced SkillRet [3], a large-scale benchmark for skill retrieval in LLM agents, and improved skill recall through dedicated retriever training. Building on this direction, Jiang et al. proposed SkillReason [11] to address the difficulty of inferring latent skill needs from short and underspecified user requests. By incorporating reasoning-trace supervision and staged training, SkillReason integrates explicit reasoning into query representation and further improves dense skill retrieval.

Despite these advances, two important challenges still remain. First, retrieving the right skill does not guarantee using it effectively. Unlike conventional retrieval-augmented generation [7, 32], where retrieved content is primarily factual text, skills often contain richer and more structured information, including instructions, scripts, tool interfaces, and auxiliary resources. Successful task completion therefore requires not only retrieving a relevant skill, but also applying it correctly in subsequent reasoning and execution. As shown in Figure 1, our empirical analysis on SRA-bench [28] with multiple retrievers further shows that improvements in retrieval accuracy translate only partially into downstream task gains, suggesting that skill utilization has become an important bottleneck. Second, skill retrieval and skill utilization are typically optimized in isolation. Existing approaches often treat the retriever and the downstream LLM as separate components: the former is optimized for retrieval accuracy, while the latter passively consumes the retrieved content. However, skill retrieval and utilization are inherently coupled, as the value of a retrieved skill ultimately depends on its contribution to downstream task performance. Optimizing these two processes separately may therefore lead to a mismatch between retrieval objectives and actual task-solving needs.

Retrieval and task accuracy gains relative to TF-IDF

Figure 1. Retrieval and task accuracy gains relative to TF-IDF, measured as the accuracy differences between each retriever and TF-IDF in skill retrieval and downstream task completion, respectively. Although stronger retrievers achieve substantial improvements in retrieval accuracy, only part of these gains translate into downstream task performance.

To address these limitations, we propose Skill-Uni, an end-to-end optimization framework that unifies skill retrieval and utilization. As illustrated in Figure 2, rather than directly matching the original query against the skill library, Skill-Uni adopts a generative skill retrieval paradigm, where the model dynamically generates descriptions of needed skills, retrieves relevant skills through an external retrieval engine, and integrates them into its ongoing generation process. This formulation provides a unified foundation for the model to jointly determine whether and how to retrieve, as well as how to utilize the retrieved skills, within a single generation trajectory. Specifically, to optimize these capabilities, we introduce a two-stage training strategy. We first perform warm-up instruction tuning on high-quality trajectories generated by a stronger teacher model, followed by outcome-based reinforcement learning that jointly optimizes retrieval decisions and the model’s ability to leverage retrieved skills for task completion. By propagating task-level rewards through the entire generation trajectory, Skill-Uni learns not only to retrieve useful skills but also to effectively apply them to solve downstream tasks. We further employ a token-masking strategy to stabilize training. Experiments on five skill-related benchmarks [28] demonstrate that Skill-Uni achieves

Overview of the traditional skill-augmented generation and our paradigm

Figure 2. Overview of the traditional skill-augmented generation and our paradigm.

state-of-the-art performance in both task completion and skill retrieval, while exhibiting strong generalization and robustness.

Our contributions can be summarized as follows:

  • We introduce Skill-Uni, a unified framework for skill retrieval and utilization. Unlike conventional retrieval-then-utilize pipelines that treat retrieval and downstream reasoning as separate stages, Skill-Uni formulates skill retrieval as a generative process and unifies whether to retrieve, what to retrieve, and how to utilize the retrieved skill within a single task formulation.

  • We develop an effective training recipe for skill-augmented reasoning. The training procedure combines warm-up instruction tuning with reinforcement learning, enabling the model to first acquire the proposed interaction pattern and then jointly improve skill retrieval and utilization. We further introduce token masking to exclude externally retrieved skill content from the optimization objective, ensuring that learning focuses on model-generated retrieval and reasoning behaviors.

  • Extensive experiments are conducted across multiple datasets, which demonstrate that Skill-Uni consistently improves both Uni-retrieval quality and downstream task performance, while additional analyses highlight its generalization, robustness, and the importance of jointly optimizing skill retrieval and utilization.

Related Work

Agent Skills

Recent advances in LLM agents have motivated the organization of reusable knowledge and task-solving capabilities into modular skills. A representative example is Claude Agent Skills, where each skill is packaged with lightweight metadata, procedural instructions, and optional supporting resources such as scripts, figures, and reference files. Skills are loaded on demand, allowing agents to acquire task-specific expertise without placing the full skill library in the context window. Conceptually, skills are closely related to external tools [18, 20] and Retrieval-Augmented Generation (RAG) [6, 15], but serve a different role. Whereas tools primarily expose executable functions and RAG typically provides factual or declarative knowledge, skills package reusable procedural knowledge that specifies how an agent should solve a class of tasks. This modularity enables skills to be composed and reused across complex agentic settings, such as embodied AI [30], software engineering [8], and mathematical reasoning [16]. Benchmarks such as SRA-bench [28] and SkillsBench [16] have verified that proper skill integration can provide consistent improvements in downstream tasks given the external knowledge provided by skills. However, how to accurately locate and utilize relevant skills from a large-scale skill library continues to be a central bottleneck.

Skill Retrieval

With the rapid expansion of skill libraries, accurate skill retrieval has emerged as a rising research issue. Early skill-augmented systems typically rely on lexical retrieval methods such as BM25 and TF-IDF [28]. Although computationally efficient, these approaches primarily capture surface-level lexical overlap and may struggle when user requests express the required capability only implicitly. Recent work has therefore focused on learning specialized retrievers for skill retrieval. SkillRet [3] introduces a large-scale benchmark and retrieval-oriented training data for skill selection, showing that task-specific fine-tuning substantially improves retrieval performance over off-the-shelf embedding models. SkillRouter [31] further adopts a retrieve-and-rerank pipeline and demonstrates that the full skill body can provide important signals beyond short metadata descriptions when distinguishing functionally similar skills. More recently, SkillReason [11] targets implicit user requests by introducing reasoning supervision during training, enabling the retriever to better infer latent capability requirements while retaining efficient query-only retrieval at inference. However, all these works are still limited to skill retrieval, while largely overlooking skill utilization, the ability to interpret and apply the retrieved skill to complete the task.

Skill Utilization

Beyond retrieving relevant skills, effectively utilizing them is equally important, as skills often contain complex instructions, executable code, and other resources. Recent studies have explored different approaches to improving skill utilization. Skill0 [19] introduces a training-time curriculum that progressively removes external skill guidance, encouraging models to internalize skill knowledge into their parameters through reinforcement learning. SelSkill [1] investigates whether a retrieved skill should be invoked or skipped, introducing a dual-granularity preference-learning framework to optimize skill invocation decisions. Another line of research focuses on the dynamic evolution of skill libraries. SAGE [29] introduces Sequential Rollout to accumulate reusable skills across related tasks and employs a skill-integrated reward to improve skill generation and utilization. Skill1 [26] jointly optimizes skill selection, utilization, and distillation under a unified reinforcement learning framework, enabling the skill library to evolve through task experience. RASO [4] leverages knowledge retrieved from existing skills to initialize and iteratively refine skills, incorporating execution feedback to guide subsequent updates.

Preliminary

Skill-Augmented Generation

As reusable modules of experience and knowledge, skills are widely employed to assist AI agents in tackling complex tasks. Formally, let C={S1,S2,…,SN}C = \{S_1, S_2, \ldots, S_N\} denote a skill library that contains NN different skills, and each skill SiS_i can be represented as: Si=(Ni,Di,Ii,Pi)S_i = (N_i, D_i, I_i, P_i), where NiN_i denotes the skill name, DiD_i represents a concise description, IiI_i specifies task-relevant instructions, and PiP_i encompasses additional payloads provided within the skill, such as scripts, references, and digital assets.

To efficiently navigate large-scale skill libraries, skill-augmented agents typically adopt a progressive disclosure paradigm [28]. Given a task query qq, a retriever R\mathcal{R} first identifies relevant skill candidates using lightweight metadata, such as skill names NiN_i and descriptions DiD_i. Formally, the retriever R\mathcal{R} selects a small relevant candidate set CrC_r from the skill library CC:

Cr=R(q,{(Ni,Di)}i=1N),(1)C_r = \mathcal{R}(q, \{(N_i, D_i)\}_{i=1}^{N}), \tag*{(1)}

where Cr⊂CC_r \subset C and ∣Cr∣=k≪N|C_r| = k \ll N. Only after CrC_r is selected does the agent load the full content of these kk skills into its context window, preventing context length explosion while ensuring precise capability provision:

A=M(q,Cr),(2)\mathcal{A} = \mathcal{M}(q, C_r), \tag*{(2)}

where M\mathcal{M} denotes the AI agent empowered by a large language model, and A\mathcal{A} represents the final answer.

Group Relative Policy Optimization

Instead of learning a critic model to estimate the rewards as in Proximal Policy Optimization (PPO) [23], Group Relative Policy Optimization (GRPO) [24] is a reinforcement learning algorithm that estimates the rewards dynamically by sampling a group of candidate responses for each query and normalizing their rewards relative to the group. Formally, given a task query qq, the current policy generates a group of GG candidate outputs {o1,o2,…,oG}\{o_1, o_2, \ldots, o_G\} with rewards {r1,r2,…,rG}\{r_1, r_2, \ldots, r_G\}. To quantify the relative quality of each output within the group, the advantage AiA_i for oio_i is computed via standardizing the group rewards:

Ai=ri−mean⁡({rj}j=1G)std⁡({rj}j=1G),(3)A_i = \frac{r_i - \operatorname{mean}(\{r_j\}_{j=1}^{G})}{\operatorname{std}(\{r_j\}_{j=1}^{G})}, \tag*{(3)}

and the policy model πθ\pi_\theta with parameters θ\theta is then optimized by maximizing the following PPO-style clipped objective:

JGRPO(θ)=E{q,oi}[1G∑i=1Gmin⁡(ϕiAi,clip⁡(ϕi,1−ϵ,1+ϵ)Ai)−βDKL(πθ∥πref)],(4)\mathcal{J}_{\mathrm{GRPO}}(\theta) = \mathbb{E}_{\{q,o_i\}}\left[\frac{1}{G}\sum_{i=1}^{G}\min\left(\phi_i A_i, \operatorname{clip}(\phi_i, 1-\epsilon, 1+\epsilon)A_i\right) - \beta D_{\mathrm{KL}}(\pi_\theta\parallel\pi_{\mathrm{ref}})\right], \tag*{(4)}

where ϕi=πθ(oi∣q)πref(oi∣q)\phi_i = \frac{\pi_\theta(o_i|q)}{\pi_{\mathrm{ref}}(o_i|q)} represents the importance sampling ratio, ϵ\epsilon is the clipping hyperparameter, and β\beta controls the strength of the KL penalty to prevent drift from the old reference policy πref\pi_{\mathrm{ref}}.

Method

Overview

In this paper, we introduce Skill-Uni, a unified framework that jointly improves skill retrieval and utilization with a single model. As illustrated in Figure 3, Skill-Uni is first prompted to perform generative skill retrieval, where it generates a brief description of the skill needed for the query. The description is then used to retrieve the most relevant skill from the skill library, which guides the generation of the final response. To equip the model with this capability, we adopt a two-stage training strategy. We first perform warm-up instruction tuning using high-quality teacher-generated trajectories filtered by format and answer correctness. The model is then refined with reinforcement learning using only outcome-based rewards, enabling Skill-Uni to explore various skills and improve the capability to retrieve and use skills jointly through an end-to-end optimization manner.

The overall framework of Skill-Uni

Figure 3. The overall framework of Skill-Uni. (a) Given a query, Skill-Uni is first prompted to describe its desired skills, which will be further used for skill retrieval, and then generate the final response with both the query and the retrieved skills. The whole training process consists of a warm-up instruction tuning stage (b) and a reinforcement learning stage (c).

Unified Task Formulation

Inspired by the paradigm in Search-R1 [12], we treat the retrieval engine as an external tool that can be invoked through structured model outputs. As the prompt template shown below, rather than directly retrieving skills via the original query, Skill-Uni is instructed to express the desired skill description in a designated <rec>...</rec> field. This generated description is subsequently passed to the retrieval engine, which will return the full content of the top-KK relevant skills in <skill>...</skill>. Skill-Uni can then continue reasoning with the retrieved skill information and produce its final response in <answer>...</answer>. Note that, Skill-Uni is agnostic to the underlying retrieval engine R\mathcal{R}, and if no external skill is needed, the model can bypass retrieval altogether and directly generate an answer.

To answer the given question, you can use a skill retrieval engine by <rec> your desired skill’s description </rec>, and it will return the top-1 related skill information between <skill> and </skill>, including the skill’s description and content. You can retrieve as many times as you want. If you find no further external skill needed, you can directly answer the question inside <answer> and </answer>. Question:

This formulation offers two main advantages: 1) It places skill retrieval and skill utilization within the same model trajectory, allowing them to be jointly optimized rather than treated as isolated components. Because what should be retrieved depends on how the retrieved skill will ultimately be used, this unified formulation encourages better coordination between the two processes; 2) Generative skill retrieval can naturally bridge the semantic gap between user queries and skill descriptions by leveraging the superior reasoning capabilities of LLMs. As it is independent of the retrieval engine, Skill-Uni can augment a wide range of existing retrievers R\mathcal{R} like BM25 and Qwen3-Embedding, improving retrieval effectiveness without requiring modifications to their core mechanisms.

Warm-start Instruction Tuning

Different from the cold-start reinforcement learning settings in existing works [5, 12], we empirically find that direct reinforcement learning optimization is less effective in our setting. In particular, when the task requires relatively complex reasoning and the available training data are limited, the base model often fails to produce sufficiently informative learning signals during RL, resulting in weak or unstable optimization progress. Therefore, during the training of Skill-Uni, we first introduce a warm-up instruction tuning stage to improve the model’s basic instruction-following capability under our task formulation. Specifically, we use DeepSeek-V4-Pro1^{1} as the teacher model and prompt it to generate responses following the predefined template, after which the generated samples are filtered based on both answer correctness and format validity, where the latter requires all structured fields to be properly closed and a valid <answer>...</answer> field to be present.

Given the capability gap between the teacher and student models, we first evaluate the student model on each query and assign a label according to whether it can solve the query correctly without external skills. For queries that the student fails to answer correctly, DeepSeek-V4-Pro is instructed to generate a retrieval request within the <rec>...</rec> field, thereby providing supervision for skill retrieval. In contrast, for queries that the student can already solve directly, the teacher is instructed to produce the final answer in <answer>...</answer> without invoking skill retrieval. This capability-aware data construction strategy aligns the supervision signal with the student model’s actual need for external skills, rather than forcing retrieval uniformly across all samples.

After constructing the filtered training set, we adopt conventional Supervised Fine-tuning (SFT) to optimize the model. Specifically, the objective can formulated as:

LSFT=−1N∑i=1N∑t=1TI(oi,t)log⁡P(oi,t∣xi,oi,<t,R;θ)(5)\mathcal{L}_{\mathrm{SFT}}=-\frac{1}{N}\sum_{i=1}^{N}\sum_{t=1}^{T}\mathbb{I}(o_{i,t})\log P(o_{i,t}\mid x_i,o_{i,<t},\mathcal{R};\theta) \tag*{(5)}

where NN denotes the number of training data, and xix_i is the input context with the proposed prompt template. Importantly, I(oi,t)\mathbb{I}(o_{i,t}) is an indicator function that determines whether the current token oi,to_{i,t} is generated by LLMs. During SFT, we mask the retrieved tokens enclosed by <skill>...</skill> so the model can focus on learning to use the skill retrieval engine and apply the skill.

Reinforcement Learning with Skill Retrieval

Building on the model θSFT\theta_{\mathrm{SFT}} obtained from the above warm-up instruction tuning, we further apply reinforcement learning to strengthen its skill retrieval and skill utilization capabilities. Specifically, given a skill retrieval engine R\mathcal{R}, we adopt the GRPO training strategy [24] and use an outcome-based verifier as the only source of reward:

ri={1,if oi is correct,0,otherwise.(6)r_i=\begin{cases}1, & \text{if }o_i\text{ is correct},\\0, & \text{otherwise.}\end{cases} \tag*{(6)}

It is worth noting that we do not introduce any explicit reward for retrieving the gold skill, as such supervision is often difficult to obtain at scale and may overly constrain the model to a predefined retrieval target, potentially limiting its ability to explore alternative skills that are also useful for solving the task. Same with the warm-up instruction tuning stage, we employ a token mask strategy during GRPO as well to exclude retrieved tokens in the <skill> field, avoiding potential distribution shift during training, and the training objective can be formulated as:

JGRPO(θ)=Eq,{oi}i=1G[1G∑i=1G1∑tI(oi,t)∑tI(oi,t)min⁡(ϕi,tAi,t,clip⁡(ϕi,t,1−ϵ,1+ϵ)Ai,t)−βDKL](7)\mathcal{J}_{\mathrm{GRPO}}(\theta)=\mathbb{E}_{q,\{o_i\}_{i=1}^{G}}\left[\frac{1}{G}\sum_{i=1}^{G}\frac{1}{\sum_t\mathbb{I}(o_{i,t})}\sum_t\mathbb{I}(o_{i,t})\min\left(\phi_{i,t}A_{i,t},\operatorname{clip}(\phi_{i,t},1-\epsilon,1+\epsilon)A_{i,t}\right)-\beta D_{\mathrm{KL}}\right] \tag*{(7)}

where Ai,tA_{i,t} is the advantage computed by the relative rewards within the group, and ϕi,t\phi_{i,t} is the importance sampling ratio:

ϕi,t=πθ(oi,t∣xi,oi,<t,R)πθSFT(oi,t∣xi,oi,<t,R).(8)\phi_{i,t}=\frac{\pi_{\theta}(o_{i,t}\mid x_i,o_{i,<t},\mathcal{R})}{\pi_{\theta_{\mathrm{SFT}}}(o_{i,t}\mid x_i,o_{i,<t},\mathcal{R})}. \tag*{(8)}

Experiments

Experimental Setup

Dataset. Our data is primarily derived from SRA-bench [28], which provides ground-truth answers alongside golden skill annotations for each query. Specifically, we select five subsets from SRA-bench, including TheoremQA [2], LogicBench [22], CHAMP [21], MedCalc-Bench [13], and BigCodeBench [33]. For each subset, we perform a random split by allocating 80% of the queries for training and reserving the remaining 20% for test. To further evaluate the generalization capabilities of Skill-Uni, we additionally conduct experiments on MBPP+ [17] and LiveCodeBench [10].

Baselines. Following the settings of prior work [11, 28], we primarily focus on baselines under the retrieve-then-utilize paradigm, where the task models are kept frozen. According to their retrieval mechanisms, these baselines can be categorized into the following three distinct categories:

  • Lexical matching methods: This category relies on surface-level word overlaps and term frequency statistics. Specifically, we include two representative methods namely BM25 and TF-IDF [27] as baselines.

  • Dense embedding retrieval methods: To capture semantic intent beyond surface lexical matches, these methods encode queries and skills into a shared dense vector space. We consider both general-purpose retrievers like Qwen3-Embedding-4B3 and Octen-Embedding-8B4, and skill-specific embedding models, including SkillRet-Embedding-0.6B [3], SkillRouter-Embedding-0.6B [31], SkillReason-Embedding-4B [11].

  • LLM-based retrieval methods: These approaches leverage the reasoning capabilities of LLMs to select the most relevant skills from a top-50 candidate pool initially retrieved by BM25. Specifically, Qwen3-4B5 and DeepSeek-V4-Pro are employed as the retrieval models.

Implementation details. All models are trained and evaluated on a single Linux server equipped with two Intel Xeon Platinum 8350C processors (2.60 GHz), and two NVIDIA A100 80 GB GPUs with CUDA 12.8. We employ GRPO [24] as our reinforcement learning strategy, and both the SFT and GRPO are implemented with the verl framework [25] and vLLM [14]. Specifically, we fine-tune Qwen3-4B and LLaMA3.1-8B6 with LoRA [9] using rank 16 and α=32\alpha=32, applied to all linear layers. The AdamW optimizer is employed with a learning rate of 1×10−41\times10^{-4}, cosine learning-rate decay, a warmup ratio of 0.03, and weight decay of 0.01. The group size GG for GRPO is set to 8, and we train 1 epoch and 2 epochs for SFT and GRPO, respectively. SkillReason-Embedding-4B [11] is set as the default retriever, and retrieves the top-1 skill during training. Alternative retrievers will also be discussed later.

Main Results

We compare Skill-Uni with multiple baselines across the five subsets of SRA-bench, and report their task completion accuracy. For a fair comparison, all baselines employ the same base model for task completion. We also report the performance of Oracle, where the model is provided with a human-annotated golden skill. Specifically, Qwen3-4B and LLaMA3.1-8B are deployed as the base models, respectively. As presented in Table 1 and Table 2, the following key observations can be drawn:

MethodTheoremQALogicBenchCHAMPMedCalc-BenchBigCodeBenchAverage
Base (Qwen3-4B)49.6678.9551.1129.5532.4644.84 (Δbase\Delta_{\mathrm{base}})
Oracle Skill71.8186.8468.8955.9134.2157.43 (↑\uparrow 28.08%)
Lexical Matching Methods
BM2567.1167.1171.1131.3630.2646.85 (↑\uparrow 4.48%)
TF-IDF65.1067.1148.8935.9131.1446.73 (↑\uparrow 4.21%)
Dense Embedding Retrieval Methods
Qwen3-Embedding-4B64.4368.4268.8948.1831.1451.39 (↑\uparrow 14.61%)
Octen-Embedding-8B67.1179.6166.6755.0028.5155.04 (↑\uparrow 22.75%)
SkillRet-Embedding-0.6B63.0971.7166.6754.5529.3952.90 (↑\uparrow 17.98%)
SkillRouter-Embedding-0.6B63.0972.3771.1148.6429.8251.76 (↑\uparrow 15.43%)
SkillReason-Embedding-4B69.8077.6375.5654.5531.5856.42 (↑\uparrow 25.82%)
LLM-based Retrieval Methods
Qwen3-4B63.0971.7168.8951.8232.0253.02 (↑\uparrow 18.24%)
DeepSeek-V4-Pro71.8175.0068.8955.9134.2157.05 (↑\uparrow 27.23%)
Skill-Uni71.8185.5362.2268.6428.0760.45 (↑\uparrow 34.81%)

Table 1. Performance comparison on multiple datasets. The base model is Qwen3-4B. Task accuracy (%) is reported, and the best performance is bold. Improvements in the Average column are measured against the Base model.

MethodTheoremQALogicBenchCHAMPMedCalc-BenchBigCodeBenchAverage
Base (LLaMA3.1-8B)31.5953.4221.5226.8229.2132.51 (Δbase\Delta_{\mathrm{base}})
Oracle Skill47.2668.0342.1560.8229.4749.55 (↑\uparrow 52.41%)
Lexical Matching Methods
BM2539.7657.2423.7735.9128.9537.12 (↑\uparrow 14.18%)
TF-IDF35.7449.6124.6638.4529.3935.57 (↑\uparrow 9.51%)
Dense Embedding Retrieval Methods
Qwen3-Embedding-4B43.6257.2452.7315.5634.6544.58 (↑\uparrow 37.13%)
Octen-Embedding-8B46.3162.5058.6422.2227.1945.97 (↑\uparrow 41.40%)
SkillRet-Embedding-0.6B40.9457.8954.0922.2231.5844.08 (↑\uparrow 35.59%)
SkillRouter-Embedding-0.6B41.6156.5851.3635.5625.4442.19 (↑\uparrow 29.78%)
SkillReason-Embedding-4B44.3070.3958.1842.2232.8949.75 (↑\uparrow 53.03%)
LLM-based Retrieval Methods
Qwen3-4B42.9559.8753.1820.0024.5642.44 (↑\uparrow 30.54%)
DeepSeek-V4-Pro46.9864.4756.3635.5631.5847.86 (↑\uparrow 47.22%)
Skill-Uni55.0384.2162.7335.5628.9554.16 (↑\uparrow 66.59%)

Table 2. Performance comparison on multiple datasets. The base model is LLaMA3.1-8B. Task accuracy (%) is reported, and the best performance is bold. Improvements in the Average column are measured against the Base model.

  • Incorporating skill retrieval leads to clear performance improvements across all datasets and base models. Specifically, both lexical matching and dense embedding retrieval methods outperform direct generation. This finding aligns with prior work [28], confirming that external modular skills can effectively empower models to tackle complex tasks.

  • Dense embedding and LLM-based retrieval methods generally surpass lexical matching baselines. For example, SkillReason-Embedding-4B achieves 56.42% average accuracy in Table 1, largely outperforming BM25 and TF-IDF. This superiority stems from their stronger semantic comprehension, which enables more accurate retrieval of target skills and highlights the necessity of developing advanced skill retrieval strategies.

  • With two different base models, Skill-Uni achieves superior performance across multiple datasets and establishes a new state-of-the-art average accuracy. Remarkably, Skill-Uni outperforms even the Oracle baseline by a noticeable margin in average accuracy (60.45% vs. 57.43% and 54.16% vs. 49.55%). This substantial gain indicates that the benefits of Skill-Uni derive not only from precise skill retrieval, but also from its superior skill utilization.

Ablation Study

To systematically investigate the individual contributions of key components in Skill-Uni, we design five ablation variants: (i) w/o Mask: removing the token mask strategy during SFT and GRPO; (ii) w/o Warm-Start SFT: removing the supervised fine-tuning stage prior to RL; (iii) w/o GRPO: eliminating the reinforcement learning stage and relying solely on SFT; (iv) w/o Generative Retrieval: utilizing the raw input query directly for skill retrieval instead of generating a <rec> field; and (v) Frozen Task Execution: employing a frozen base model instead of Skill-Uni for downstream task execution, without the use of the <answer> field.

As reported in Table 3, after removing the mask strategy during training, the variant only achieves 46.47% accuracy, far behind the full version. Besides, removing either the SFT stage or the GRPO stage leads to a substantial degradation in overall performance. This degradation highlights the complementary nature of the two stages: the SFT stage establishes formatting and reasoning priors for generating <rec> and <answer> fields, while GRPO drives strategy refinement through policy gradients. Furthermore, replacing the generative <rec> field with the raw query or resorting to a frozen task model also incurs notable performance drops. These findings highlight the importance of both accurate skill retrieval and robust skill utilization for successful task completion.

Model VariantsAccuracy
IDmaskSFTGRPO<rec><answer>
1✗✓✓✓✓46.47
2✓✗✓✓✓51.89
3✓✓✗✓✓51.64
4✓✓✓✗✓59.57
5✓✓✓✓✗57.93
Skill-Uni✓✓✓✓✓60.45

Table 3. Ablation study of Skill-Uni. Average task accuracy (%) on five datasets is reported. The base model is Qwen3-4B.

Stratified Performance Analysis

In this section, we conduct a fine-grained stratified analysis to gain deeper insight into model behavior. Specifically, based on query correctness before and after applying a given method, we partition all queries into four distinct groups: (i) Incorrect → Correct, (ii) Correct → Correct, (iii) Correct → Incorrect, and (iv) Incorrect → Incorrect. Figure 4 illustrates the distribution of query counts across these categories for BM25, SkillReason, and Skill-Uni, respectively. The base model is Qwen3-4B.

Stratified performance distributions for BM25, SkillReason, and Skill-Uni

Figure 4. The stratified performance based on query correctness before and after applying a given method.

The results reveal two clear advantages of Skill-Uni. First, it converts the largest number of originally incorrect queries into correct (182), indicating a stronger ability to recover from failures by retrieving and applying useful skills. Second, Skill-Uni produces the fewest Correct → Incorrect cases (61), suggesting that it is less likely to disrupt queries that the model can already solve correctly. This distinction is important because retrieval does not always improve performance: irrelevant or unnecessary skills may introduce distracting information and degrade otherwise correct predictions. We attribute the stronger performance of Skill-Uni to the combination of more accurate skill retrieval and more effective skill utilization, which together help the model introduce external skills when they are beneficial while reducing the effects of irrelevant skill context.

In-depth Analysis

In this part, we further provide a series of in-depth model analyses from the following two perspectives:

The effect of generative skill retrieval. Unlike existing baselines, Skill-Uni introduces a generative retrieval paradigm that actively generates desired skill descriptions within a <rec>...</rec> field to drive skill retrieval. To verify its effectiveness, we compare the embedding distances of original queries versus generated <rec>...</rec> fields against golden skill descriptions, leveraging Qwen3-Embedding-4B for embedding representation. As shown in Figure 5a, the generated <rec>...</rec> fields align markedly closer with the golden skill descriptions in the latent representation space, validating the advantage of the generative skill retrieval mechanism.

Distance distribution of original queries and Skill-Uni retrievals, and reinforcement learning training curves with and without warm-start instruction tuning

Figure 5. The results of in-depth analysis on (a) the effect of generative skill retrieval and (b) the effect of warm start. The base model is Qwen3-4B.

The effect of warm start. In Skill-Uni, we introduce an instruction tuning stage as a warm start prior to GRPO. To analyze the efficacy of this design in Table 3, Figure 5b compares the GRPO training reward curves with and without the warm-start phase. As illustrated, the warm-started model initiates training with a significantly higher reward compared to the cold-start version and ultimately converges to a higher performance. Intuitively, the warm-start phase can teach the model to generate well-structured, high-quality <rec> and <answer> fields. This prior knowledge facilitates successful trajectory rollouts during GRPO, thereby providing more informative training gradients to drive policy optimization.

Robustness Analysis

Robustness to datasets. To evaluate the robustness of Skill-Uni on out-of-distribution datasets, we further conduct experiments on MBPP+ [17] and LiveCodeBench [10]. Specifically, we construct a new retrieval library using skills collected from SkillRetr [3], which comprises approximately 11,085 skills centered on coding and software engineering. In particular, these skills are entirely unseen during our training phase. Since these skills’ domain-specific coding knowledge is highly aligned with the target tasks, they can offer valuable guidance for problem-solving in both benchmarks. As presented in Table 4, Skill-Uni consistently provides notable performance gains for the base model across these OOD benchmarks, demonstrating its robust generalization capabilities in both generative skill retrieval and skill utilization under unseen contexts.

MethodMBPP+LiveCodeBench
Base (Qwen3-4B)55.8217.96
Skill-Uni62.1719.16

Table 4. Performance on OOD datasets

The retrieval accuracy of Skill-Uni with different retrieval engines

Figure 6a. The retrieval accuracy of Skill-Uni with different retrieval engines

The downstream task accuracy of Skill-Uni with different retrieval engines

Figure 6b. The downstream task accuracy of Skill-Uni with different retrieval engines

Robustness to Retrieval Engines. A key advantage of Skill-Uni is that its generative skill retrieval mechanism is agnostic to the underlying retrieval engine. To evaluate this property, we pair Skill-Uni with several retrieval methods, including BM25, Qwen3-Embedding-4B, and SkillReason-Embedding-4B. As shown in Figure 6a and Figure 6b, which illustrate the results on retrieval accuracy and downstream task accuracy, respectively, three observations emerge: 1) Skill-specific retrievers, such as SkillReason-Embedding-4B, generally provide stronger retrieval performance than more generic alternatives. 2) Across different retrieval backends, Skill-Uni consistently improves skill retrieval performance, highlighting the robustness and compatibility of our proposed generative skill retrieval formulation. 3) These retrieval gains, together with improved skill utilization, further translate into consistent improvements in downstream task accuracy across all three retrivers.

The performance analysis of Skill-Uni applied with different retrieval methods

Figure 6. The performance analysis of Skill-Uni applied with different retrieval methods. The base model is Qwen3-4B.

Case Study

To better understand the effectiveness of Skill-Uni, we provide two representative cases in this part, in which Skill-Uni derives correct solutions due to its remarkable capability in both skill retrieval and utilization. Qwen3-4B is set as the base model here.

Case on skill retrieval. As shown in Figure 7, this case demonstrates the decisive role of retrieval precision in enabling successful downstream reasoning. In this task, Skill-Uni employs its generative retrieval mechanism to proactively produce a clear desired skill description, explicitly referencing Stirling numbers of the second kind for partitioning unlabeled subsets. This semantic representation aligns closely with the ground-truth skill, allowing the model to retrieve a skill document containing explicit precomputed value tables

A case in TheoremQA where Skill-Uni retrieves the correct skill while BM25 fails

Figure 7. A case in TheoremQA where Skill-Uni retrieves the correct skill while BM25 fails.

S(10,3)=9330S(10, 3) = 9330 and directly extract the correct numerical answer. Conversely, BM25 relies solely on surface-level term matching from the original prompt. Due to lexical overlap regarding terms like "partition" and "non-empty subsets", BM25 incorrectly retrieves the Lah Numbers skill—an algorithmically irrelevant document addressing ordered list partitions. Lacking the necessary Stirling lookup table, the model can only produce a symbolic expression S(10,3)S(10, 3) rather than a concrete numerical result.

Case on skill utilization. As shown in Figure 8, in this case, both Skill-Uni and BM25 successfully retrieve the identical ground-truth skill Target weight for subsequent question solution. However, their downstream utilization behaviors diverge markedly. Specifically, Skill-Uni demonstrates genuine functional execution by faithfully parsing the target formula (Weight = BMI × height2^{2}) from the skill documentation and performing the arithmetic computation to yield the exact answer (73.07 kg). In contrast, BM25 succumbs to superficial pattern imitation: rather than executing the underlying mathematical logic, it only formally copies the TOOL_CALL and TOOL_RESULT template provided in the skill’s example and hallucinates an incorrect output (59.1664). This contrast verifies Skill-Uni’s superior capability in skill comprehension and utilization.

A case in MedCalc-Bench where both BM25 and Skill-Uni retrieve the golden skills, while only Skill-Uni derives the correct solution

Figure 8. A case in MedCalc-Bench where both BM25 and Skill-Uni retrieve the golden skills, while only Skill-Uni derives the correct solution.

Conclusion

In this paper, we propose Skill-Uni, a unified reinforcement learning framework that jointly optimizes skill retrieval and utilization for skill-augmented generation. By adopting a generative skill retrieval paradigm, Skill-Uni unifies these two processes within a single model, overcoming the limitations of conventional approaches that optimize them separately. To effectively train this framework, we introduce a two-stage training strategy combining warm-up instruction tuning and GRPO, enabling the model to improve both skill retrieval and downstream task-solving capabilities. Extensive experiments on five skill-related benchmarks show that Skill-Uni achieves state-of-the-art performance, with the highest skill retrieval accuracy and strong compatibility with different retrieval engines. In-depth model analysis also highlights the importance of the warm-up stage and generative skill retrieval.

References

  1. [1]Chui Chen, Jiaye Lin, Te Sun, Junxi Wang, Yi Yang, Cong Qin, Yangen Hu, Lu Pan, and Ke Zeng. 2026. Skill or Skip? Learning Selective Skill Invocation in Agentic Tasks via Dual-Granularity Preference Learning. In Findings of the 2026 Conference on Empirical Methods in Natural Language Processing, EMNLP 2026.
  2. [2]Wenhu Chen, Ming Yin, Max Ku, Pan Lu, Yixin Wan, Xueguang Ma, Jianyu Xu, Xinyu Wang, and Tony Xia. 2023. TheoremQA: A Theorem-driven Question Answering Dataset. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, EMNLP 2023.arxiv.org/abs/2305.12524
  3. [3]Hongcheol Cho, Ryangkyung Kang, and Youngeun Kim. 2026. SkillRet: A Large-Scale Benchmark for Skill Retrieval in LLM Agents. CoRR abs/2605.05726 (2026). arXiv:2605.05726 doi:10.48550/ARXIV.2605.05726DOI
  4. [4]Jaewon Chu, Ji Lew Jiwhan Park, Dohwan Ko, Jaehye Na, Seunghun Lee, Tae-hoon Lee, Minseo Yoon, Minseok Joo, Yunyang Xiong, and Hyunwoo Kim. 2026. Retrieval-Augmented Skill Optimization via Cross-Harness Adaptation. CoRR abs/2609.38024 (09 2026).
  5. [5]DeepSeek-AI. 2025. DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning. CoRR abs/2501.12948 (2025). doi:10.48550/ARXIV.2501.12948DOI
  6. [6]Qian Dong, Qingyao Ai, Hongning Wang, Yiding Liu, Haitao Li, Weihang Su, Yiqun Liu, Tat-Seng Chua, and Shaoping Ma. 2025. Decoupling Knowledge and Context: An Efficient and Effective Retrieval Augmented Generation Framework via Cross Attention. In Proceedings of the ACM on Web Conference 2025, WWW 2025. 4386–4395.DOI
  7. [7]Zirui Guo, Lianghao Xia, Yanhua Yu, Tu Ao, and Chao Huang. 2025. LightRAG: Simple and Fast Retrieval-Augmented Generation. In Findings of the 2025 Conference on Empirical Methods in Natural Language Processing, EMNLP 2025. 10746–10761.
  8. [8]Tingxu Han, Yi Zhang, Wei Song, Chunrong Fang, Zhenyu Chen, Youcheng Sun, and Lijie Hu. 2026. SWE-Skills-Bench: Do Agent Skills Actually Help in Real-World Software Engineering? CoRR abs/2603.15401 (2026). doi:10.48550/ARXIV.2603.15401DOI
  9. [9]Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. 2022. LoRA: Low-Rank Adaptation of Large Language Models. In Proceedings of the 10th International Conference on Learning Representations, ICLR 2022.arxiv.org/abs/2106.09685
  10. [10]Naman Jain, King Han, Alex Gu, Wen-Ding Li, Fanjia Yan, Tianjun Zhang, Sida Wang, Armando Solar-Lezama, Koushik Sen, and Jon Stoica. 2025. Live-CodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code. In Proceedings of the 13th International Conference on Learning Representations, ICLR 2025.DOI
  11. [11]Donghong Jiang, Endrian Lin, Luoping Cui, Hanqing Liu, Mingjie Liu, Fan Yang, Hong Wang, Zhao Yang, and Chuang Zhu. 2026. SkillReason: Reasoning-Enhanced Agent Skill Retrieval for Implicit User Requests. CoRR abs/2608.08640 (2026). doi:10.48550/ARXIV.2608.08640DOI
  12. [12]Bowen Jin, Hansi Heng, Zhenrui Yue, Jingsong Yoon, Sercan O Arik, Dong Wang, Hamed Zamani, and Jiawei Han. 2025. Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning. In Proceedings of the 2nd Conference on Language Modeling, COLM 2025.
  13. [13]Nikhil Khandekar, Qiao Jin, Guangzhi Xiong, Soren Dunn, Serina S. Applebaum, Zain Anwar, Maame Sarfo-Gyamfi, Conrad W. Safranek, Abid A Anwar, Andrew Zhang, Aidan Gilson, Maxwell B. Singer, Amisha D. Dave, Andrew Taylor, Aidong Zhang, Qingyu Chen, and Zhiyong Lu. 2024. MedCalc-Bench: Evaluating Large Language Models for Medical Calculations. In Advances in Neural Information Processing Systems 37, NeurIPS 2024.arxiv.org/abs/2406.12036
  14. [14]Woosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng, Lianmin Zheng, Cody Hao Yu, Joseph Gonzalez, Hao Zhang, and Ion Stoica. 2023. Efficient Memory Management for Large Language Model Serving with PagedAttention. In Proceedings of the 29th Symposium on Operating Systems Principles, SOSP 2023. ACM, 611–626.arxiv.org/abs/2309.06180
  15. [15]Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich Kuttler, Mike Lewis, Wen-tau Yih, Tim Rocktäschel, Sebastian Riedel, and Douwe Kiela. 2020. Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks. In Advances in Neural Information Processing Systems 33, NeurIPS 2020.
  16. [16]Xiangyi Li, Wenbo Chen, Yimin Liu, Shenghan Zheng, Xiaokun Chen, Yifeng He, Yubo Li, Bingran You, Haotian Shen, Jiankai Sun, Shuyi Wang, Qunhong Zeng, Di Wang, Xuandong Zhao, Yuanli Wang, Roey Ben Chaim, Zonglin Di, Yipeng Gao, Junwei He, Yizhuo He, Liqian Jing, Luyang Kong, Xin Lan, Jiachen Li, Songlin Li, Yijiang Li, Yueqian Lin, Xinyi Liu, Xuanqing Liu, Haoran Lyu, Ze Ma, Bowei Wang, Runhui Wang, Tianfu Wang, Wengao Ye, Yue Zhang, Hanwen Xing, Yiqi Xue, Steven Dillmann, and Han-Chung Lee. 2026. SkillsBench: Benchmarking How Well Agent Skills Work Across Diverse Tasks. CoRR abs/2602.12670 (2026). doi:10.48550/ARXIV.2602.12670DOI
  17. [17]Jiawei Liu, Chunqiu Steven Xia, Yuyao Wang, and Lingming Zhang. 2023. Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation. In Advances in Neural Information Processing Systems 36, NeurIPS 2023.arxiv.org/abs/2305.01210
  18. [18]Weiwen Liu, Xu Huang, Xingshan Zeng, Xinlong Hao, Shuai Yu, Dexun Li, Shuai Wang, Weinan Gan, Zhengying Liu, Yuanqing Yu, Zezhong Wang, Yuxuan Wang, Wu Ning, Yutai Hou, Bin Wang, Chuhan Wu, Xinzhi Wang, Yong Liu, Yasheng Wang, Duyu Tang, Dandan Tu, Lifeng Shang, Xin Jiang, Ruiming Tang, Defu Lian, Qun Liu, and Enhong Chen. 2025. ToolACE: Winning the Points of LLM Function Calling. In Proceedings of the 13th International Conference on Learning Representations, ICLR 2025.
  19. [19]Zhengxi Lu, Zhiyuan Yao, Jinyang Wu, Chengcheng Han, Qi Gu, Xunliang Cai, Weiming Lu, Jun Xiao, Yueting Zhuang, and Yongliang Shen. 2026. SkillLLM: In-Context Agentic Reinforcement Learning for Skill Internalization. CoRR abs/2604.02268 (2026). doi:10.48550/ARXIV.2604.02268
  20. [20]Zihan Luo, Lingkui Chen, Ruike Zhang, Hong Huang, Boyang Zhang, Ziniu Chen, Lizhong Wang, and Chao Chen. 2026. ToolRec: Calibrated Preference Alignment for Query Recommendation in On-Device Assistants. CoRR abs/2606.08466 (2026). arXiv:2606.08466 doi:10.48550/ARXIV.2606.08466DOI
  21. [21]Yujun Mao, Yoon Kim, and Yilun Zhou. 2024. CHAMP: A Competition-level Dataset for Fine-Grained Analyses of LLMs’ Mathematical Reasoning Capabilities. In Findings of the 62nd Annual Meeting of the Association for Computational Linguistics, ACL 2024. 13256–13274.arxiv.org/abs/2401.06961
  22. [22]Mihir Parmar, Nisarg Patel, Neeraj Varshney, Mutsumi Nakamura, Man Luo, Santosh Masetty, Arindam Mitra, and Chitta Baral. 2024. LogicBench: Towards Systematic Evaluation of Logical Reasoning Ability of Large Language Models. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics, ACL 2024. 13679–13707.arxiv.org/abs/2404.15522
  23. [23]John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal Policy Optimization Algorithms. CoRR abs/1707.06347 (2017). arXiv:1707.06347arxiv.org/abs/1707.06347
  24. [24]Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Mingchuan Zhang, Y. K. Li, Y. Wu, and Daya Guo. 2024. DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models. CoRR abs/2402.03300 (2024). arXiv:2402.03300 doi:10.48550/ARXIV.2402.03300
  25. [25]Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xijin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Hai Lin, and Chuan Wu. 2025. HybridFlow: A Flexible and Efficient RLHF Framework. In Proceedings of the 12th European Conference on Computer Systems, EuroSys 2025. ACM, 1279–1297.DOI
  26. [26]Yaorui Shi, Yuxin Chen, Zhengxiu Lu, Yuchun Miao, Shugui Liu, Qi Gu, Xunliang Cai, Xiang Wang, and An Zhang. 2026. Skill: Unified Evolution of Skill-Augmented Agents via Reinforcement Learning. CoRR abs/2605.06130 (2026). doi:10.48550/ARXIV.2605.06130
  27. [27]Karen Sparck Jones. 1988. A Statistical Interpretation of Term Specificity and Its Application in Retrieval. Taylor Graham Publishing, GBR, 132–142.
  28. [28]Weihang Su, Jianming Long, Qingyao Ai, Yichen Tang, Changyue Wang, Yiteng Tu, and Yiqun Lieu. 2026. Skill Retrieval Augmentation for Agentic AI. In Findings of the 2026 Conference on Empirical Methods in Natural Language Processing, EMNLP 2026.
  29. [29]Jiangxiao Wang, Qiaojing Yan, Yawei Wang, Yijun Tian, Soumya Smruti Mishra, Zhichao Xu, Megha Gandhi, Panpan Xu, and Lin Lee Cheong. 2026. Reinforcement Learning for Self-Improving Agent with Skill Library. In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics, ACL 2026. 1529–1550.
  30. [30]Zizhao Wang, Jiaheng Hu, Caleb Chuck, Stephen Chen, Roberto Martín-Martín, Amy Zhang, Scott Niekum, and Peter Stone. 2024. Skill:ID: Unsupervised Skill Discovery Guided by Factor Interactions. In Advances in Neural Information Processing Systems 37, NeurIPS 2024.arxiv.org/abs/2410.18416
  31. [31]Yanzhang Zheng, Zhentao Zhang, Chao Ma, Yuanqiang Yu, Jihui Zhu, Yong Wu, Tianze Xu, Baohua Dong, Hangcheng Zhu, Ruohui Huang, and Gang Yu. 2026. SkillRouter: Skill Routing for LLM Agents at Scale. In Proceedings of the 3rd Conference on Language Modeling, COLM 2026.arxiv.org/abs/2603.22455
  32. [32]Luyao Zhuang, Shengyuan Chen, Yilin Xiao, Huachi Zhou, Yujing Zhang, Hao Chen, Qinggang Zhang, and Xiao Huang. 2026. LinearRAG: Linear Graph Retrieval Augmented Generation on Large-scale Corpora. In Proceedings of the 14th International Conference on Learning Representations, ICLR 2026.arxiv.org/abs/2510.10114
  33. [33]Terry Yue Zhuo, Minh Chien Vu, Jenny Chim, Han Hu, Wenhao Yu, Ratnadira Widyasari, Imam Nur Bani Yusuf, Haolan Zhan, Junda He, Indraneil Paul, Simon Brunner, Chen Gong, James Hoang, Armel Randy Zebaze, Xiaoheng Hong, Wen-Ding Li, Jean Kaddour, Ming Xu, Zhihan Zhang, Prateek Yadav, and et al. 2025. BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructions. In Proceedings of the 13th International Conference on Learning Representations, ICLR 2025.arxiv.org/abs/2406.15877

Paper details

vlnc:W_fz83jc88
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

Not recorded for this paper · View statement →

Looking for related papers…
Contents