Literature
Display
← All papers

Training and Evaluating Diffusion Policies with Long Context Lengths

Abhinav Agarwal · Adam Wei · Taylan Kargin · Michael Zeng · Cole Becker · Arif Kerem Dayi · Pablo Parrilo · Asuman Ozdaglar · Russ Tedrake

Preprint posted · arXiv (preprint) ↗

Robotics12 min text · CondensedOriginal paper ↗
Contents

Overview

Long observation histories can work for single-task Diffusion Policies when architecture, data, and task demands are matched. Variable-history training improves several limited-data cases.

At a glance

The study varies context length, demonstration count, manipulation stability, and denoising architecture. A UNet with cross-attention often tolerates naive history scaling better than the tested FiLM and transformer alternatives. Training jointly over multiple context lengths further improves selected low-data regimes. Results span five simulated tasks and one small hardware study; each reported configuration uses one training run, and simulated performance selects the best tested checkpoint.

1 Introduction

Short histories can hide task phase or past decisions, but failures of longer histories need not establish that naive scaling is fundamentally impossible. The paper systematically tests architecture, data scale, and manipulation difficulty before introducing a variable-history curriculum. Its scope is recent, continuous image history for single-task policies trained from scratch, rather than distant symbolic memory or a general pretrained robot foundation model.

Refer to caption
Figure 1: Left: We provide extensive evaluation of key interdependent factors when naively scaling context length for Diffusion Policies [1] by varying data scale, conditioning architecture, and task properties and find that naive scaling doesn’t catastrophically fail in many cases, especially with the right architecture. Right: We propose training policies on a curriculum of context lengths as opposed to just one fixed context length, and find that on most tasks we evaluate, this method improves performance in the low data regime while maintaining performance in higher data regimes.

1.1 Statement of Contributions

Nearly two hundred trained policies probe five simulated tasks, three dataset sizes, multiple context lengths, and alternative architectures. The proposed curriculum reports roughly 1.25–2-fold improvement over the strongest naive-scaling baseline in selected low-data settings while preserving performance in other tested regimes. A separate analysis revisits whether past-action prediction or freezing the visual encoder explains earlier long-context improvements. These findings are empirical within the tested training setup.

1.2 Related Works

Past-token prediction, experience retrieval, and key-frame selection address related memory problems with different assumptions. The present study tests whether direct recent-history scaling can work before compression/filtering. It also distinguishes pretrained or multi-task memory models from single-task learning from scratch. Prior causal-confusion explanations are relevant hypotheses, not established mechanisms for all diffusion policies.

2 Preliminaries

A diffusion policy conditions action denoising on image/state history. Both the length of observed history and the amount of past action included in the prediction target affect the experiments.

2.1 Diffusion Policy

The policy models a chunk containing past and future actions conditioned on the last Tₒ observations. Fixed-history baselines predict the full past window, following Diffusion Policy code. Simulation contexts reach eighty steps; the hardware test uses ninety-two. These are continuous recent observations, not arbitrary long-term episode retrieval.

Equation 1
ℙ(𝐚[t−Tpp​a​s​t+1:t+Tp]∣𝐨[t−To+1:t])\mathbb{P}(\mathbf{a}[t\!-T_{p}^{past}\!+\!1:t\!+\!T_{p}]\mid\mathbf{o}[t\!-\!T_{o}\!+\!1:t]) (1)

2.2 Diffusion Policy Architecture

An image encoder first embeds observations; a denoiser then combines these embeddings, proprioception, and diffusion time to generate actions. The study compares a UNet with global FiLM conditioning, a UNet with token-wise cross-attention, and a transformer denoiser. The image encoders are normally trained from random initialization, so conclusions about backbone preference should not be transferred directly to large pretrained DiTs.

3 Evaluating Long-Context Diffusion Policies

Push-T, Square, and Lift are solvable with short histories; Push-and-Return and Grasp-and-Return additionally require remembering an initial location. Each simulated task uses half, usual, and twice its task-specific demonstration count. The main sweep uses UNet plus cross-attention, with separate architecture comparisons. Context lengths range from one to twenty for short-history tasks, up to eighty for pushing return, and forty-eight for grasping return.

