Pith. sign in

REVIEW 17 cited by

Trial and Error: Exploration-Based Trajectory Optimization for LLM Agents

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 2403.02502 v2 pith:JDQUNRBS submitted 2024-03-04 cs.CL cs.AIcs.LG

Trial and Error: Exploration-Based Trajectory Optimization for LLM Agents

classification cs.CL cs.AIcs.LG
keywords trajectoryagentsagentexplorationoptimizationperformanceapproachcontrastive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Large Language Models (LLMs) have become integral components in various autonomous agent systems. In this study, we present an exploration-based trajectory optimization approach, referred to as ETO. This learning method is designed to enhance the performance of open LLM agents. Contrary to previous studies that exclusively train on successful expert trajectories, our method allows agents to learn from their exploration failures. This leads to improved performance through an iterative optimization framework. During the exploration phase, the agent interacts with the environment while completing given tasks, gathering failure trajectories to create contrastive trajectory pairs. In the subsequent training phase, the agent utilizes these trajectory preference pairs to update its policy using contrastive learning methods like DPO. This iterative cycle of exploration and training fosters continued improvement in the agents. Our experiments on three complex tasks demonstrate that ETO consistently surpasses baseline performance by a large margin. Furthermore, an examination of task-solving efficiency and potential in scenarios lacking expert trajectory underscores the effectiveness of our approach.

discussion (0)

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

Forward citations

Cited by 17 Pith papers

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

  1. Training the Orchestrator: A Supervised Approach to End-to-End PDDL Planning with LLM Agents

    cs.AI 2026-06 unverdicted novelty 7.0

    HALO trains an orchestrator policy on verifier-approved refinement trajectories across 11 PDDL domains, matching GPT-5-mini success rates at roughly 45x lower orchestration cost and cutting LLM calls by 40-50%.

  2. Aligning Agents via Planning: A Benchmark for Trajectory-Level Reward Modeling

    cs.AI 2026-04 unverdicted novelty 7.0

    Plan-RewardBench is a trajectory-level preference benchmark that shows existing reward models, including LLM judges, perform poorly on long-horizon agent trajectories in tool-using scenarios across safety, planning, a...

  3. Aligning Agents via Planning: A Benchmark for Trajectory-Level Reward Modeling

    cs.AI 2026-04 unverdicted novelty 7.0

    Plan-RewardBench is a trajectory-level preference benchmark that evaluates how well reward models distinguish preferred agent trajectories from hard distractors across safety refusal, tool handling, complex planning, ...

  4. C-TRAIL: A Commonsense World Framework for Trajectory Planning in Autonomous Driving

    cs.AI 2026-03 unverdicted novelty 7.0

    C-TRAIL combines LLM commonsense with a dual-trust mechanism and Dirichlet-weighted Monte Carlo Tree Search to improve trajectory planning accuracy and safety in autonomous driving.

  5. Agentic-DPO: From Imitation to Agentic Policy Optimization on Expert Trajectories

    cs.AI 2026-07 accept novelty 6.0

    Offline DPO on expert states with one-step student negatives and schema-preserving augmentation improves LLM agents beyond SFT and can match online GRPO without environment interaction.

  6. MetaPS: Adaptive Programmatic Strategy Selection for Market Agents

    cs.AI 2026-06 unverdicted novelty 6.0

    MetaPS trains models via simulation rollouts to select from programmatic strategy libraries for market agents, yielding better performance than fixed or direct LLM baselines across model sizes.

  7. OPD-Evolver: Cultivating Holistic Agent Evolver via On-Policy Distillation

    cs.CL 2026-06 unverdicted novelty 6.0

    OPD-Evolver uses on-policy self-distillation in fast interaction and slow attribution loops to build agents with holistic memory competence, outperforming prior systems by up to 11.5% and allowing a 9B model to compet...

  8. Learn from Weaknesses: Automated Domain Specialization for Small Computer-Use Agents

    cs.LG 2026-05 unverdicted novelty 6.0

    LearnWeak specializes small CUAs via weakness detection by a reference agent, targeted task synthesis, and error-aware training, delivering 11+ point gains on OSWorld.

  9. Test-Time Deep Thinking to Explore Implicit Rules

    cs.AI 2026-05 unverdicted novelty 6.0

    TTExplore trains a 7B thinker via task-score RL to infer implicit rules at test time, raising agent success by 14-19 points on five embodied tasks.

  10. SkillEvolver: Skill Learning as a Meta-Skill

    cs.AI 2026-05 unverdicted novelty 6.0

    A meta-skill authors and refines prose-and-code skills for agents by learning from post-deployment failures with an overfit audit, achieving 56.8% accuracy on SkillsBench tasks versus 43.6% for human-curated skills.

  11. Agentic Environment Engineering for Large Language Models: A Survey of Environment Modeling, Synthesis, Evaluation, and Application

    cs.CL 2026-06 unverdicted novelty 5.0

    This survey categorizes agentic environments for LLMs by eight attributes and domains, introduces symbolic and neural synthesis paradigms with evaluation, and outlines four agent evolution pathways plus three environm...

  12. Learning to Act under Noise: Enhancing Agent Robustness via Noisy Environments

    cs.AI 2026-05 unverdicted novelty 5.0

    NoisyAgent trains LLM agents with controlled user and tool noise to improve robustness in stochastic environments while also boosting clean-benchmark performance.

  13. From Coarse to Fine: Self-Adaptive Hierarchical Planning for LLM Agents

    cs.AI 2026-04 unverdicted novelty 5.0

    AdaPlan-H enables LLM agents to generate self-adaptive hierarchical plans that adjust detail level to task difficulty, improving success rates in multi-step tasks.

  14. HIPIF: Hierarchical Planning and Information Folding for Long-Horizon LLM Agent Learning

    cs.AI 2026-06 unverdicted novelty 4.0

    HIPIF trains LLM agents end-to-end using subgoal-based hierarchical planning and information folding of completed histories, plus hierarchical reflection and process rewards, to handle long-horizon tasks without auxil...

  15. LLM Agents Are the Antidote to Walled Gardens

    cs.LG 2025-06 unverdicted novelty 4.0

    LLM agents enable universal interoperability by serving as automatic translators and adapters between proprietary digital services.

  16. Agent System Operations: Categorization, Challenges, and Future Directions

    cs.MA 2026-06 unverdicted novelty 3.0

    This survey categorizes anomalies in agent systems into intra-agent and inter-agent types and introduces the AgentOps framework with four operational stages.

  17. Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models

    cs.AI 2025-01 unverdicted novelty 3.0

    The paper surveys reinforced reasoning techniques for LLMs, covering automated data construction, learning-to-reason methods, and test-time scaling as steps toward Large Reasoning Models.