arXiv AI By Haoyi Yang, Kshitij Mishra, Nils Lukas, Salem Lahlou

Selection Is Not Learning: Choosing Model Futures

Read the original on arXiv AI →

The paper introduces new methods for deciding which self‑evolving language model updates to keep. HeirCommit freezes each updated model and evaluates it on fresh questions before deciding to inherit it, while EvoHeir separates parameter inheritance from experience inheritance to repair failures and preserve successes. These techniques reduce harmful updates and improve performance on mathematics and general‑reasoning tasks compared to existing loops such as R‑Zero, Agent0, and Skill Self‑Play.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 12

EvoBelief: Falsifiable World Models for Self-Improving LLM Agents

EvoBelief is a self‑evolving world model that represents environment knowledge as falsifiable hypotheses, allowing an LLM agent to update its beliefs during deployment. The system generates hypotheses when unexpected outcomes or unknowns arise, validates them through observations and controlled experiments, and then uses the confirmed rules to guide predictions or plans. Across benchmarks such as ALFWorld, MiniGrid, and DiscoveryWorld, EvoBelief improves task performance, revises stale rules, and discovers quantitative laws, outperforming baseline frozen world models.

By Janet Wang, Jiang Guo, Yi Xiang, Jiaqing Yuan, Mingwen Dong, Hideo Kobayashi, Shuaichen Chang, Chandan K. Reddy, Jiarong Jiang
arXiv AI
Sep 30

Learn Now, Use Next, Trust Later: Prequential Test-Time Learning for LLM Agents

The paper introduces StepLearn, a nonparametric framework for prequential test‑time learning in large language model agents. StepLearn separates immediate use of informative transitions from persistent trust, turning each transition into a hypothesis that guides the next step and only reusing it after prospective validation across episodes. Experiments on WebArena‑Lite and ALFWorld show StepLearn improves success rates by 2.2–12.7 percentage points over the strongest baseline, with benefits evident from the first task attempts.

By Tong Zhao, Reed Li, Yuyang Hu, Yutao Zhu, Haijin Liang, Haibo Shi, Yu Lu, Zhicheng Dou
arXiv Machine Learning
Oct 9

From a Prompt to Repertoires: Evolving Functional REpertoires Enable LLM Continual Learning

The paper introduces Evolving Functional REpertoires (EFRE), a method that replaces a single prompt with a dynamic set of functions to enable large language models to learn new tasks sequentially without forgetting. EFRE refines existing functions when updates are compatible and creates new ones when updates conflict, thereby mitigating catastrophic forgetting and overfitting. Experiments on a three‑task continual‑learning stream show EFRE outperforms GRPO by 7.50 percentage points and reduces performance drop on a subsequent task by only 1.56 percentage points compared to base prompt optimization.

By Fengyuan Liu, Yue Wang, Hangxi Guo, Fengyuan Liu, Chenxu Wu, Yanguang Liu, Mengnan Du
arXiv AI
Aug 3

Self-Play Meets Skill Evolution: Self-Evolving Search Agents that Pose, Solve, and Remember

arXiv:2607. 29468v1 Announce Type: new Abstract: Self-play agents can generate training problems without questions from target benchmarks, but their curricula lack persistent state: failures affect gradients yet do not explicitly shape future practice.

By Zenghuang Fu, Zhaoyang Li, Qiuyuan Ai, Haoyu Wu, Minghui Wu, Chenxu Zhao, Ante Wang, Guannan He, Changwei Wang
arXiv Machine Learning
3d ago

Not All Change Is Damage: Update-Matched Unlearning for Large Language Models

The paper introduces Update‑Matched Unlearning (UMU), a method that applies the same simulated relearning update to both a defended model and an undefended reference to better preserve plasticity while resisting relearning of deleted knowledge. Experiments on Llama and Qwen models with TOFU and FaithUn datasets show that UMU reduces harmful and benign relearning by 30.4 and 9.9 points on average and increases new‑task accuracy by 3.5 points, supporting the reference‑timing hypothesis. The study demonstrates that robust unlearning should selectively prevent recovery of deleted knowledge without suppressing the model’s ability to learn new tasks.

By Jie Li, Youming Tao, Bowei He, Meng Ding
Hugging Face Trending Papers
Sep 28

Shockingly Simple Self-retrospection Improves Agentic Models Without RL

The paper explores Retrospection-Only Fine-Tuning (ROFT), a method where a language-model agent improves its behavior by generating and training on explanations of its own experiences, without external teachers or reward signals. In software‑engineering tasks with Qwen3.5‑4B, ROFT achieves comparable or better solve rates than GRPO while requiring fewer updates and training time, and can learn from failures alone. Behavioral analysis shows ROFT indirectly assigns credit to actions and can produce shorter, more direct solutions when prompted to focus on direct solutions.