3.1 Benchmark Tasks Requiring Long Context Lengths

In the two return tasks, an object starts on one side, moves to the center, the robot visits a neutral configuration, and the object must return to its original side. Pushing is locally unstable; grasping can tolerate larger control errors. Task success requires the correct side. Manipulation completion accepts either side, and contextual success is the fraction of completed manipulations that choose correctly.

The physical marshmallow task requires exactly two transfers before signaling completion. The target bowl starts with varying contents, preventing final quantity alone from revealing how many transfers occurred. Contextual success in the return tasks is conditional on manipulation completion and is not an unconditional memory score over all failed rollouts.

Refer to caption
Figure 2: Schematic of the push/grasp-and-return tasks with two modes. A block spawns on either side. For task success, the robot should push/grasp the block to the center, move to a neutral location, and then return it to the area it originated in. Relaxing the memory requirement, manipulation completion is awarded for returning the block to either of the spawn locations. We define contextual success = task successmanipulation completion\frac{\mathbf{\text{task success}}}{\mathbf{\text{manipulation completion}}} to evaluate the percentage of rollouts showing manipulation completion that are also able to keep track of memory.

3.2 Empirical Results

Lift remains strong as history increases at all tested data scales. Push-T and Square lose success at longer contexts with limited data, but the gap shrinks as demonstrations increase. Grasp-and-Return learns useful long-context behavior even with twelve demonstrations, while Push-and-Return needs more data. The pattern is consistent with stable grasping tolerating imperfect learned control. It does not imply that every task benefits from more context or that data alone resolves missing task-state information.

Refer to caption
(a)
Refer to caption
(b)
Refer to caption
(c)
Figure 3: Short-context solvable tasks’ performance. Long-context policy performance improves as data is scaled. The difference between short and long-context policies shrinks in high data regime.
Refer to caption
(a) Even though the task requires memory, long-context policies perform worse than short context policies in the limited (N/2N/2) data regime. In the NN and 2​N2N data regimes, however, we notice the expected rise in performance.
Refer to caption
(b) Long-context policies in the limited data regime aren’t able to complete the task even if the memory requirement for success is relaxed. This changes as data is scaled. Short-context policies are successful regardless of data.
Refer to caption
(c) Long-context policies always show high contextual success. Thus, those long-context policies which are able to complete manipulation requirements also often keep track of history.
Figure 4: Push-and-return task performance.
Refer to caption
(a) Long-context policies show reasonable performance even in the low data regime (N/2N/2), which further improves as data is increased.
Refer to caption
(b) Long-context policies are always able to reasonably complete manipulation requirements. Contrary to push-and-return, however, short-context policies are unable to do so regardless of data.
Refer to caption
(c) Long-context policies always show high contextual success. Thus, those long-context policies which are able to complete manipulation requirements also often keep track of history.
Figure 5: Grasp-and-return task performance.
Refer to caption
Figure 6: Results for the marshmallows task, where through simple hyperparameter changes we are able to achieve high performance with just 100 training trajectories and a naively scaled context length of To=92T_{o}=92.

3.3 Additional Comments

At long contexts, manipulation completion often tracks total success, while successful completions usually return to the correct side. This suggests that manipulation learning is a major bottleneck in these settings. Because contextual success conditions on completion, it cannot establish that memory is correct on every failed rollout. Short-history Grasp-and-Return also fails manipulation itself, plausibly because ambiguous task phase causes switching and out-of-distribution motions.

4 Training Long-Context Diffusion Policies

The training analysis first changes conditioning architecture, then jointly trains across histories, and finally separates past-action prediction from freezing a pretrained short-history observation encoder.

4.1 Cross-Attention Conditioning

