MoE-DAgger: Transition-Aware Router-Entropy Gating for Selective Human Correction in Phase-Structured Manipulation
TL;DR MoE-DAgger decides when to ask a human for a correction by tracking how the router of a phase-supervised mixture-of-experts policy moves between task phases, so normal phase handoffs do not trigger queries. With matched human-control time it reaches 84% and 78% success on two real Franka pushing tasks, 22 and 26 points above entropy gating without phase awareness.
What they do
In DAgger with human takeover, the costly part is the operator’s time, so the robot should ask for help only on rollouts that are going wrong, and early enough to matter. The authors use a policy with one action head per task phase and a soft router that blends them. Router entropy alone is a poor trigger: the same value can come from a normal handoff between consecutive phases or from the router being split between unrelated phases. MoE-DAgger uses the known phase order to tell these apart.
How it works
- Policy. A shared encoder feeds five phase-anchored ACT heads (approach, entry/alignment, push, withdrawal/clearance, home return); the router’s soft weights blend their action chunks. The policy never receives a phase label or command at run time.
- Gate. From causal router history only, a tracker follows the current phase and its legal successor. A transition between the two gets a bounded time to settle and raises no query.
- Triggers. A correction is requested when averaged entropy stays high outside such a handoff, when a handoff times out, or when routing persistently favors an earlier phase.
- Correction. The robot holds, the human controls the rest of the rollout, and the policy is retrained on the original data plus the corrections.
Results
- Franka Research 3, two shelf-pushing tasks (Green / Red), 30 demonstrations each plus 112.55 s / 127.55 s of corrections, 50 rollouts per method and task: 84.0% / 78.0% task success with no collisions, against 62.0% / 52.0% success and 14% / 16% collisions for phase-unaware entropy.
- ACT temporal disagreement is close at 82.0% / 72.0%, also with no collisions; the confidence intervals of the difference span zero.
- On 50 recorded traces per task, 83.3% (15 selected) and 80.0% (25 selected) of first proposals land on failed rollouts inside the failure window, against 70.0% / 72.0% for ACT disagreement and 63.3% / 60.0% for ensemble disagreement.
- Removing only the handoff veto drops success to 68.0% / 60.0%.
Limitations
One robot and fixture, separate per-task policies, and two geometric variants of one pushing task with a known linear phase order. Each method has a single acquired dataset and one aggregation round. The budget excludes offline phase annotation. Partial-push failures are poorly covered (9/20 on Red), and the critical-window analysis does not show that an intervention would have recovered the rollout.
Videos
Figures




Abstract
Selective data acquisition in Dataset Aggregation (DAgger) on robots requires deciding which learner rollouts to correct and when to intervene. In manipulation with ordered phases, router entropy from a phase-supervised soft mixture-of-experts (MoE) is insufficient: the same value can reflect either a normal adjacent-phase handoff or support for nonadjacent or earlier phases. We propose MoE-DAgger, which uses causal router history to distinguish these cases without providing the policy with a phase label, progress variable, or hard phase command during execution. The acquisition rule allows an adjacent transition to settle, but requests correction when high entropy persists outside such a transition, the transition times out, or routing persistently favors an earlier phase. Under matched active human-control budgets, MoE-DAgger achieves 84.0% task success on Green and 78.0% on Red, exceeding phase-unaware filtered entropy by 22 percentage points on Green and 26 points on Red, with no observed collisions in 50 rollouts per task. On 50 shared intervention-free traces per task, 83.3% and 80.0% of its first proposals fall on failed rollouts within predefined failure windows when 15 and 25 traces are selected, compared with 70.0% and 72.0% for temporal action-chunk disagreement and 63.3% and 60.0% for ensemble disagreement. Shadow replay and an active no-veto ablation indicate that suppressing queries at normal adjacent handoffs is a key contributor to the improved allocation.
Summaries are written automatically from each paper's text. Figures and videos come from the paper and its project page; all credit goes to the authors.
