Future-predictive · diffusion-free

Actions and futures,
without diffusion.

Jie Xu, Kangjin Yu, Ziyi Jin, Junjie Gao, Liqing Chen, Yixian Li, Shuai Tian, and Zhongpu Xia*

Anyverse Dynamics

Jie Xu: jeff_xu_0503@foxmail.com *Corresponding author: Zhongpu Xia

JEPA Policy learns to predict robot actions together with a representation of a future observation. Both predictions share one Transformer, trained from scratch on paired demonstrations and evaluated in two forward passes.

Action + future predictiontwo passes
JEPA Policy shared action and future prediction architecture
0 stepsdiffusion / denoising
2 passesjoint prediction + refinement
Research question01

Can predicting the future help us learn better actions?

A demonstration provides both an action and what happened next. We use that pairing as additional supervision for a diffusion-free policy. Predicting a future representation, rather than a video, keeps the learning problem focused on control.

83.0%simulation success9 tasks · 3 suites · 3 seeds
+5.6points over action-only9 of 9 tasks improved
33×faster than DP-100Model only · 13.2 vs 439.5 ms
630real-robot episodes5 tasks · 63 sessions

Method

Learning from paired
actions and observations.

We extend action-only MIP with a future-representation target. The main design choice is where the two predictions interact.

01

Paired supervision

The training targets pair an expert action chunk with a future observation from the same demonstration. The policy predicts that observation's representation, not its pixels.

02

One shared attention stack

Action and future tokens attend to each other in every Transformer layer. Both objectives train the same stack, with the visual encoder learned from scratch.

03

Two prediction steps

The first pass predicts actions and future representations; the second refines them. We build on MIP, without diffusion training or iterative denoising at deployment.

Architecture with shared current and future encoders, action and future tokens, and two losses

Action and future tokens share every self-attention layer. The future target uses the live shared encoder with stop-gradient.

Video · 1 min 45 sec

See the policy
in action.

A short overview of the method, Coffee Preparation and Tool Hang comparisons, inference latency, and all five real-robot tasks. Full evaluation results are in the paper.

MethodSimulationReal robot

Ablation studies

Where should future
supervision act?

We compare shared and separate prediction branches under matched training settings, then change gradient routing to test how future supervision reaches the action predictor.

Shared versus dual-branch controlled comparison
01

Shared attention

The matched dual-branch and gradient-routing controls support using future supervision within the action-generating stack, rather than in a separate prediction branch.

02

Representation collapse

Across 84 checkpoints, we observe no complete collapse under action supervision. Some tasks still show low-rank representations; the paper reports these exceptions.

03

Failure diagnostics

Future-prediction error can help rank failures on some tasks, but performance varies by task. It is not a calibrated or universal failure probability.

Inference latency

Model timing and
on-robot latency.

We measure model-only decision time on the PPU benchmark and frame-to-action-chunk latency on the RTX 3090 deployment stack. These are separate measurements, not interchangeable speedup claims.

01Model decisionPPU-ZW810E
JEPA Policy model latency compared with Diffusion Policy sampler lengths
13.2 ms for JEPA Policy versus 439.5 ms for the trained 100-step Diffusion Policy configuration.
02Live frame-to-chunkRTX 3090
Real-robot frame-to-action-chunk latency for JEPA Policy and Diffusion Policy
Steady-state logs include sensing and middleware. The first action chunk is excluded for every method.

Real-robot experiments

Five tasks on
a dual-arm robot.

Each task uses 100 demonstrations. We evaluate three checkpoints per policy over 63 sessions, covering Cabinet, Cup Stack, Cup Upright, Plate Grape, and Pen Insert.

Policies run synchronously. Success means finishing within the same task-specific action-chunk budget, not a wall-clock deadline. The released code includes the deployment stack, task launchers, safety checks, and evaluation tools.

66.9%JEPA pooled54.7%action-only31.8%DP-16
Start and end frames for five real-robot tasksEpisode-weighted real-robot success rates
Scope

What the experiments
tell us.

JEPA Policy improves on action-only MIP and Diffusion Policy across the nine simulated tasks tested. Tool Hang contributes substantially to the average margin over Diffusion Policy.

The real-robot results come from one platform and one operator, with ten episodes per checkpoint session. They suggest an advantage over action-only MIP, but do not establish generalization to other robots or settings.

JEPA Policy

Paper and code.

The paper describes the method and evaluation protocol. The repository contains training configurations, baseline recipes, and real-robot deployment code.