UNet cross-attention generally improves long-context behavior in limited data relative to FiLM, while short-context differences are smaller. The tested DiT performs poorly on several tasks even after increasing its size, removing causal attention within action chunks, and adding denoising steps. This is evidence about these single-task, scratch-trained configurations; it is not a general rejection of transformer policies or pretrained diffusion backbones.

Refer to caption
Figure 7: Comparison of UNet + Cross Attention, UNet + FiLM and DiT. DiT shows catastrophic failure in significant number of cases. The other two architectures perform similarly at short context lengths, while UNet + Cross Attention shows improvement at longer context lengths especially in the limited data regime. Figure 13 shows comparison by data scale at a given context length. As data is scaled, performance gap between architectures decreases, suggesting that cross-attention provides an inductive bias that reduces the sample complexity of long-context policy learning.

4.2 Variable History Training

Variable-history training samples a context length for each training iteration and clips the predicted past-action window to the available history. Random Sprinkle uses the maximum history with probability 0.8 and otherwise samples shorter lengths uniformly. Progressive training starts at the minimum history, expands the available lengths through the first half of training, then switches to Random Sprinkle.

Progressive training with a short past-action target works best when naive long-context learning struggles. Where naive scaling already works, Random Sprinkle with full past-action prediction is often preferable. Thus the best recipe depends on the effective data/task regime; the experiments do not establish a single universally optimal curriculum. The original algorithm is retained with its full loss notation and loop structure.

Algorithm 1 Variable History Training for Diffusion Policy
Complete original variable-history training algorithm, including Require/Ensure definitions, seven numbered steps, loss formula, and loop indentation.
Refer to caption
Figure 8: In the low (N/2N/2) data regime, variable history training leads to gains in long-context performance. Policies are able to perform as well as the best short-context policy. See Figure 15 for NN data regime performance.

4.3 Revisiting Past-Token Prediction

All naive baselines already predict past actions, yet some fail at long contexts. Freezing an observation encoder learned by a short-context policy also contributes to success, sometimes together with past-action prediction, with Push-and-Return an exception. This analysis uses the paper’s UNet/cross-attention implementation rather than an exact reproduction of the earlier DiT system, and omits the earlier inference-time verification step from the main comparisons.

Refer to caption
Figure 9: Results comparing trainable encoder and encoder frozen from short context lengths with past action prediction. Past-action prediction and frozen observation encoder seem to be driving each others’ success, but push-and-return is an exception.

5 Limitations and Discussion

Long histories increase inference overhead because many images must be encoded in the closed loop. Distillation and adaptive context selection at inference are proposed future directions, not implemented speedups. Further limits include single training seeds per configuration, task-dependent recipe selection, and a small hardware comparison on a modified setup. Rollout confidence intervals do not measure uncertainty from retraining or the best-checkpoint selection procedure.

6 Conclusion

Naive history scaling can be effective given sufficient task data and an appropriate single-task architecture. Cross-attention conditioning and variable-history training reduce failures in several limited-data cases. Encoder freezing complicates attributing prior gains solely to past-action prediction. The evidence supports carefully matched baselines and data sweeps, while leaving broader tasks, repeated training seeds, and inference-efficient memory unresolved.

Acknowledgments

Support includes NSF HAND and graduate fellowship funding, Canadian graduate support, Amazon, and shared MIT/Texas A&M computing resources. The original acknowledgment retains institutional and grant details; funders’ support does not imply endorsement of the findings.

Appendix A Additional Related Works

Additional related work distinguishes recent-history policy learning from language-based retrieval, hierarchical memory, dynamic control, and long-context language-model evaluation.

A.1 Context Length in Imitation Learning

Key-frame filtering and language summaries compress history but may rely on pretrained models or annotation. The cited multi-scale memory model separately encodes recent video and longer summaries. Joint action/video prediction offers another route but adds data and compute requirements. These approaches address overlapping memory needs with resources and interfaces different from the current scratch-trained single-task policies.

A.2 Context Length in Reinforcement Learning in Robotics

