paper-with-me

Papers

Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier

2026-06-10 · Lorenz Wolf, Connor Watts, Roger Creus Castanyer, Geoffrey Bradway, Maxwill Lin, Augustine N. Mavor-Parker, Matthew Daborn-Sargent arxiv

The limiting resource for training agents via reinforcement learning (RL) is increasingly frontier task supply: valid, solvable tasks just difficult enough to train the current model. As reasoning and agentic models improve, fixed task distributions saturate, while naive synthetic generation yields tasks that are trivial, impossible, or ill-posed. Training a task generator with RL to optimize validity and learnability can address this bottleneck, but direct optimization requires repeated solver rollouts per candidate. For software-engineering (SWE) tasks, a single rollout can take tens of minutes; solver-in-the-loop generator training is intractable. We introduce PROPEL, a solver-amortized framework for training task generators at the targeted solve rate. PROPEL trains a lightweight activation probe on a one-time labeled corpus of generated tasks and solver outcomes. The probe predicts target-solver pass rate from a frozen generator reference model and serves as a proxy for solve rate during generator optimization, reducing generator evaluation to a single forward pass. Across math, code, and software-engineering at multiple model scales, PROPEL shifts generation toward the targeted solve rate: for coding, tasks generated at the learnable frontier increase from $10.1\% \rightarrow 20.0\%$ for a Qwen2.5-3B-Instruct solver and from $5.3\% \rightarrow 12.6\%$ for a Qwen2.5-7B-Instruct solver. For SWE, PROPEL increases the share of generations at the targeted solve rate from $9.8\% \rightarrow 19.6\%$ for Qwen3.5-27B on repositories not seen during training of probe and generator.

📄 PDF Abstract BibTeX arXiv:2606.18284

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Once4All: Skeleton-Guided SMT Solver Fuzzing with LLM-Synthesized Generators

2025-08-28 · Maolin Sun, Yibiao Yang, Yuming Zhou arxiv

Satisfiability Modulo Theory (SMT) solvers are foundational to modern systems and programming languages research, providing the foundation for tasks like symbolic execution and automated verification. Because these solve…

EALG: Evolutionary Adversarial Generation of Language Model-Guided Generators for Combinatorial Optimization

2025-06-03 · Ruibo Duan, Yuxin Liu, Xinyao Dong, Chenglin Fan

Generating challenging instances is crucial for the evaluation and advancement of combinatorial optimization solvers. In this work, we introduce EALG (Evolutionary Adversarial Generation of Language Model-Guided Generato…

Combinatorial OptimizationLanguage ModelingLanguage Modelling

ARC-TGI: Human-Validated Task Generators with Reasoning Chain Templates for ARC-AGI

2026-03-05 · Jens Lehmann, Syeda Khushbakht, Nikoo Salehfard, Nur A Zarin Nishat 외 arxiv

The Abstraction and Reasoning Corpus (ARC-AGI) probes few-shot abstraction and rule induction on small visual grids, but progress is difficult to measure on static collections of hand-authored puzzles due to overfitting,…

Video Game Level Design as a Multi-Agent Reinforcement Learning Problem

2025-10-06 · Sam Earle, Zehua Jiang, Eugene Vinitsky, Julian Togelius arxiv

Procedural Content Generation via Reinforcement Learning (PCGRL) offers a method for training controllable level designer agents without the need for human datasets, using metrics that serve as proxies for level quality …

Multi-agent Reinforcement Learning

Faster Symmetry Breaking Constraints for Abstract Structures

2025-11-14 · Özgür Akgün, Mun See Chang, Ian P. Gent, Christopher Jefferson arxiv

In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level modelling languages such as Essence, a model…