arXiv AI By Haechan Kim, Yoonho Lee, Gisang Lee, Chelsea Finn, Kangwook Lee

WHALE: A Simple Recipe for Joint Harness-Weight Optimization

Read the original on arXiv AI →

The paper introduces WHALE, a method that alternates between updating a language model’s weights and searching for a better harness (the code that manages context and control flow). By iteratively fine‑tuning the model under the current harness and then optimizing the harness under the updated model, WHALE improves performance across search QA, math reasoning, and chess puzzles, outperforming weight‑only, harness‑only, and Fast‑Slow Training by 4.15–24.38 percentage points in mean@8 accuracy. The approach uses either fixed phase lengths or an adaptive patience rule to decide when to switch phases, and the authors provide code on GitHub.

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 Machine Learning
Sep 22

CHART: A Harness-Rotation Curriculum for Harness-Robust Search Agents

The paper introduces CHART, a curriculum that rotates harnesses during training to teach search agents parallel search strategies robustly across different harness configurations. Unlike static harness augmentation, CHART gradually consolidates behavior by graduating learned harnesses and replacing them, maintaining a reward gap that drives learning. Experiments show CHART enables agents to parallelize on 89% of held‑out harnesses, improves performance on a new QA task by 5.6pp, and benefits more from meta‑harness search than baselines.

By Xinlu Zhang, Ying-Chun Lin, Zhihan Zhang, Besnik Fetahu, Xi Chen
arXiv AI
Oct 1

Self-Evolving Harness on Multiple Tasks with the Agent as Its Own Optimizer

The paper introduces a self‑evolving harness framework where a frozen language‑model agent first solves tasks and then edits its own harness based on run records. Using a 49‑line seed harness, the evolved harness improves average scores on in‑distribution benchmarks by 4.48 points and on out‑of‑distribution benchmarks by 12.64 points, surpassing Codex on the former and matching it on the latter. Continued evolution on a specific out‑of‑distribution benchmark further raises performance, and the study analyzes emergent mechanisms such as output truncation and history compaction.

By Qiankai Xu
arXiv AI
Oct 19

Self-Evolving Coding Agents via Harness-Policy Optimization

The paper introduces Self-HPO, a recursive framework that alternates between optimizing the harness and the policy of large language model agents for coding tasks. By letting the current policy propose new harness candidates based on its failures, the method aligns harness evolution with policy improvement, leading to consistent performance gains across three benchmarks. Experiments show that Self-HPO raises the average resolve rate of Qwen3.5-35B-A3B from 57.8% to 64.8% and improves reliability and capability metrics, with benefits that generalize to out‑of‑distribution settings.

By Zhepei Wei, Wenlin Yao, Baolin Peng, Danqing Wang, Qianhui Wu, Hao Cheng, Yu Meng, Jianfeng Gao
arXiv AI
Sep 15

HarnessBandit: Joint Learnability-Transferability Scheduling for Multi-Harness Agentic Reinforcement Learning

arXiv:2609.13739v1 Announce Type: cross Abstract: Language-model agents are increasingly deployed through diverse harnesses that differ in system prompts, tool schemas, control loops, and trajectory...

By Hongliang Wei (Harbin Institute of Technology, Alibaba Cloud), Xiaobing Tu (Alibaba Cloud), Yinggui Wang (Alibaba Cloud), Zhengxi Liu (Alibaba Cloud), Rongkun Xue (Alibaba Cloud), Jinkui Ren (Alibaba Cloud), Xiantao Zhang (Alibaba Cloud), Debin Zhao (Harbin Institute of Technology), Xiaopeng Fan (Harbin Institute of Technology)
arXiv AI
3d ago

Multi-Task Self-Evolving Harnesses with the Agent as Its Own Optimizer

The paper introduces a framework for self‑evolving harnesses in which a frozen language‑model agent first solves tasks and then, as a proposer, edits its own harness based on complete run records. The method trains on diverse benchmarks, separating training and held‑out tasks, and evaluates on five unseen out‑of‑distribution benchmarks. Experiments show that harnesses evolved by GLM‑5.3 and GPT‑5.6 Sol achieve performance comparable to or exceeding Claude Code and Codex, with further improvements after continued evolution on Claw‑Eval.

By Qiankai Xu