Dynamic-control reinforcement learning often uses longer joint-state histories than vision-based imitation. Some methods combine an encoded full history with direct recent state; others use a slower adaptation module and a faster control policy. Comparisons between recurrent and finite-history models have mixed task-dependent outcomes, so context design should follow observation and dynamics requirements.

A.3 Context Length Understanding in LLMs

Language-model studies show sensitivity to where relevant information appears, difficult long dependencies, and attention to distant tokens. These motivate more careful robotics memory benchmarks, but do not themselves establish the cause of robot-policy failures.

Appendix B Diffusion Policy Details

The appendix specifies diffusion loss, conditioning architectures, checkpoint selection, parameter counts, and task-dependent horizons.

B.1 Overview

A shared-per-camera ResNet18 embeds each timestep, normally from random initialization. Image/state tokens condition prediction of the Gaussian noise added to action chunks. The retained denoising objective includes the diffusion schedule and expectation over data, diffusion time, and noise. Encoder weights are shared through time, avoiding a separate visual network for each history position.

Equation 2
ℒ𝒟​(θ)=𝔼k,(𝐨,𝐚)∼𝒟,ϵ∼𝒩⁡(0,I)​[∥ϵ−ϵθ​(αk​𝐚+σk​ϵ,𝐨,k)∥22]\mathcal{L}_{\mathcal{D}}(\theta)=\mathbb{E}_{k,(\mathbf{o},\mathbf{a})\sim\mathcal{D},\epsilon\sim\mathcal{N}(0,I)}[\lVert\epsilon-\epsilon_{\theta}(\alpha_{k}\mathbf{a}+\sigma_{k}\epsilon,\ \mathbf{o},\ k)\rVert^{2}_{2}] (2)

B.2 Comparison of Diffusion Policy Architectures

FiLM concatenates all camera/time embeddings into one vector and maps it to scale/bias terms for UNet layers. Cross-attention preserves time-indexed tokens, concatenates cameras and state within each step, adds positional encoding, and lets intermediate UNet features attend to them. DiT uses transformer decoder layers instead of convolutional UNet layers.

The DiT baseline is enlarged to a comparable parameter scale, removes causal masking within the denoised action chunk to match UNet information flow, and uses more sampling steps. Its continued weakness is therefore not explained solely by the original much smaller model, but the study still covers particular scratch-trained architectures and hyperparameters.

B.3 Training Details and Hyperparameters

Training budgets are matched across compared context lengths within each task. Checkpoint and architecture details matter when interpreting the performance curves.

B.3.1 Checkpoint Selection

For simulated tasks, candidates include the five best validation-loss checkpoints, five best action-matching checkpoints, and three late evenly spaced checkpoints; some configurations retain only the latest late checkpoint. Every candidate is rolled out and the highest success is reported. Hardware uses the latest checkpoint. This evaluation-driven selection can overestimate a separately selected deployment model’s success.

Push-T trains for 150,000 steps, Grasp-and-Return for 100,000, and other tasks for 200,000, using initial learning rate 10⁻⁴ with cosine decay. Each result is one training run. The authors explicitly do not estimate variability due to random training seeds; earlier low-data checkpoints sometimes work better, consistent with overfitting.

B.3.2 Hyperparameters

FiLM total parameter count grows from about 89 million at two frames to 235 million at eighty, whereas cross-attention stays near 151 million and the enlarged DiT near 131 million. Encoder parameters are about 22.4 million. Action denoising lengths are rounded to multiples of four while retaining roughly sixteen future actions and the chosen past window. Table labels and the prose use horizon notation differently; the original configurations and values remain intact rather than silently standardizing them.

