Good Papers

DeLoop: Repeated Actions as Self-Supervision for Long-Horizon Agents

DeLoop uses self-supervised preference optimization on looping versus non-looping actions to reduce long-horizon agent loops by over 90% and cut step counts by two-thirds without rewards or gold labels.

Published Oct 14, 2026▲ 2 on Hugging FaceCode

66%
OverallHighly rated
?
OverallHighly ratedVote to see the score
Readers
–

Only vote on papers you've read. Sign in to vote.

AI panel12/20reviewers recommend it
lenient 5/5
medium 6/10
strict 1/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

Language-model agents that run long tasks often redo work they have already done: they re-issue a tool call they made earlier and get back exactly the same observation, a step that adds no new information. We identify this failure as a loop. Loops appear natively in Qwen, Llama, and Gemini agents and become far more common once the agent's history is compressed to fit its context window. To reduce these loops, we propose DeLoop, a self-supervised training method. DeLoop builds on a simple observation: the agent's own rollout can provide the supervision needed to learn from its loops. We use a looping action as a negative example and the first later non-looping action in the same rollout as a positive example. DeLoop learns from these pairs through direct preference optimization and does not require task rewards, gold answers, or LLM judges. On CodeGym under compression, DeLoop reduces the share of Qwen3-8B tasks containing loops from 57.3% to 6.1%. It also uses about one third as many steps per task, with similar task success. On Qwen3-32B, DeLoop reduces loops and steps while raising task success from 37.7% to 44.8%.

Are you an author?

Good Papers badgeAuthor of this paper? Add this badge to your README or page
[![Good Papers](https://www.goodpapers.org/badge/W7221933441.svg)](https://www.goodpapers.org/paper/W7221933441)