atlas

Research map / Multi-agent systems and games / LLM agents

Solving the Granularity Mismatch: Hierarchical Preference Learning for Long-Horizon LLM Agents

ICLR 2026 · Multi-agent systems and games › LLM agents · approach: Agent data synthesis and behavior studies · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Hierarchical Preference Learning (HPL), combining trajectory-, step-, and action-group-level DPO with a dual-layer (group length × reward-gap) curriculum for offline preference optimization of LLM agents.

Problem

Preference-based DPO for long-horizon LLM agents suffers a granularity mismatch: trajectory-level DPO gives coarse credit assignment, while step-level DPO is noisy and data-inefficient under limited Monte Carlo rollouts.

Approach

Decomposes expert trajectories into action groups (sub-tasks via fixed, entropy-based, or LLM-semantic segmentation), builds group-level preference pairs with MC-estimated rewards, and trains with a summed trajectory + step + group DPO loss under a 3-phase curriculum over group length and reward gap.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: ALFWorld WebShop InterCode-SQL Spider

Benchmarks: ALFWorld WebShop InterCode-SQL

Metrics: success rate average reward

Baselines: SFT RFT ETO IPR GPT-4o Gemini-2.5-Pro

Builds on: DPO ETO IPR RFT

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy