MLE-World is a world model fine‑tuned from Qwen3.5‑4B that predicts the terminal output of a machine learning program—such as error traces, training logs, and validation scores—directly from its code and data description, without executing the program. It also provides a confidence score indicating the likelihood that the prediction is correct. Using these predictions, the authors design five test‑time‑scaling policies that compare multiple candidate programs per step, executing only those with low confidence, and demonstrate that MLE‑World matches real outputs on 77.9% of held‑out programs and improves agent performance by up to 22.1% with fewer real executions.
By Brian Ko, Han Wang, Hejia Geng, Li Erran Li, Sherry Yang
Large language model (LLM) agents now fix software, operate computers and serve customers, but their harnesses, the programs that run them, call a large LLM at every step, which makes long tasks slow...
arXiv:2607. 00164v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards can in principle train calibrated probabilistic forecasters, since a proper scoring rule such as the Brier score is computed from outcomes alone and is minimized in expectation by the true probability.
By Sadanand Singh, Allam Reddy, Manan Chopra
StoreBench is a live‑commerce environment where an autonomous agent runs a mid‑size online apparel store on a production‑grade backend, facing continuous customer orders, supplier price changes, and market shocks. The agent uses the same 29 merchant tools as a human operator, with a windowed operation budget that ties simulated time to actions, ensuring that model latency does not affect the simulation. Seven large language models were evaluated across 11 scenarios of 30–45 days and a full simulated year, but none matched the scripted smart‑triage policy, and human experts outperformed all models.
By Daksh Raghuvanshi, Ved Vedere, Yifan Wang
arXiv:2610.18760v1 Announce Type: new
Abstract: Test-time scaling for large language models (LLMs) can involve generating multiple candidate solutions for selection or revising an earlier attempt. To...
By Zheye Deng, Sha Li, Changlong Yu, Xin Liu, Qin Lu, Priyanka Nigam, Yangqiu Song
arXiv:2607. 05904v1 Announce Type: new Abstract: Training a language model against its own reference-free judgments (the premise of self-rewarding, self-play, and LLM-as-a-judge pipelines) assumes a model's verdict on a shown answer tracks correctness.
By Chenyu Zhou
JevAgentHarness is a new framework that benchmarks, deploys, and trains decision models to share control with large language models (LLMs) in agentic tasks. It introduces AgentDecisionBench to evaluate decision models from isolated questions to full agent control, revealing that accurate isolated decisions still miss many tasks and that naïve delegation can reduce success. By fitting confidence thresholds per choice and training a 4B decision model on states after agent mistakes, JevAgentHarness achieves high task success while cutting cost and speeding up execution, with results and resources made publicly available.
By Kunlun Zhu, Tao Feng, Xu Han, Heng Wang, Ling Yang, Xiangru Tang, Jiaxuan You, Heng Ji
arXiv:2608. 09168v1 Announce Type: new Abstract: Agent skills are increasingly used to equip large language model (LLM) agents with reusable procedural knowledge.
By Liang He, Jingbo Wen, Hongyu Gu, Hao Li, Haoyu Wang, Yixiong Chen, Kangning Cui, Xilu Wang
CausalDreamer enhances generative world models by freezing the original video tokenizer and re-encoding its latent space into a factored representation that separates controllable versus uncontrollable dynamics and reward-relevant versus reward-irrelevant information. The pretrained dynamics model is fine‑tuned to predict this factored representation, enabling more accurate model‑predictive planning. On the MMBench2 benchmark, CausalDreamer improves normalized scores by 14% on clean tasks and 25% on manipulated variants compared to the baseline, while both models perform poorly on entirely new environments.
By Prince Jha, Nils Lukas, Kun Zhang, Salem Lahlou
arXiv:2610.34500v1 Announce Type: new
Abstract: Data curation is a first-order design choice in machine learning, yet tailoring training data to a downstream model and task remains costly in labor, e...
By Hanze Li, Athan Z. Li, Feiyang Kang, Jiachen T. Wang, Yuhan Chen, Ruishan Liu, Ruoxi Jia
arXiv:2606. 27291v1 Announce Type: new Abstract: Job-search platforms rely on low-bandwidth query interfaces that often fail to capture the high-dimensional complexity of candidate profiles.
By Ping Liu, Qianqi Shen, Jianqiang Shen, Wenqiong Liu, Rajat Arora, Yunxiang Ren, Chunnan Yao, Dan Xu, Baofen Zheng, Wanjun Jiang, Andrii Soviak, Kevin Kao, Jingwei Wu, Wenjing Zhang
AgentRM proposes a generalizable reward model to guide LLM-based agents during test-time search, outperforming direct policy fine-tuning. Three reward modeling strategies—explicit, implicit, and LLM-as-a-judge—are explored, and AgentRM improves base policy performance by an average of 8.8 points across nine tasks, surpassing top general agents by 4.0 points. It also shows strong weak-to-strong generalization and can boost specialized agents, with plans to release code for further research.
By Yu Xia, Jingru Fan, Weize Chen, Siyu Yan, Xin Cong, Zhong Zhang, Yaxi Lu, Yankai Lin, Zhiyuan Liu, Maosong Sun