Add benchmark comparison vs LeCun world models (JEPA, V-JEPA, DINO-WM, LeWM)
Browse files- BENCHMARK.md +252 -0
BENCHMARK.md
ADDED
|
@@ -0,0 +1,252 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# LeWorld Memory Architecture vs. LeCun's World Models β Benchmark Comparison
|
| 2 |
+
|
| 3 |
+
## β οΈ Honest Status: This Is a Theoretical Comparison
|
| 4 |
+
|
| 5 |
+
**Our architecture has NOT been benchmarked on the standard world-model evaluation suites yet.** What follows is:
|
| 6 |
+
1. A factual catalog of every LeCun-family world model, their exact published numbers, and benchmarks
|
| 7 |
+
2. An architectural comparison showing where our design is fundamentally different
|
| 8 |
+
3. A concrete plan for which benchmarks to run and what we'd need to demonstrate
|
| 9 |
+
|
| 10 |
+
We are not claiming results we don't have. Here's what exists and what's needed.
|
| 11 |
+
|
| 12 |
+
---
|
| 13 |
+
|
| 14 |
+
## 1. The LeCun World Model Family β Published Numbers
|
| 15 |
+
|
| 16 |
+
### Model Lineup (by publication date)
|
| 17 |
+
|
| 18 |
+
| Model | Paper | Params | Training | Key Innovation |
|
| 19 |
+
|-------|-------|--------|----------|----------------|
|
| 20 |
+
| **I-JEPA** | arxiv:2301.08243 | 632M (ViT-H/14) | ImageNet, 16ΓA100 | Predicts masked image patch representations |
|
| 21 |
+
| **V-JEPA** | arxiv:2404.08471 | 632M (ViT-H/16) | VideoMix2M (2M videos) | Predicts masked video region features |
|
| 22 |
+
| **DINO-WM** | arxiv:2411.04983 | ~300M (frozen DINOv2 + predictor) | Offline trajectories | Plans in DINOv2 patch-feature space |
|
| 23 |
+
| **LeWM** | arxiv:2603.19312 | **~15M** | Single GPU, few hours | End-to-end from pixels, 2 loss terms only |
|
| 24 |
+
| **V-JEPA 2.1** | arxiv:2603.14482 | 1.1β1.9B (ViT-g/G) | Massive video corpus | Dense features, multi-layer loss |
|
| 25 |
+
|
| 26 |
+
### LeWM is our primary comparison target (both ~15M params).
|
| 27 |
+
|
| 28 |
+
---
|
| 29 |
+
|
| 30 |
+
## 2. Published Benchmark Results β Robotic Planning
|
| 31 |
+
|
| 32 |
+
### Push-T (Tabletop Block Pushing β Success Rate β)
|
| 33 |
+
|
| 34 |
+
| Model | Params | Success Rate | Planning Time | Notes |
|
| 35 |
+
|-------|--------|-------------|---------------|-------|
|
| 36 |
+
| **DINO-WM** | ~300M+ (frozen DINOv2) | **0.90** | ~48 seconds | Uses pretrained DINOv2 encoder |
|
| 37 |
+
| **LeWM** | ~15M | **0.88** (beats DINO-WM pixel-only) | **<1 second** | End-to-end from pixels, 48Γ faster |
|
| 38 |
+
| **PLDM** | ~15M | 0.70 | <1 second | End-to-end, 7 loss terms (VICReg) |
|
| 39 |
+
| DreamerV3 | 12-400M | 0.30 | β | Model-based RL, needs rewards |
|
| 40 |
+
| IRIS | β | 0.32 | β | β |
|
| 41 |
+
| TD-MPC2 | β | 0.00 | β | Fails without reward signal |
|
| 42 |
+
| **Ours (LeWorld Memory)** | **13.5M** | **β Not yet tested** | β | β |
|
| 43 |
+
|
| 44 |
+
### PointMaze / Wall Navigation β Success Rate β
|
| 45 |
+
|
| 46 |
+
| Model | Maze SR | Wall SR | Notes |
|
| 47 |
+
|-------|---------|---------|-------|
|
| 48 |
+
| **DINO-WM** | 0.98 | 0.96 | Near-perfect |
|
| 49 |
+
| DreamerV3 | **1.00** | **1.00** | Perfect on simple navigation |
|
| 50 |
+
| LeWM | Lower than DINO-WM | Lower | Struggles on very simple envs (SIGReg limitation) |
|
| 51 |
+
| **Ours** | **β Not yet tested** | **β Not yet tested** | β |
|
| 52 |
+
|
| 53 |
+
### Reach (Robotic Arm) β Success Rate β
|
| 54 |
+
|
| 55 |
+
| Model | Success Rate |
|
| 56 |
+
|-------|-------------|
|
| 57 |
+
| **DINO-WM** | **0.92** |
|
| 58 |
+
| DreamerV3 | 0.64 |
|
| 59 |
+
| IRIS | 0.18 |
|
| 60 |
+
| **Ours** | **β Not yet tested** |
|
| 61 |
+
|
| 62 |
+
### Rope & Granular Manipulation β Chamfer Distance β
|
| 63 |
+
|
| 64 |
+
| Model | Rope CD β | Granular CD β |
|
| 65 |
+
|-------|-----------|---------------|
|
| 66 |
+
| **DINO-WM** | **0.41** | **0.26** |
|
| 67 |
+
| DreamerV3 | 2.49 | 1.05 |
|
| 68 |
+
| IRIS | 1.11 | 0.37 |
|
| 69 |
+
| **Ours** | **β Not yet tested** | **β Not yet tested** |
|
| 70 |
+
|
| 71 |
+
---
|
| 72 |
+
|
| 73 |
+
## 3. Published Benchmark Results β Physical Understanding
|
| 74 |
+
|
| 75 |
+
### Physical Latent Probing on Push-T (Pearson r β, higher = better)
|
| 76 |
+
|
| 77 |
+
| Property | DINO-WM (MLP) | LeWM (MLP) | PLDM (MLP) |
|
| 78 |
+
|----------|--------------|------------|------------|
|
| 79 |
+
| Agent Location | **r = 0.999** | r = 0.998 | r = 0.993 |
|
| 80 |
+
| Block Location | **r = 0.999** | **r = 0.999** | r = 0.994 |
|
| 81 |
+
| Block Angle | **r = 0.995** | r = 0.990 | r = 0.972 |
|
| 82 |
+
|
| 83 |
+
LeWM at 15M achieves near-parity with DINO-WM (300M+ pretrained) on physical probing.
|
| 84 |
+
|
| 85 |
+
### Violation-of-Expectation (VoE) β Physics Anomaly Detection
|
| 86 |
+
|
| 87 |
+
| Perturbation | LeWM | PLDM |
|
| 88 |
+
|-------------|------|------|
|
| 89 |
+
| Teleportation (physically impossible) | **Detects (p<0.01)** | Detects |
|
| 90 |
+
| Color change (visual only) | Does NOT flag | Does NOT flag |
|
| 91 |
+
| Correct distinction? | β
Yes | β
Yes |
|
| 92 |
+
|
| 93 |
+
### IntPhys 2 (Intuitive Physics) β Accuracy β
|
| 94 |
+
|
| 95 |
+
| Model | Accuracy | Notes |
|
| 96 |
+
|-------|----------|-------|
|
| 97 |
+
| Human | **96.4%** | Ceiling |
|
| 98 |
+
| V-JEPA 2 (1B+ params) | 57.5% | Best JEPA model |
|
| 99 |
+
| Gemini 2.5 Flash | 55.6% | Best commercial LLM |
|
| 100 |
+
| GPT-4o | ~50% | Near random |
|
| 101 |
+
| **Ours** | **β Not yet tested** | **Potential differentiator** (see below) |
|
| 102 |
+
|
| 103 |
+
**The IntPhys gap (57.5% vs 96.4% human) is the biggest open problem in world models.**
|
| 104 |
+
|
| 105 |
+
---
|
| 106 |
+
|
| 107 |
+
## 4. Published Benchmark Results β Video Understanding
|
| 108 |
+
|
| 109 |
+
### Kinetics-400 (Video Action Recognition) β Top-1 Accuracy β
|
| 110 |
+
|
| 111 |
+
| Model | Params | Accuracy | Probe Type |
|
| 112 |
+
|-------|--------|----------|------------|
|
| 113 |
+
| V-JEPA 2.1 ViT-G | 1.9B | **~88%** | Attentive |
|
| 114 |
+
| V-JEPA ViT-H/16 | 632M | 81.9% | Frozen, attentive |
|
| 115 |
+
| VideoMAEv2 ViT-H | ~632M | 87% | Fine-tuned |
|
| 116 |
+
| **Ours** | 13.5M | **N/A** | Different modality (state vectors, not video) |
|
| 117 |
+
|
| 118 |
+
### Something-Something-v2 (Temporal Reasoning) β Top-1 Accuracy β
|
| 119 |
+
|
| 120 |
+
| Model | Accuracy |
|
| 121 |
+
|-------|----------|
|
| 122 |
+
| V-JEPA 2.1 ViT-G | **77.7%** |
|
| 123 |
+
| V-JEPA ViT-H/16 | 72.2% |
|
| 124 |
+
| **Ours** | **N/A** |
|
| 125 |
+
|
| 126 |
+
> **Note**: Our architecture operates on state vectors + bit-level memory, not pixels/video. The video benchmarks above are not directly applicable without adding a visual encoder front-end.
|
| 127 |
+
|
| 128 |
+
---
|
| 129 |
+
|
| 130 |
+
## 5. Architectural Comparison β Where We're Different
|
| 131 |
+
|
| 132 |
+
| Dimension | LeWM / JEPA Family | Our LeWorld Memory Architecture |
|
| 133 |
+
|-----------|-------------------|--------------------------------|
|
| 134 |
+
| **Memory** | Implicit (in network weights + latent state) | **Explicit bit-level RAM** (64K Γ 32-bit words, address-range access) |
|
| 135 |
+
| **State Prediction** | Single model predicts next embedding | **Hierarchical**: 3 SLMs find memory, 1 BLM aggregates + predicts |
|
| 136 |
+
| **Information Retrieval** | All in one forward pass | **Active retrieval**: BLM asks "what do I need?", SLMs fetch from memory |
|
| 137 |
+
| **Model Selection** | N/A (single model) | **Binary routing** [1,0,1]: BLM selects which SLMs to trust |
|
| 138 |
+
| **Collapse Prevention** | SIGReg (LeWM), EMA (V-JEPA), frozen encoder (DINO-WM) | **Diversity loss** + load-balance loss + temperature annealing |
|
| 139 |
+
| **Training** | Single loss (LeWM: 2 terms) | **3-phase**: pre-train β joint β info-request refinement |
|
| 140 |
+
| **Params** | 15M (LeWM), 632M (V-JEPA), 1.9B (V-JEPA 2.1) | **13.5M** (3Γ745K SLMs + 11.2M BLM) |
|
| 141 |
+
| **Input Modality** | Pixels / video frames | State vectors + characteristics (extensible to pixels with encoder) |
|
| 142 |
+
| **Planning** | CEM in latent space | BLM next-state prediction + info-request loop |
|
| 143 |
+
| **Gradient through discrete** | N/A (continuous latent space) | **ST-Sigmoid** for routing, **product-key CE** for addressing |
|
| 144 |
+
|
| 145 |
+
### What Our Architecture Adds That JEPA Doesn't Have
|
| 146 |
+
|
| 147 |
+
1. **Explicit addressable memory** β JEPA has no equivalent. All "memory" in JEPA is implicit in weights. Our architecture has a literal 256KB RAM that models can read/write to by address.
|
| 148 |
+
|
| 149 |
+
2. **Multi-agent retrieval** β 3 independent SLMs each search different memory regions. This is like having 3 specialized "attention heads" that look at different parts of a knowledge base, with a gating mechanism that selects the most useful ones.
|
| 150 |
+
|
| 151 |
+
3. **Active information request** β The BLM generates "what do I need next?" queries that influence what SLMs look for. JEPA models have no equivalent β they receive all information passively.
|
| 152 |
+
|
| 153 |
+
4. **CPU-inspired structure** β Address bus β RAM β data bus β processor pipeline mirrors actual computer architecture. This structural prior could help with systematic, compositional reasoning that neural networks typically struggle with.
|
| 154 |
+
|
| 155 |
+
---
|
| 156 |
+
|
| 157 |
+
## 6. What Benchmarks We Need to Run (Roadmap)
|
| 158 |
+
|
| 159 |
+
### Tier 1 β Must Run (direct comparison with LeWM/DINO-WM)
|
| 160 |
+
|
| 161 |
+
| Benchmark | What's Needed | Expected Difficulty |
|
| 162 |
+
|-----------|--------------|-------------------|
|
| 163 |
+
| **Push-T** | Add pixel encoder to our architecture, train on Push-T trajectories | Medium β need ~18K trajectories, visual encoder front-end |
|
| 164 |
+
| **PointMaze/Wall** | Same as above | Easy β simple navigation |
|
| 165 |
+
| **OGBench-Cube** | Same + 3D rendering | Medium-Hard |
|
| 166 |
+
| **Physical Probing** | Train linear/MLP probes on our latent space | Easy β we already have latent representations |
|
| 167 |
+
| **VoE (Violation of Expectation)** | Inject anomalies, measure surprise | Easy β our architecture naturally computes prediction error |
|
| 168 |
+
|
| 169 |
+
### Tier 2 β High-Impact Differentiators
|
| 170 |
+
|
| 171 |
+
| Benchmark | Why It Matters | Our Advantage |
|
| 172 |
+
|-----------|---------------|---------------|
|
| 173 |
+
| **IntPhys 2** | ALL JEPA models fail (β€57.5% vs 96.4% human) | Our explicit memory could help with object permanence |
|
| 174 |
+
| **Long-horizon planning** | JEPA models degrade over long rollouts | Our info-request loop provides feedback for multi-step |
|
| 175 |
+
| **Memory-dependent tasks** | Tasks requiring recall of past observations | **Direct advantage** β our architecture has literal memory |
|
| 176 |
+
|
| 177 |
+
### Tier 3 β Efficiency Benchmarks
|
| 178 |
+
|
| 179 |
+
| Metric | LeWM | Our Target |
|
| 180 |
+
|--------|------|-----------|
|
| 181 |
+
| Planning time | <1 second | Should be comparable (similar param count) |
|
| 182 |
+
| Training time | Single GPU, few hours | Same β 13.5M params |
|
| 183 |
+
| Training data efficiency | Scales with dataset size | To be measured |
|
| 184 |
+
|
| 185 |
+
---
|
| 186 |
+
|
| 187 |
+
## 7. Honest Assessment β Strengths and Weaknesses
|
| 188 |
+
|
| 189 |
+
### Where Our Architecture Should Excel (Hypotheses)
|
| 190 |
+
|
| 191 |
+
1. **Memory-dependent tasks**: Any task where the agent must remember and recall past observations to make current decisions. JEPA has no explicit memory β it's all in the latent state. Our 64K-word memory is persistent.
|
| 192 |
+
|
| 193 |
+
2. **Compositional state tracking**: Tasks with multiple objects where different "aspects" of the state need different information sources. Our 3 SLMs can specialize (one tracks the agent, one tracks the object, one tracks the environment).
|
| 194 |
+
|
| 195 |
+
3. **Anomaly detection / physics violation**: Our explicit memory + multi-step prediction error should catch "impossible" events better than implicit models. The info-request loop acts as an active hypothesis tester.
|
| 196 |
+
|
| 197 |
+
4. **Interpretability**: You can literally inspect which memory addresses were read, which SLMs were selected, what the info-request query was. JEPA is a black box.
|
| 198 |
+
|
| 199 |
+
### Where Our Architecture Will Likely Struggle
|
| 200 |
+
|
| 201 |
+
1. **Raw pixel processing**: Our current architecture works on state vectors. Adding a visual encoder is engineering work β but JEPA models are built pixel-first.
|
| 202 |
+
|
| 203 |
+
2. **Large-scale visual representation**: V-JEPA 2.1 at 1.9B params has seen millions of videos. Our 13.5M model can't compete on raw representation quality for visual tasks.
|
| 204 |
+
|
| 205 |
+
3. **Simple tasks**: LeWM already struggles on trivial environments (TwoRoom). Our more complex architecture might face similar issues β the overhead of memory + routing may not help when the task is simple.
|
| 206 |
+
|
| 207 |
+
4. **Training stability**: 3-phase training is more complex than LeWM's elegant 2-loss setup. More things can go wrong.
|
| 208 |
+
|
| 209 |
+
---
|
| 210 |
+
|
| 211 |
+
## 8. Comparison Summary Table
|
| 212 |
+
|
| 213 |
+
| | I-JEPA | V-JEPA | DINO-WM | LeWM | V-JEPA 2.1 | **Ours** |
|
| 214 |
+
|---|---|---|---|---|---|---|
|
| 215 |
+
| **Params** | 632M | 632M | ~300M | 15M | 1.9B | **13.5M** |
|
| 216 |
+
| **Input** | Images | Video | Pixels+Act | Pixels+Act | Video | State vec |
|
| 217 |
+
| **Memory** | None | None | None | None | None | **Explicit 256KB** |
|
| 218 |
+
| **Multi-model routing** | No | No | No | No | No | **Yes** |
|
| 219 |
+
| **Active info request** | No | No | No | No | No | **Yes** |
|
| 220 |
+
| **Push-T SR** | β | β | 0.90 | 0.88 | β | β TBD |
|
| 221 |
+
| **Maze SR** | β | β | 0.98 | β | β | β TBD |
|
| 222 |
+
| **Reach SR** | β | β | 0.92 | β | β | β TBD |
|
| 223 |
+
| **IntPhys 2** | β | β | β | β | 57.5% | β TBD |
|
| 224 |
+
| **K400 Acc** | β | 81.9% | β | β | ~88% | N/A |
|
| 225 |
+
| **Planning Speed** | β | β | ~48s | **<1s** | β | ~<1s (est) |
|
| 226 |
+
| **Training** | 16ΓA100 | Cluster | Offline | **1 GPU** | Cluster | **1 GPU** |
|
| 227 |
+
| **Interpretable** | Low | Low | Low | Low | Low | **High** |
|
| 228 |
+
|
| 229 |
+
---
|
| 230 |
+
|
| 231 |
+
## 9. Next Steps to Get Real Numbers
|
| 232 |
+
|
| 233 |
+
1. **Add visual encoder** to our architecture (small CNN or ViT-Tiny) for pixel observations β enables Push-T, Maze, Reach benchmarks
|
| 234 |
+
2. **Integrate with `stable-worldmodel` evaluation suite** (arxiv:2602.08968) for standardized comparison
|
| 235 |
+
3. **Run Push-T first** β most-used benchmark, open code, our architecture could show SLM specialization
|
| 236 |
+
4. **Design memory-dependent benchmark** β a custom task where agents MUST recall past observations to solve current goals. This is where we should clearly beat all JEPA models.
|
| 237 |
+
|
| 238 |
+
---
|
| 239 |
+
|
| 240 |
+
## 10. References
|
| 241 |
+
|
| 242 |
+
| Paper | ArXiv ID | Key Numbers |
|
| 243 |
+
|-------|----------|-------------|
|
| 244 |
+
| I-JEPA | 2301.08243 | ImageNet linear: 80%+, 632M params |
|
| 245 |
+
| V-JEPA | 2404.08471 | K400: 81.9%, SSv2: 72.2%, 632M params |
|
| 246 |
+
| DINO-WM | 2411.04983 | Push-T: 0.90 SR, Reach: 0.92 SR |
|
| 247 |
+
| LeWM | 2603.19312 | Push-T: 0.88 SR, 15M params, <1s planning, 48Γ faster |
|
| 248 |
+
| V-JEPA 2.1 | 2603.14482 | Ego4D: 7.71 mAP, SSv2: 77.7%, 1.9B params |
|
| 249 |
+
| IntPhys 2 | 2506.09849 | V-JEPA 2: 57.5%, Human: 96.4% |
|
| 250 |
+
| JEPA-WMs study | 2512.24497 | CEM best planner, proprioception critical |
|
| 251 |
+
| DreamerV3 | 2301.04104 | Atari SOTA, Push-T: 0.30 SR |
|
| 252 |
+
| LeCun position paper | 2306.02572 | Theoretical H-JEPA architecture |
|