Pith. sign in

REVIEW 4 cited by

STeCa: Step-level Trajectory Calibration for LLM Agent Learning

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 2502.14276 v2 pith:6TIBPTEM submitted 2025-02-20 cs.LG cs.AIcs.CL

STeCa: Step-level Trajectory Calibration for LLM Agent Learning

classification cs.LG cs.AIcs.CL
keywords agentscalibrationstecatrajectorieslearningstep-leveltaskstrajectory
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Large language model (LLM)-based agents have shown promise in tackling complex tasks by interacting dynamically with the environment. Existing work primarily focuses on behavior cloning from expert demonstrations or preference learning through exploratory trajectory sampling. However, these methods often struggle to address long-horizon tasks, where suboptimal actions accumulate step by step, causing agents to deviate from correct task trajectories. To address this, we highlight the importance of timely calibration and the need to automatically construct calibration trajectories for training agents. We propose Step-Level Trajectory Calibration (STeCa), a novel framework for LLM agent learning. Specifically, STeCa identifies suboptimal actions through a step-level reward comparison during exploration. It constructs calibrated trajectories using LLM-driven reflection, enabling agents to learn from improved decision-making processes. We finally leverage these calibrated trajectories with successful trajectories for reinforced training. Extensive experiments demonstrate that STeCa significantly outperforms existing methods. Further analysis highlights that timely calibration enables agents to complete tasks with greater robustness. Our code and data are available at https://github.com/WangHanLinHenry/STeCa.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Proper Scoring Rules for Agentic Uncertainty Quantification

    cs.AI 2026-05 unverdicted novelty 7.0

    Introduces Trajectory Proper Score (TPS) as a strictly proper family of trajectory-level scoring rules that elicits the complete prefix-conditioned success probability process.

  2. Leveraging Trajectory Graphs for Pre-Execution Error Diagnosis in Agentic LLM Systems

    cs.AI 2026-07 conditional novelty 6.0

    Modeling agent trajectories as action-centric probabilistic graphs lets a GNN warn LLM agents of likely step-level errors before execution, improving pass ratio ~14.7% across four benchmarks.

  3. Reinforcement Learning without Ground-Truth Solutions can Improve LLMs

    cs.LG 2026-06 unverdicted novelty 6.0

    RiVER applies calibrated ranking rewards from execution scores to train LLMs on score-based tasks without ground-truth, producing gains on both heuristic contests and exact-solution coding benchmarks.

  4. Bridging Inference-Time Scaling and Episodic Memory with Action-Centric Graphs

    cs.AI 2026-07 conditional novelty 5.0

    Graph-based action memory with dual-stream TD learning improves best-of-N inference scaling for LLM agents, reporting +20.81% success / +6.17% progress over vanilla baselines.