Table 1: Architecture-specific hyperparameters for the three denoisers. Values not applicable to a given architecture are marked “–”.
UNet+FiLM UNet+xAttn DiT
Denoiser core
Conditioning mechanism FiLM (global) Cross-attention (token seq.) Cross-attention (token seq.)
UNet Down channels [256,512,1024][256,512,1024] [256,512,1024][256,512,1024] –
Conv kernel size 5 5 –
GroupNorm groups 8 8 –
Approximate parameter counts
Denoiser parameters ≈67​M\approx 67{\rm M} at hy=2h_{y}=2 to ≈212​M\approx 212{\rm M} at hy=80h_{y}=80 ≈129​M\approx 129{\rm M} ≈109​M\approx 109{\rm M}
Encoder parameters 22.4​M22.4{\rm M} 22.4​M22.4{\rm M} 22.4​M22.4{\rm M}
Total parameters ≈89​M\approx 89{\rm M} at hy=2h_{y}=2 to ≈235​M\approx 235{\rm M} at hy=80h_{y}=80 151​M151{\rm M} 131​M131{\rm M}
Table 2: Some details specific to the task evaluated.
Setting Push-T Push-and- Grasp-and- Marshmallows Square Lift
return return (hardware) (robomimic) (robomimic)
Image input (H×WH{\times}W) 128×128128{\times}128 128×128128{\times}128 128×128128{\times}128 128×128128{\times}128 84×8484{\times}84 84×8484{\times}84
Crop (H×WH{\times}W) 112×112112{\times}112 112×112112{\times}112 112×112112{\times}112 112×112112{\times}112 76×7676{\times}76 76×7676{\times}76
Cameras overhead, wrist overhead, wrist overhead, wrist overhead, wrist agentview, eye-in-hand agentview, eye-in-hand
Proprioception dim 3 2 13 13 9 9
Action dim 2 2 13 13 10 10
Context length swept (hyh_{y}) 1, 2, 5, 10, 12, 16, 20 4, 8, 32, 60, 72, 80 4, 8, 16, 20, 24, 48 92 1, 2, 5, 10, 12, 16, 20 1, 2, 5, 10, 12, 16, 20
Future chunk length huh_{u} hyh_{y}+14 to hyh_{y}+16 hy+16h_{y}+16 hy+16h_{y}+16 hy+16h_{y}+16 hy+14h_{y}+14 to hy+16h_{y}+16 hy+14h_{y}+14 to hy+16h_{y}+16
Data (low / usual / high) 80 / 160 / 320 24 / 48 / 96 12 / 24 / 48 100 50 / 100 / 200 25 / 50 / 100
Total training steps 1.5×1051.5{\times}10^{5} 2×1052{\times}10^{5} 1×1051{\times}10^{5} 2×1052{\times}10^{5} 2×1052{\times}10^{5} 2×1052{\times}10^{5}

Appendix C Task Details

“Usual” data scale is task-specific, not a common demonstration count. The appendix gives collection procedures and success criteria.

Table 3: Number of training trajectories chosen as NN for different tasks used in Section 3. The values for benchmark tasks are chosen to be consistent with prior work [19, 20].
Task Value of 𝐍\mathbf{N}
push-T 160
robomimic square 100
robomimic lift 50
push-and-return 48
grasp-and-return 24
marshmallows 100

C.1 Task and Data Collection Descriptions

Usual demonstration counts are 160 Push-T, 100 Square, fifty Lift, forty-eight Push-and-Return, and twenty-four Grasp-and-Return. Pushing trajectories use teleoperation, with mirrored return demonstrations enforcing symmetry between the two initial modes. Grasping return data come from a heuristic simulation policy. Hardware uses one hundred VR demonstrations, an overhead and wrist camera, and six-dimensional end-effector pose control. The return experiments only test two destination modes; broader combinatorial memory remains future work.

Refer to caption
(a)
Refer to caption
(b)
Refer to caption
(c)
Figure 10: Environments for tasks requiring long context length for success. (a) Push-and-return (b) Grasp-and-return (c) Marshmallows.

C.2 Evaluation Details

Simulated success uses two hundred trials, with 95% Wilson intervals for binary outcomes. Return tasks use one hundred trials per initial side. Pushing has a fifty-second limit and requires over 95% area overlap at the target; grasping uses contact with the center region and return to the originating mat. Hardware evaluates twenty trials with varying initial target-bowl contents. These intervals describe rollout sampling for a trained model, not uncertainty from training runs or checkpoint selection.

