Pith. sign in

REVIEW 2 cited by

AutoRefine: Compiling Trajectories into Validated Typed Agent Artifacts

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2601.22758 v2 pith:ERPANQUL submitted 2026-01-30 cs.AI

classification cs.AI
keywords autorefinesuccesstaskstrajectoriestravelplannerartifactboundarycases
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large language model agents repeatedly encounter related tasks, yet systems that learn from trajectories commit every lesson to one predefined artifact form. A local constraint, a reusable procedure, and a delegated objective require different amounts of runtime ownership, so one form either under-specifies the correction or wraps it in execution machinery it does not need. We present AutoRefine, which treats trajectory learning as typed artifact compilation. It contrasts failed against successful trajectories to derive a type-neutral, evidence-linked intervention specification, then compiles that specification into the first Rule, Skill, or bounded Subagent that closes it under a runtime-relative ownership order: the selected schema must own every specified observation, state variable, dependent decision, and completion condition. Validation is stated in the same terms: a type-specific contract gate tests whether the generated object realizes its declared boundary, and a replay gate admits it only when it improves the correction cases linked to its source failures without regression on preservation cases. With GPT-5.6-terra as the shared backbone, AutoRefine records the highest success on ALFWorld, ScienceWorld, TravelPlanner, and SpreadsheetBench, and ties the best result on SkillCraft; on TravelPlanner it reaches 80.56% success against 50.0% for the strongest baseline. Removing boundary closure or replay validation costs 15.00 and 16.11 percentage points, the two largest losses among our construction and admission policies. In a longitudinal TravelPlanner stream, the repository holds 89--91% held-out success after 60 learning tasks with no net loss on previously solved tasks, and frozen repositories improve all 25 evaluated source--target pairs, more within a domain (14.20 points on average) than across domains (6.99).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SKILLER: Language-Level Reinforcement Learning for Reusable Skill Extraction in Small Language Models

    cs.AI 2026-08 conditional novelty 6.0 of 10

    SKILLER iteratively rewrites natural-language skills for small LLMs using a frontier-model actor-critic loop, achieving up to +20.4 points on SWE-Skills-Bench but tying or losing on some benchmark-model combinations.

  2. Do Personalized Skills Help Coding Agents? An Empirical Study of Developer Interaction Histories

    cs.SE 2026-08 conditional novelty 6.0 of 10

    On 206 real developer-agent sessions, personalized skills distilled from a developer's own history give small inconsistent gains, while pooled generic skills show the largest (marginally significant) improvement.

Pith tools