Awesome World Model Hub Papers · Datasets · Projects
← Back to papers

Temporal-Distance JEPA: Plan-Aware Representation Learning for Latent World Model Predictive Control

arXiv 2026 45.6 method

TLDR

Proposes TD-JEPA, mining temporal distance cost from reward-free trajectories to improve latent world model predictive control over JEPA.

Reasoning

Strengths include a novel method for mining temporal cost from offline logs, improving planning and representation, with strong empirical results on multiple benchmarks. Weaknesses: limited to specific environments, no explicit discussion of limitations or generalization.

Read-first score

Read-first score 45.6, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 40.

Recency 6%
100

Uses a gentle age decay so recent papers surface without erasing older foundations. 2026

Methodology quality 18%
80

Screens visible abstract and analysis fields for experiment, dataset, baseline, metric, and limitation evidence. markers=ablation,baseline,evaluation

Topical relevance 29%
57.1

Uses existing LLM keyword relevance scores normalized to 0-100. world model,world simulator,generative world model,interactive world model,video world model,world dynamics prediction,model-based reinforcement learning world model

Reproducibility 18%
50

Screens links and visible text for paper, code, dataset, artifact, and repository signals. pdf=True; code=False; dataset=False; markers=checkpoint,code,github

Citation impact 18%
0

Uses OpenAlex-shaped citation metadata as a bibliometric attention signal, separate from paper quality. cited_by_count=0

Citation velocity 12%
0

Citation velocity estimates citations per publication-year to reduce old-paper bias. velocity=0.00

Field roles

FrontierMethodology anchor

Rank sensitivity

Stability: volatile; rank range: 572.

Keyword Scores

world model
10
model-based reinforcement learning world model
9
world dynamics prediction
8
interactive world model
6
generative world model
4
world simulator
2
video world model
1

Deep Analysis

Innovations

  • Mines a directed temporal cost from reward-free trajectories, using same-trajectory step order as positive targets and cross-trajectory pairs as heuristic negatives, plus a rollout-consistency term that matches the planner horizon.
  • Co-designs the learned cost with plan-time deployment: the mined temporal distance serves as the planning cost when progress is topological, and as a representation signal that improves latent Euclidean planning when contact geometry dominates.
  • Narrows the train–plan gap for JEPA world-model planners by infusing temporal progress structure from offline logs without requiring reward signals.

Methodology

TD-JEPA retains the LeWM encoder–predictor backbone and mines a directed temporal cost from reward-free offline trajectories. Same-trajectory step order supplies positive targets, cross-trajectory pairs act as heuristic negatives, and a rollout-consistency term aligns predictions with the planner horizon. The mined cost is deployed either directly as the planning cost (topological tasks) or as a representation signal to improve Euclidean planning (contact-dominated tasks). Locked evaluation compares against LeWM and the concurrent RC-aux baseline on Two-Room, OGB-Cube, and Push-T.

Key Results

Under locked evaluation, TD-JEPA’s mined cost raises Two-Room success to 100.0% (vs. LeWM 97.4%), while the same temporally trained checkpoint improves OGB-Cube by 14.2 points over LeWM and improves Push-T; it matches or exceeds both methods on every environment. Ablations confirm that the directed head, cross-trajectory negatives, and rollout consistency each contribute.

Limitations

  • The mined temporal distance cost is used directly as the planning cost only when progress is topological; in contact-dominated tasks, Euclidean planning is still employed, and the cost serves mainly as a representation signal.
  • Cross-trajectory negatives are heuristic, which may limit the quality of the learned temporal cost.
  • Evaluation is limited to three environments (Two-Room, OGB-Cube, Push-T) and a locked-representation protocol, which may not capture performance under full fine-tuning or broader task diversity.

Tags