Search arXiv⌕ Search

arXiv · 2610.24229

Training-Free Prompt Selection for Efficient Reinforcement Learning With Partial Rollouts

Abstract

Reinforcement learning with verifiable rewards (RLVR) has emerged as a prominent paradigm for training reasoning models, but its computational cost makes efficient data selection increasingly important. Since training examples contribute unequally to learning, selecting a small, informative subset can offer a more efficient alternative to using the entire data pool. The training-free selection method estimates prompt value with hidden states from complete greedy rollouts. However, in our datasets, $26$--$32\%$ of these rollouts fail to terminate within the generation budget. We introduce LIFT, a training-free data selector that identifies impactful prompts using only partial reasoning rollouts. At its core, LIFT uses Partial Rollout Context Lift (PRCL), a score inspired by pointwise $\mathcal{V}$-information that accumulates token-level log-likelihood ratios between a question-conditioned context and a null context with the question removed. This enables prompt scoring from a short rollout prefix rather than a complete trajectory. Across Qwen2.5-Math-1.5B and DeepSeek-R1-Distill-1.5B, prefixes retaining at least 90\% and 95\% of the full-rollout PRCL score, respectively, require only 26\% and 4.7\% of the tokens generated by full rollouts. Compared with SHIFT, LIFT reduces selection cost by 3.7--9.1$\times$ while achieving competitive downstream RLVR performance, with the highest six-benchmark average in three of six settings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lei Jiang, Honghui Bao, Yue Zhou, Zhengyao Gu, Langzhou He, Natalie Parde. 2026-10-16. Training-Free Prompt Selection for Efficient Reinforcement Learning With Partial Rollouts. https://arxiv.org/abs/2610.24229

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Agent-OM: Leveraging LLM Agents for Ontology Matching

Ontology matching (OM) enables semantic interoperability between different ontologies and resolves their conceptual heterogeneity by aligning related entities. OM systems currently have two prevailing design paradigms: conventional knowledge-based expert systems and newer machine learning-based predictive systems. While large language models (LLMs) and LLM agents have revolutionised data engineering and have been applied creatively in many domains, their potential for OM remains underexplored. This study introduces a novel agent-powered LLM-based design paradigm for OM systems. With consideration of several specific challenges in leveraging LLM agents for OM, we propose a generic framework, namely Agent-OM (Agent for Ontology Matching), consisting of two Siamese agents for retrieval and matching, with a set of OM tools. Our framework is implemented in a proof-of-concept system. Evaluations of three Ontology Alignment Evaluation Initiative (OAEI) tracks over state-of-the-art OM systems show that our system can achieve results very close to the long-standing best performance on simple OM tasks and can significantly improve the performance on complex and few-shot OM tasks.

cs.AI↗

OM4OV: Leveraging Ontology Matching for Ontology Versioning

Due to the dynamics of the Semantic Web, version control is necessary to manage changes in widely used ontologies. Despite the long-standing recognition of ontology versioning (OV) as a crucial component of efficient ontology management, many approaches treat OV as similar to ontology matching (OM) and directly reuse OM systems for OV tasks. In this study, we systematically analyse similarities and differences between OM and OV and formalise an OM4OV framework to offer more advanced OV support. The framework is implemented and evaluated in the state-of-the-art OM system Agent-OM. The experimental results indicate that OM systems can be effectively reused for OV tasks, but without the necessary extensions, can produce skewed measurements, poor performance in detecting update entities, and limited explanations of false mappings. To tackle these issues, we propose an optimisation method called the cross-reference (CR) mechanism, which builds on existing OM alignments to reduce the number of matching candidates and to improve overall OV performance.

cs.AI↗

SELECT: Semantic Erasure Boundary Construction with Sibling Exclusive Counterfactuals

Concept erasure aims to suppress undesirable concepts in text-to-image diffusion models while preserving their generative capabilities. Existing methods often redirect target concepts toward predefined semantic anchors, but the influence of anchor selection on the scope of concept erasure remains insufficiently understood. Through causal tracing, we reveal that concepts with more dispersed causal effects tend to exhibit higher anchor sensitivity and lower erasure robustness. Controlled anchor interventions demonstrate that anchor selection affects target suppression and collateral damage to surrounding semantic concepts. These findings motivate us to formulate anchor selection as semantic erasure boundary construction. We propose SELECT (Selective Erasure via Local Exclusive Counterfactual Targets), a plug-and-play framework based on Sibling Exclusive Concepts (SECs), which are semantically close to the target but mutually exclusive in its defining attributes. SELECT jointly constructs a counterfactual redirection endpoint and a local retention set to balance target suppression and semantic preservation. SELECT filters candidates using contextual activation, and uses semantic coherence to identify context compatible redirection endpoints, while the remaining SECs serve as local preservation constraints. Experiments on object, celebrity, artist-style, and NSFW erasure show that SELECT strengthens target suppression over fixed general anchors and achieves suppression-preservation trade-offs, while reducing concept re-emergence and erosion.

cs.AI↗