General learned delegation by clones

Darren Li, Meiqi Chen, Chenze Shao, Fandong Meng, Jie Zhou
2/3/2026
cs.AIcs.CL

No official code found. Best implementation: SuffixAutomata/SELFCEST (0 stars, Apache-2.0, last commit 2026-02-03).

Abstract

Frontier language models improve with additional test-time computation, but serial reasoning or uncoordinated parallel sampling can be compute-inefficient under fixed inference budgets. We propose SELFCEST, which equips a base model with the ability to spawn same-weight clones in separate parallel contexts by agentic reinforcement learning. Training is end-to-end under a global task reward with shared-parameter rollouts, yielding a learned controller that allocates both generation and context budget across branches. Across challenging math reasoning benchmarks and long-context multi-hop QA, SELFCEST improves the accuracy-cost Pareto frontier relative to monolithic baselines at matched inference budget, and exhibits out-of-distribution generalization in both domains.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Code for General learned delegation by clones, based off of verl

00Jinja, ShellDec 13, 20258 months agoApache-2.0

Similar Papers

Cite this paper

@article{li2026general,
  title  = {General learned delegation by clones},
  author = {Darren Li and Meiqi Chen and Chenze Shao and Fandong Meng and Jie Zhou},
  year   = {2026},
  eprint = {2602.13262},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.13262v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.13262.svg)](https://codeofpaper.com/paper/2602.13262)

Discussion