Appendix D Additional Discussion

Additional analyses examine prior benchmark choices, tolerance to grasp error, open-loop versus closed-loop losses, and observability of the demonstrator’s task phase.

D.1 Reasons for Prior Works’ Criticism of Naive History Scaling

The authors attribute overly broad criticism of naive history scaling to inadequate dataset sweeps, weak conditioning/backbone choices, and too narrow a task selection. Their data support testing both memory-requiring and short-history-solvable tasks at several data scales. This is an alternative explanation for observed failures, not proof that prior methods are unnecessary in every setting.

D.2 Impact of Grasp as Manipulation Primitive

Expert grasp contacts lie on the brick’s central axis, while learned long-context policies deviate by mean absolute offsets of 1.2, 1.4, and 1.3 cm at histories twenty, twenty-four, and forty-eight; medians are one centimetre. Successful grasping despite these errors supports the local-stability hypothesis. It does not independently vary all task differences between grasping and pushing.

Refer to caption
Figure 11: During data collection, the robot grippers make contact with the brick along its central axis while grasping. At inference time however, the policy commands grippers to make contact away from the center location, indicating error in learning the manipulation skills from data. However, because this task is locally stable, despite this error policies perform well. This task thus shows lower sample complexity for long-context learning.
Table 4: Mean and median of the absolute value of gripper contact location offset from the center of the brick in meters. The value for expert truth data is 0. Despite most values being more than 1 cm away from the center, long-context policies succeed (NN training trajectories).
Context Length 20 24 48
Mean 0.012 0.014 0.013
Median 0.010 0.010 0.010

D.3 Reasons for Long-Context Failure

Long-context failures persist in several low-data regimes. The diagnostics separate supervised prediction quality from closed-loop control and correct return decisions.

D.3.1 Training and test loss

On low-data Square with FiLM, longer-history checkpoints can have lower training and validation loss yet lower rollout success. Better fit on expert-distribution samples does not guarantee stable closed-loop behavior, consistent with overfitting and covariate shift. The authors emphasize that this plot uses one training run and may be noisy; a multi-seed replication is needed to establish robust cluster trends.

Refer to caption
(a)
Refer to caption
(b)
Figure 12: Relationship between loss and success rate for the square task across checkpoints. (a) Training loss vs. success rate. (b) Validation loss vs. success rate.

D.3.2 Manipulation Skill Learning

In low-data Push-and-Return, both total success and manipulation completion decline with long histories, while the conditional correct-return rate remains high among completions. The authors infer that learning the manipulation skill is the principal bottleneck for these runs. Conditioning on completion limits that diagnosis: it does not directly test the internal memory of every failed rollout.

D.4 When are short-context lengths sufficient?

Short histories can fail even the relaxed manipulation criterion when task phase is visually ambiguous. Grasp-and-Return may alternate between going to center and returning to neutral, causing jitter and collisions. In planar pushing, the pusher’s side relative to the block more directly reveals motion direction. Thus observability depends on the manipulation primitive; more demonstrations alone cannot always replace missing history or explicit phase guidance.

Appendix E Additional Experiments

Further experiments test capacity matching, curriculum choices, past-action prediction, encoder freezing, inference-time verification, and the physical memory task.

E.1 Cross-Attention Conditioning

Cross-attention’s advantage over FiLM at long histories shrinks with more data. A second comparison adjusts FiLM UNet size to match total cross-attention parameters, adding capacity at twenty frames and removing it at eighty; the low-data conclusions remain similar. This reduces a simple parameter-count explanation while leaving the tested architectural/training scope unchanged.

