arXiv AI By Yangqin Jiang, Chao Huang

AgentBrew: Lifelong Knowledge Brewing from Strong Teachers to Weak LLM Agents

Read the original on arXiv AI →

arXiv:2607. 16851v1 Announce Type: new Abstract: Deploying LLM agents typically requires a compact test-time student, even if a stronger teacher is available during training.

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 AI
Aug 5

EduClaw-Bench: A Long-Horizon Benchmark for Pedagogical LLM Agents with Simulated Learners

arXiv:2608. 03206v1 Announce Type: cross Abstract: Large language models (LLMs) power educational applications from tutoring to essay scoring, but each is a point solution to a single task, and only recently have these point solutions been integrated into agents operating over a learning management system (LMS).

By Unggi Lee, Sookbun Lee, Yeil Jeong, Eunjoo Lee, Minchul Shin, Hoilym Kwon
arXiv Machine Learning
Sep 23

Agent0: Unleashing Self-Evolving Agents from Zero Data via Tool-Integrated Reasoning

Agent0 is a fully autonomous framework that enables large language model agents to evolve without external data by using a multi‑step co‑evolution process. It pits a curriculum agent against an executor agent, both derived from the same base LLM, where the curriculum agent creates increasingly challenging tasks and the executor learns to solve them. By integrating external tools into the executor’s workflow, the system creates a self‑reinforcing cycle that continuously generates high‑quality curricula, leading to significant gains in reasoning performance—an 18% improvement on mathematical reasoning and 24% on general reasoning for the Qwen3‑8B‑Base model.

By Peng Xia, Kaide Zeng, Jiaqi Liu, Can Qin, Fang Wu, Yiyang Zhou, Caiming Xiong, Huaxiu Yao
arXiv AI
Sep 7

Persistent Teacher Anchoring for Tool-Using Agents

Persistent Teacher Anchoring (PTA) is a method that extends on‑policy knowledge distillation by ensuring that a teacher verifies entire turns before any tool calls are executed. PTA builds on chunk‑level verification with an added turn‑level commitment, treating verified chunks as atomic units and introducing persistent lookahead to keep rollout capacity full. Experiments on Search‑R1 and DeepEyes show that PTA improves macro best@4 by 2.5–2.8 points over standard OPKD and boosts throughput by 24%.

By Hyun Bin Park (Sogang University), Kyungho Song (University of Michigan, Ann Arbor), Sangmin Lee (Sogang University), Du-Seong Chang (Sogang University)