A-RSI: Adaptive Task Refresh for Zero-Data Multimodal Self-Improvement

Yu Liu, Youxing Li, Yuedong Tan, Zhiwei Yang, Zihan Su, Hanqi Feng, Shaojie Zhang, Libin Liao and 12 others

Institute of Information Engineering, CAS · The Chinese University of Hong Kong · Universität Würzburg · Xiaomi · Harvard University · Carnegie Mellon University

Published October 28, 2026 · on the feed October 30, 2026 · ▲ 85 · arXiv 2610.38568

AgentsVision & multimodalCode & software No code arXiv ↗Hugging Face ↗

The abstract

Recursive self-improvement requires models not only to acquire useful training experience, but also to decide when their current experience has ceased to be useful. Existing methods often focus on what experience to generate next, while paying less attention to when fresh experience should be introduced. Many also construct training targets through self-consistency or majority voting, making supervision depend on the model's own uncertain predictions. We address these two questions separately: training dynamics determine when to acquire new experience, while the answers to new tasks remain independently checkable. A-RSI monitors reward variation and accuracy in training logs to refresh a task pool when its learning signal declines, without consulting validation or test scores. A static library of model-authored programs produces multimodal questions and derives their reference answers; we specify the task-generation contract, automatically verify chosen properties of the reward and refresh rules, and separately audit the generated answers. The training loop uses no external training examples or human-written answer labels. On the primary eleven-benchmark suite, A-RSI raises the performance average from 57.77 to 61.05 with 800 fresh tasks.

The Brief

2:09

A short podcast summary of the paper. Written and voiced by AI.

Transcript

A-RSI. Adaptive Task Refresh for Zero-Data Multimodal Self-Improvement. By Yu Liu and nineteen others, from the Institute of Information Engineering of the Chinese Academy of Sciences, the Chinese University of Hong Kong, and seven other institutions. Published on the twenty-eighth of October.

Recursive self-improvement asks a model to do two things. It has to acquire useful training experience, and it has to decide when the experience it already has has stopped being useful. Existing methods tend to concentrate on the first question, what experience to generate next, and pay less attention to the second, when fresh experience should come in. There is a further weakness. Many of them build their training targets through self-consistency or majority voting, which means the supervision rests on the model's own uncertain predictions.

A-RSI pulls these two questions apart and answers each separately. Training dynamics decide when to acquire new experience. The answers to new tasks, on the other hand, stay independently checkable, rather than being voted into existence by the model that is learning from them.

For the timing question, A-RSI watches reward variation and accuracy in the training logs, and refreshes its task pool when the learning signal from that pool declines. It does this without ever consulting validation or test scores. For the supervision question, a static library of model-authored programs produces multimodal questions and derives their reference answers. The authors specify the contract that task generation must follow, automatically verify chosen properties of the reward and refresh rules, and separately audit the answers that get generated. Throughout, the training loop uses no external training examples and no human-written answer labels.

The headline result is on the primary suite of eleven benchmarks. There, A-RSI raises the performance average from fifty-seven point seven seven to sixty-one point zero five, using eight hundred fresh tasks.

Two decisions usually tangled together are kept distinct here. When to bring in new tasks is read off the training logs alone, never off held-out scores. What counts as a correct answer comes from programs whose outputs can be checked, not from the model agreeing with itself. That separation is the whole design, and it lets a self-improving loop run with zero external data while keeping both its schedule and its targets accountable.

Paper Quest · 7 chapters · about 41 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

A model teaching itself has to know when its lessons have gone stale.

You want a vision-language model to improve itself with no outside training data. It trains on a pool of self-made tasks, but after a while that pool stops teaching it much. When should fresh tasks come in?

The road ahead

  1. 1 · The problem ~7 min A model that trains itself on its own tasks must know when those tasks stop teaching, and where trustworthy answers come from.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Let training logs decide when to refresh the task pool, and let the programs that build each task compute its answer.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Programs make tasks and their answers, the model trains on a pool, and logs decide when to swap in a fresh pool.
  6. 6 · The experiment ~6 min You’ll guess: Starting from an average of 57.77 on eleven benchmarks, what happened to A-RSI's score after 800 fresh tasks?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.