Refer to caption
Refer to caption
(a)
Refer to caption
(b)
Refer to caption
(c)
Refer to caption
(d)
Refer to caption
(e)
Refer to caption
(f)
Figure 13: Comparison of UNet + Cross Attention and UNet + FiLM across tasks, context lengths, and data scales. Top row: push-T at To=2T_{o}=2 and To=20T_{o}=20. Middle row: square at To=2T_{o}=2 and To=20T_{o}=20. Bottom row: push-and-return at To=4T_{o}=4 and To=80T_{o}=80. Across tasks, the two architectures perform similarly at short context lengths, while UNet + Cross Attention outperforms UNet + FiLM at longer context lengths in limited-data regimes. As data is scaled, the performance gap decreases, suggesting that cross-attention provides an inductive bias that reduces the sample complexity of long-context policy learning. DiT is also shown as a comparison, but often fails to perform without significant pre-training in the single task cases.
Refer to caption
Figure 14: Comparing policy architectures when total parameters for policy using FiLM conditioning are altered to match total parameters for the cross-attention policy.

E.2 Variable History Training Ablations

Progressive training with short past targets helps when naive scaling fails, particularly low-data Push-T, Square, and Push-and-Return. When naive scaling already succeeds—including Grasp-and-Return even with twelve demonstrations—Random Sprinkle with full past prediction performs best. The appendix therefore recommends choosing based on observed scaling behavior, a qualification to the main text’s suggestion of use without dataset-size benchmarking.

Refer to caption
(a)
Refer to caption
(b)
Refer to caption
(c)
Refer to caption
(d)
Refer to caption
(e)
Refer to caption
(f)
Figure 15: Comparison of UNet+Cross-Attention, UNet+FiLM, and variable history training method introduced above across tasks (data scale N/2N/2 in left column and NN in right column). Variable history methods are trained at To=20T_{o}=20 for square and push-T and at To=80T_{o}=80 for push-and-return. For an appropriate choice of Tpp​a​s​tT^{past}_{p} and ρi\rho_{i}, the long-context model matches short-context performance in low data regime, and doesn’t degrade performance in the ideal data regime.
Refer to caption
(a)
Refer to caption
(b)
Figure 16: Variable history training method for grasp-and-return task, where naive history scaling is always sufficient for task success. Given that, we find random sprinkle+full to be the best method even in the N/2N/2 data regime.

E.3 Past-Token Prediction

Past-action prediction alone yields inconsistent gains: clearer improvements appear for some usual-data long-context tasks, but short-context and limited-data trends are less consistent. Encoder freezing and past-action prediction can reinforce one another. Variable-history comparisons select the better curriculum hyperparameter, so they include a tuning advantage that should be recognized.

The earlier inference-time verifier samples several action chunks and favors agreement with executed past actions. It is excluded from main comparisons for speed. A small check gives Square 176/200 versus 175/200 without verification and Push-T 190/200 versus 188/200, differences the authors find statistically insignificant. This limited check does not rule out benefits on other tasks.

Refer to caption
(a)
Refer to caption
(b)
Figure 17: Results of a study investigating how much past action prediction, a design choice introduced by Chi et al. [1], helps policy learning with the UNet+Cross-Attention architecture. While advantages at long context lengths are evident for square and push-and-return in the NN data regime, performance is more similar in the limited data case. Thus, overall patterns are unclear.
Table 5: Performance with and without PTP inference time verification. Policy trained in NN data regime at To=20T_{o}=20 with frozen observation encoder from the best short-context policy for that task.
Task With Verification W/O Verification
Square 176/200 175/200
Push-T 190/200 188/200
Refer to caption
Figure 18: Results comparing trainable and observation encoder frozen from short context lengths with past action prediction. Past-action prediction and frozen observation encoder seem to be driving each others’ success, but push-and-return is an exception.

E.4 Hardware Validation

With ninety-two-frame context and one hundred demonstrations, cross-attention succeeds in 18/20 marshmallow trials, versus 14/20 each for FiLM and DiT. Confidence intervals overlap, and all models use one training run. The setup and embodiment differ from the earlier 250-demonstration study, so the result is not a controlled head-to-head reproduction. Qualitative observations favor cross-attention’s smoother trajectories and bowl clearance, while DiT sometimes regrasps unnecessarily; these motion-quality claims are not quantified by a separate metric.

Concept demonstration

Open image ↗