arXiv AI

Learning from Revision Consequences: Hindsight Meta-Experience Distillation for Self-Improving Agents

The paper introduces Hindsight Meta-Experience Distillation (HMED), a method that lets self‑improving agents evaluate how revisions to their Meta‑Skills affect skill discovery by re‑executing both the original and revised Meta‑Skills from the same initial state. By comparing these outcomes, HMED creates structured Meta‑Experiences that provide learning signals even for revisions that are not ultimately kept. Experiments on three interactive benchmarks show that HMED consistently outperforms strong baselines, improving skill discovery by focusing on the consequences of the improvement process rather than just branch outcomes.

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.

arXiv AI
5d ago

TeleTune: Evolving Agent Skills From Offline Telemetry

arXiv:2610.05437v2 Announce Type: replace Abstract: Computer-use agents need to capture procedural knowledge of how people use software. User telemetry offers a scalable source of this knowledge. How...

By Justin Chih-Yao Chen, Elias Stengel-Eskin, Yan Chen, Pol Llado, Scott Counts, Mohit Bansal, Benjamin Van Durme, Harsh Jhamtani, Gaurav Verma
arXiv AI
Sep 10

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

The paper introduces Procedural Graphs, a framework that structures procedural knowledge for large language model agents as (procedure, relation, procedure) triplets, analogous to knowledge graphs for factual data. At each decision point, a guidance model uses the local subgraph to bias the agent’s next action, while an LLM refiner self‑evolves the graph by comparing failed and successful trajectories, editing its topology to improve performance. Experiments across various datasets, tasks, and LLMs show that Procedural Graphs consistently outperform memory‑based baselines, and the self‑evolution mechanism further enhances results without manual engineering.

By Yuxing Lu, Yicheng Chen, Shanchan Wu, Sercan \"{O}. Ar{\i}k