Hugging Face Trending Papers

The Last Mile to the Real World: Agent-Native Primitives as Reusable Building Blocks for Solving Real-World Tasks

The paper introduces agent‑native primitives—reusable building blocks that embed a resident LLM into resources, enabling them to apply themselves in context and communicate with other primitives. It presents HEELO, a harness‑engineering framework that composes these primitives into task‑specific graphs, verifies outcomes, refines failures, and incorporates new primitives. Experiments show significant performance gains across multiple benchmarks, with HEELO‑enhanced agents completing more real‑world tasks faster and at lower cost.

arXiv AI
Nov 6

The Last Mile to the Real World: Agent-Native Primitives as Reusable Building Blocks for Solving Real-World Tasks

The paper introduces agent‑native primitives—reusable building blocks that embed a language model within a resource to apply it contextually—and HEELO, a harness‑engineering framework that composes these primitives into task‑specific graphs, verifies outcomes, and iteratively refines or adds primitives. Using eight primitive families, the authors demonstrate significant performance gains across multiple benchmarks, raising Terminal‑Bench 4.0 resolution from 37.3% to 55.5% and improving pass rates on ToolBench and GAIA‑Text‑103. When integrated with HEELO, Claude Opus 5.5 and GPT‑6.1 Sol achieve higher completion counts, faster runtimes, and lower costs on 46 real‑world tasks.

By Haibo Jin, Peng Kuang, Xiaopeng Yuan, Lucheng Fu, Jerry Wang, Xucheng Yu, Yaoning Yu, Dehao Wu, Runguo Li, Colin Su, Jingxuan Sun, Xuyang Liu, Haojing Luo, Haohan Wang
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
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 Machine Learning
Aug 27

JIT-Agent: Scaling Harness Intelligence via Just-in-Time Harness Evolution

JIT‑Agent is a model that automatically generates task‑adaptive agent harnesses for any off‑the‑shelf LLM, replacing manual, task‑specific harness design. It learns to compose, repair, and evolve harnesses using a fixed four‑module protocol, and its use boosts performance on benchmarks such as DeepSearchQA and OdysseyBench, outperforming several mature agent runtimes. The approach demonstrates that harness intelligence can be trained, transferred, and compounded independently of model scaling.

By Guibin Zhang, Leo Lu, Fangzhou Xie, Kang Zhu, Junhao Wang, Zhifei Xie, Zhaochen Yu, Zihang Liu, Zhongxiang Sun, Qiankun Li, Yue Liao, Heng Chang, Xiaobin Hu, Qibing Ren, Wangchunshu Zhou, Shuicheng Yan
arXiv AI
Aug 11

Argus: A General-Purpose Agentic Reasoning Runtime for Long-Horizon Tasks

arXiv:2608. 05144v2 Announce Type: replace Abstract: Long-horizon reasoning requires an agentic runtime that can persist when evidence supports its current approach and pivot when measurements reveal failure, hidden constraints, or a misspecified objective.

By Boxiu Li, Zimo Wen, Yijia Fan, Chuan Wen, Fan Yang, Hangxi Guo, Jiaao Wu, Jiachen Zhang, Junxiang Lei, Mukai Li, Ruize Tang, Runjing Gu, Shibo Hu, Sihan Chen, Sufeng Guo, Wanbo Zhang, Xian Zhang, Xiaoyu Chen, Xuanhe Zhou, Xuyao Huang, Yifei Gao, Yifei Shen, Yilin Chen, Yuheng Wu, Yuzhe Zhang, Zelong Zhao, Zhijie Deng
arXiv AI
Oct 28

Spine: Compiling Subtask Trees into Structured Context for Long-Horizon Coding Agents

Spine is a new interface and runtime that aligns a language model’s context with the nesting and completion of subtasks in long‑horizon coding problems. By letting agents declare explicit subtask boundaries through work scopes, Spine records interactions in a persistent SpineTree and compiles only the necessary unfinished subtask history into the model’s prompt, replacing completed subtasks with their results while reusing prefix‑cache. Integrated into Codex and Pi, SpineCodex and the reusable Pi package achieve significant performance gains—improving SWE‑Milestone and ProgramBench scores and reducing costs—without the overhead of recursive subagent delegation.

By Jiahong Xiang, Kunqiu Chen, Lingming Zhang, Yuqun Zhang
arXiv AI
Sep 3

SkillGLoW: Procedural-Family Skill Consolidation for Self-Improving Agents on Long-Horizon Task Streams

SkillGLoW introduces a new way for large language model agents to self‑improve by consolidating procedural skills shared across related tasks. Instead of storing all skills in a single global document or a flat per‑task pool, SkillGLoW aggregates local skills into procedural families, compresses them into de‑instantiated global priors, and regenerates instance‑specific details on demand. Experiments on four diverse benchmarks show that these priors improve performance by an average of 17.2 points over a no‑skill baseline, are more compact than per‑task pools, and enable better transfer to unseen tasks.

By Ao Yan, Xin Zhang, Jiawei Du, Joey Tianyi Zhou
arXiv AI
Aug 6

Argus: A General-Purpose Agentic Runtime for Long-Horizon Reasoning

arXiv:2608. 05144v1 Announce Type: new Abstract: Long-horizon reasoning requires an agentic runtime that can persist when evidence supports its current approach and pivot when measurements reveal failure, hidden constraints, or a misspecified objective.

By Boxiu Li, Zimo Wen, Yijia Fan, Junxiang Lei, Sufeng Guo, Jiaao Wu, Ruize Tang, Mukai Li, Yifei Shen, Xiaoyu Chen, Wanbo Zhang, Runjing Gu, Yifei Gao, Yuheng Wu, Xuyao Huang, Zelong Zhao, Jiachen Zhang, Shibo Hu, Hangxi Guo, Yilin Chen, Yuzhe Zhang, Fan Yang, Chuan Wen, Xian Zhang, Xuanhe Zhou, Zhijie Deng