Update dataset card with current evaluation results
Browse files
README.md
CHANGED
|
@@ -19,267 +19,234 @@ size_categories:
|
|
| 19 |
|
| 20 |
# Reasoning-Structured Videos
|
| 21 |
|
| 22 |
-
*
|
| 23 |
|
| 24 |
-
|
| 25 |
|
| 26 |
-
-
|
| 27 |
-
- **Loop** `T_A(s₀) = s₀` — a topologically closed action sequence closes in state space.
|
| 28 |
-
- **Equivalence** `T_A(s₀) = T_B(s₀), A ≠ B` — two distinct sequences reach the same state.
|
| 29 |
|
| 30 |
-
|
|
|
|
|
|
|
| 31 |
|
| 32 |
-
|
| 33 |
|
| 34 |
-
-
|
| 35 |
|
| 36 |
-
## Dataset at a
|
| 37 |
|
| 38 |
| Field | Value |
|
| 39 |
|---|---|
|
| 40 |
| Engine | Unreal Engine 5 |
|
| 41 |
-
| Scenes |
|
| 42 |
-
| Modality | RGB
|
| 43 |
-
| Resolution /
|
| 44 |
-
|
|
| 45 |
-
| Action space | 9 discrete primitives:
|
| 46 |
-
| Action grid |
|
| 47 |
-
|
|
| 48 |
-
|
|
| 49 |
-
|
|
| 50 |
-
|
| 51 |
-
This release is the **pixel-validated test corpus** used in the companion paper's Tables 1–2 (Easy tier) and the Hard-tier supplement. Trajectories whose realised pose deviated from the expected pose by > 1 cm at any step were routed to a `random_walk/` split during rendering and are **not included** here — every released trajectory has its algebraic identity holding exactly (Layer 1: pose check) and validated to MSE tolerance on captured frames (Layer 2: pixel check).
|
| 52 |
-
|
| 53 |
-
### Per-split breakdown
|
| 54 |
-
|
| 55 |
-
| Split | Tier | # trajectories | # mp4 files | Size (compressed) | Construction |
|
| 56 |
-
|---|---|---|---|---|---|
|
| 57 |
-
| `inverse_easy` | Easy | 246 | 246 | 2.09 GB | Sampled `A` ‖ `no_op`-pad ‖ `A⁻¹` |
|
| 58 |
-
| `inverse_hard` | Hard | 202 | 202 | 1.99 GB | `A·A⁻¹` mixing rotations (non-abelian witness) |
|
| 59 |
-
| `loop_easy` | Easy | 247 | 247 | 2.17 GB | Five-stage discrete return |
|
| 60 |
-
| `loop_hard` | Hard | 198 | 198 | 2.27 GB | Topologically closed polygons (rectangle / triangle / hexagon) |
|
| 61 |
-
| `equivalence_easy` | Easy | 484 (= 242 paired pairs) | 484 | 4.56 GB | Stage-1 commutative shuffle / Stage-2 L-shape vs. zig-zag |
|
| 62 |
-
|
| 63 |
-
Equivalence trajectories are released as `(A, B)` pairs; both halves of each pair are present in `equivalence_easy`. Hard-tier Equivalence is held back for a future release.
|
| 64 |
-
|
| 65 |
-
---
|
| 66 |
-
|
| 67 |
-
## How the Data Is Constructed
|
| 68 |
-
|
| 69 |
-
For each scene, root states are sampled on a 200 cm XY grid with 8 yaw orientations per cell and filtered by capsule-overlap tests against scene geometry. From every valid root, trajectories are emitted by one of three constructive families so the algebraic identity holds **exactly on the captured frames**, absent collision:
|
| 70 |
|
| 71 |
-
|
| 72 |
-
- **Loop paths.** Two complementary constructions: (i) sampled exploration plus a five-stage discrete return (yaw → pitch → forward/backward → lateral) accepted only when residuals fall below 0.45 Δ horizontal / 0.3 Δ vertical; (ii) **topologically closed polygons** (rectangle / triangle / hexagon) whose closure is exact by polygon geometry.
|
| 73 |
-
- **Equivalent paths.** Stage 1 — Fisher–Yates shuffle within each maximal mono-type segment of consecutive translations or consecutive rotations (commutative shuffle); Stage 2 fallback — matched **L-shape** `Uᵐ Vⁿ` vs. **zig-zag** `(UV)ᵏ Uᵐ⁻ᵏ Vⁿ⁻ᵏ` pairs (`m, n ∈ [3, 6]`) with self-inverse rotation pairs filling remaining slots, sharing only origin and terminus with disjoint interiors.
|
| 74 |
|
| 75 |
-
###
|
| 76 |
|
| 77 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 78 |
|
| 79 |
-
|
| 80 |
-
- **Hard tier** — defended against shortcut attacks (e.g. MIND-style symmetric round-trip baselines). Released splits:
|
| 81 |
-
- `inverse_hard` — `A·A⁻¹` whose `A` mixes translations *and* rotations, providing a **non-abelian witness** that cannot be solved by treating the inverse half as a literal time-reversal.
|
| 82 |
-
- `loop_hard` — pure geometric polygon templates (rectangle / triangle / hexagon) that are *not* decomposable into Inverse, so a model cannot pass Loop simply by passing Inverse.
|
| 83 |
|
| 84 |
-
|
| 85 |
-
|
| 86 |
-
## Deterministic Capture Pipeline
|
| 87 |
-
|
| 88 |
-
To make the rendering function `g: S → X` effectively deterministic — required for any cross-path pixel comparison to be attributable to the model rather than to scene drift — the renderer applies:
|
| 89 |
|
| 90 |
-
|
| 91 |
-
- 15 warm-up frames discarded after every teleport (Lumen GI / auto-exposure settling);
|
| 92 |
-
- temporally unstable effects disabled (motion blur, depth-of-field, lens flares, ray tracing);
|
| 93 |
-
- rigid capsule embodiment (radius 34 cm, half-height 88 cm) with the camera 60 cm above its centre.
|
| 94 |
|
| 95 |
-
|
| 96 |
-
|
| 97 |
-
---
|
| 98 |
|
| 99 |
-
|
| 100 |
|
| 101 |
-
|
| 102 |
|
| 103 |
-
```
|
| 104 |
-
|
| 105 |
├── inverse_easy/
|
| 106 |
-
│ ├── run_<
|
| 107 |
-
│ └── run_<
|
| 108 |
├── inverse_hard/
|
| 109 |
-
│ └── ...
|
| 110 |
├── loop_easy/
|
| 111 |
-
│ └── ...
|
| 112 |
├── loop_hard/
|
| 113 |
-
│ └── ...
|
| 114 |
└── equivalence_easy/
|
| 115 |
-
├── run_<
|
| 116 |
-
├── run_<
|
| 117 |
-
├── run_<
|
| 118 |
-
└── run_<
|
| 119 |
```
|
| 120 |
|
| 121 |
-
|
| 122 |
-
|
| 123 |
-
- **Single-trajectory splits** (`*_easy` for Inverse / Loop, `*_hard`): `run_<RUN_TIMESTAMP>__traj_<TRAJ_ID>.mp4` paired with `..._meta.json`.
|
| 124 |
-
- **Equivalence pairs**: `run_<RUN_TIMESTAMP>__pair_<PAIR_ID>_<A|B>_traj_<TRAJ_ID>.mp4` — the `pair_<PID>` token uniquely identifies the (A, B) pair across the split, and the `_A_` / `_B_` token disambiguates the two halves. The two halves' `TRAJ_ID`s are always consecutive.
|
| 125 |
|
| 126 |
-
|
| 127 |
|
| 128 |
```json
|
| 129 |
{
|
| 130 |
"trajectory_id": 353,
|
| 131 |
-
"data_type": "reasoning",
|
| 132 |
"trajectory_type": "inverse",
|
| 133 |
-
"algebraic_property": "inverse: A ∘ A⁻¹ = id (explore then reverse)",
|
| 134 |
-
"paired_trajectory": {
|
| 135 |
-
"is_paired": false
|
| 136 |
-
},
|
| 137 |
-
"has_collision": false,
|
| 138 |
-
"collision_count": 0,
|
| 139 |
"total_steps": 40,
|
| 140 |
"frames_per_step": 9,
|
| 141 |
"total_frames": 360,
|
| 142 |
-
"
|
| 143 |
-
|
| 144 |
-
|
| 145 |
-
|
| 146 |
-
"modalities": ["rgb", "depth"]
|
| 147 |
-
},
|
| 148 |
-
"root_state": {
|
| 149 |
-
"position": [-2490.0, 1200.0, 400.0],
|
| 150 |
-
"rotation": [0.0, 240.0, 0.0]
|
| 151 |
-
},
|
| 152 |
-
"action_sequence": ["move_right", "turn_right", "look_down", "...", "move_left"],
|
| 153 |
-
"collision_mask": [0, 0, 0, "..."],
|
| 154 |
-
"steps": [
|
| 155 |
-
{
|
| 156 |
-
"step": 0,
|
| 157 |
-
"action": "move_right",
|
| 158 |
-
"action_id": 3,
|
| 159 |
-
"start_pos": [-2490.0, 1200.0, 400.0],
|
| 160 |
-
"start_rot": [0.0, -120.0, 0.0],
|
| 161 |
-
"expected_end_pos": [-2403.4, 1150.0, 400.0],
|
| 162 |
-
"actual_end_pos": [-2403.4, 1150.0, 400.0],
|
| 163 |
-
"actual_end_rot": [0.0, -120.0, 0.0],
|
| 164 |
-
"collision": false,
|
| 165 |
-
"collision_displacement": 0.0,
|
| 166 |
-
"frame_dir": "step_00"
|
| 167 |
-
}
|
| 168 |
-
],
|
| 169 |
-
"video_encoding": {"fps": 16.0, "crf": 28, "resolution": "1280x720", "codec": "libx264"}
|
| 170 |
}
|
| 171 |
```
|
| 172 |
|
| 173 |
-
|
| 174 |
|
| 175 |
-
``
|
| 176 |
-
"paired_trajectory": {
|
| 177 |
-
"is_paired": true,
|
| 178 |
-
"role": "path_A",
|
| 179 |
-
"primary_trajectory_id": 23,
|
| 180 |
-
"partner_trajectory_id": 24,
|
| 181 |
-
"relation": "path_A and path_B are commutative shuffles, should reach same final state"
|
| 182 |
-
}
|
| 183 |
-
```
|
| 184 |
|
| 185 |
-
|
| 186 |
|
| 187 |
-
---
|
| 188 |
|
| 189 |
-
##
|
| 190 |
|
| 191 |
-
The
|
| 192 |
|
| 193 |
-
|
| 194 |
-
- **Self-consistency tier.** `Inv-SC`, `Loop-SC`, `Equiv-SC` compare two rollouts of the **same** model to each other (start vs. end of `A ‖ A⁻¹`; endpoints of equivalent `A`, `B`). SC is **invariant to any uniform reparameterisation of the action space** and is therefore well-defined across frameworks with heterogeneous action interfaces (continuous keyboard-mouse vectors, dual categorical indices, pose deltas, etc.).
|
| 195 |
|
| 196 |
-
|
| 197 |
|
| 198 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 199 |
|
| 200 |
-
|
| 201 |
|
| 202 |
-
|
| 203 |
-
|---|---|---|---|
|
| 204 |
-
| Chunk-AR (~420 M, ours) | **16.63** | **18.76** | **18.37** |
|
| 205 |
-
| Matrix-Game 2.0 | 11.08 | 11.03 | 13.24 |
|
| 206 |
-
| Infinite-World | 12.55 | 12.72 | 13.23 |
|
| 207 |
|
| 208 |
-
|
|
|
|
|
|
|
|
|
|
| 209 |
|
| 210 |
-
--
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 211 |
|
| 212 |
-
|
| 213 |
|
| 214 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 215 |
|
| 216 |
```python
|
| 217 |
import json
|
| 218 |
from glob import glob
|
| 219 |
from pathlib import Path
|
| 220 |
|
| 221 |
-
ROOT = Path("result_dataset")
|
| 222 |
|
| 223 |
def load_split(split_name):
|
| 224 |
-
|
| 225 |
-
out = []
|
| 226 |
for meta_path in sorted(glob(str(ROOT / split_name / "*_meta.json"))):
|
| 227 |
with open(meta_path, "r", encoding="utf-8") as f:
|
| 228 |
meta = json.load(f)
|
| 229 |
-
|
| 230 |
-
|
| 231 |
-
return out
|
| 232 |
-
|
| 233 |
-
inv_easy = load_split("inverse_easy") # 246 trajectories
|
| 234 |
-
inv_hard = load_split("inverse_hard") # 202 trajectories
|
| 235 |
-
loop_easy = load_split("loop_easy") # 247 trajectories
|
| 236 |
-
loop_hard = load_split("loop_hard") # 198 trajectories
|
| 237 |
-
equiv_easy = load_split("equivalence_easy") # 484 trajectories = 242 (A,B) pairs
|
| 238 |
-
|
| 239 |
-
# Reconstruct Equivalence (A, B) pairs by partner_trajectory_id
|
| 240 |
-
pairs = {}
|
| 241 |
-
for mp4, meta in equiv_easy:
|
| 242 |
-
pid = meta["paired_trajectory"]["primary_trajectory_id"]
|
| 243 |
-
pairs.setdefault(pid, {})[meta["paired_trajectory"]["role"]] = (mp4, meta)
|
| 244 |
-
# now pairs[pid] = {"path_A": (mp4, meta), "path_B": (mp4, meta)}
|
| 245 |
-
```
|
| 246 |
-
|
| 247 |
-
Decoding the videos (any of OpenCV / `decord` / `torchvision.io.read_video` works):
|
| 248 |
|
| 249 |
-
|
| 250 |
-
|
| 251 |
-
|
| 252 |
-
frames = vr.get_batch(range(len(vr))).asnumpy() # (360, 720, 1280, 3) uint8
|
| 253 |
-
actions = meta["action_sequence"] # length 40
|
| 254 |
-
# Frame i belongs to action floor(i / 9); per-step pose lives in meta["steps"][i // 9].
|
| 255 |
```
|
| 256 |
|
| 257 |
-
For
|
| 258 |
-
|
| 259 |
-
---
|
| 260 |
|
| 261 |
-
##
|
| 262 |
|
| 263 |
-
|
| 264 |
|
| 265 |
-
|
|
|
|
| 266 |
|
| 267 |
-
|
| 268 |
-
|
| 269 |
-
---
|
| 270 |
|
| 271 |
-
##
|
| 272 |
|
| 273 |
-
|
| 274 |
|
| 275 |
## Citation
|
| 276 |
|
| 277 |
```bibtex
|
| 278 |
@inproceedings{reasoningstructuredvideos2026,
|
| 279 |
title = {Reasoning-Structured Videos: A Stratified Diagnostic Suite for Compositional Consistency in World Models},
|
| 280 |
-
author = {
|
| 281 |
-
booktitle = {Advances in Neural Information Processing Systems (NeurIPS) Datasets and Benchmarks Track},
|
| 282 |
-
year = {2026}
|
| 283 |
-
note = {Under review}
|
| 284 |
}
|
| 285 |
```
|
|
|
|
| 19 |
|
| 20 |
# Reasoning-Structured Videos
|
| 21 |
|
| 22 |
+
*Updated 17 September 2026: corrected release description and added the latest completed R20/R50 evaluations.*
|
| 23 |
|
| 24 |
+
**A stratified diagnostic suite for compositional consistency in action-conditioned video world models.**
|
| 25 |
|
| 26 |
+
Reasoning-Structured Videos is a deterministic Unreal Engine 5 video benchmark in which trajectories are organised as rooted graphs rather than as independent clips. The graph construction exposes three path-level relations that a faithful transition model should respect:
|
|
|
|
|
|
|
| 27 |
|
| 28 |
+
- **Inverse:** execute a path and its reverse; the endpoint should return to the observed root.
|
| 29 |
+
- **Loop:** follow a closed route and revisit the root state.
|
| 30 |
+
- **Equivalence:** follow two distinct paths that are constructed to reach the same endpoint.
|
| 31 |
|
| 32 |
+
These relations test consistency across action histories. They complement, rather than replace, conventional quality measures such as FVD, LPIPS, and PSNR: the benchmark separates reference fidelity, internal cross-path agreement, relation-specific failure, and horizon-dependent drift.
|
| 33 |
|
| 34 |
+
> Companion paper: *Reasoning-Structured Videos: A Stratified Diagnostic Suite for Compositional Consistency in World Models* (NeurIPS 2026 Datasets & Benchmarks Track).
|
| 35 |
|
| 36 |
+
## Dataset at a glance
|
| 37 |
|
| 38 |
| Field | Value |
|
| 39 |
|---|---|
|
| 40 |
| Engine | Unreal Engine 5 |
|
| 41 |
+
| Scenes | Approximately 30 indoor, outdoor, and mixed environments |
|
| 42 |
+
| Modality in this release | RGB H.264 video plus JSON metadata |
|
| 43 |
+
| Resolution / frame rate | 1280 × 720, 16 fps |
|
| 44 |
+
| Logical trajectory | 40 actions × 9 frames/action = 360 frames (22.5 s) |
|
| 45 |
+
| Action space | 9 discrete primitives: forward/backward/left/right, turn left/right, look up/down, and no-op |
|
| 46 |
+
| Action grid | Translation step 100 cm; yaw step 15°; pitch step 7.5° |
|
| 47 |
+
| Camera | 79° horizontal FOV, Habitat convention |
|
| 48 |
+
| Released records | 1,377 RGB videos and 1,377 matching metadata JSON files |
|
| 49 |
+
| License | CC BY 4.0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 50 |
|
| 51 |
+
The release contains pixel-validated, collision-free reasoning trajectories. Invalid or colliding renders are not counted in the relation-evaluation splits. Depth was captured during rendering but is not included in the current public upload; this is an RGB-only release.
|
|
|
|
|
|
|
| 52 |
|
| 53 |
+
### Split counts
|
| 54 |
|
| 55 |
+
| Split | Tier | Trajectories / videos | Relation units |
|
| 56 |
+
|---|---:|---:|---:|
|
| 57 |
+
| `inverse_easy` | Easy | 246 | 246 paths |
|
| 58 |
+
| `inverse_hard` | Hard | 202 | 202 paths |
|
| 59 |
+
| `loop_easy` | Easy | 247 | 247 paths |
|
| 60 |
+
| `loop_hard` | Hard | 198 | 198 paths |
|
| 61 |
+
| `equivalence_easy` | Easy | 484 | 242 paired graphs (A/B) |
|
| 62 |
+
| **Total** | | **1,377** | **1,135 relation units** |
|
| 63 |
|
| 64 |
+
The repository stores the five splits as flat directories. Each video is paired with a `_meta.json` file. An additional `equivalence.zip` archive mirrors the Equivalence split; it is not a separate evaluation split.
|
|
|
|
|
|
|
|
|
|
| 65 |
|
| 66 |
+
## How the trajectories are constructed
|
|
|
|
|
|
|
|
|
|
|
|
|
| 67 |
|
| 68 |
+
Root states are sampled on a 200 cm XY grid with eight yaw orientations per cell and filtered using scene-geometry collision checks. The relation constructors then generate paths with explicit endpoint identities:
|
|
|
|
|
|
|
|
|
|
| 69 |
|
| 70 |
+
- **Inverse:** a multi-step path is concatenated with its action-wise reverse and padded to the fixed horizon. Translation and rotation blocks are mixed so that the return cannot be reduced to a purely visual shortcut.
|
| 71 |
+
- **Loop:** the release contains both exploration-and-return paths accepted under a documented residual tolerance and geometrically closed polygon paths (rectangle, triangle, or hexagon). The metadata records the construction branch.
|
| 72 |
+
- **Equivalence:** alternative paths are generated by commutative segment shuffles or matched L-shape/zig-zag constructions. Both branches share the intended root and terminal state while differing in their intermediate histories.
|
| 73 |
|
| 74 |
+
The metadata records the relation, branch or pair identifier, action sequence, root state, per-step expected and realised poses, collision mask, and render configuration. Relation labels are therefore available without reconstructing them from pixels.
|
| 75 |
|
| 76 |
+
## File layout
|
| 77 |
|
| 78 |
+
```text
|
| 79 |
+
dataset/
|
| 80 |
├── inverse_easy/
|
| 81 |
+
│ ├── run_<timestamp>__traj_<id>.mp4
|
| 82 |
+
│ └── run_<timestamp>__traj_<id>_meta.json
|
| 83 |
├── inverse_hard/
|
|
|
|
| 84 |
├── loop_easy/
|
|
|
|
| 85 |
├── loop_hard/
|
|
|
|
| 86 |
└── equivalence_easy/
|
| 87 |
+
├── run_<timestamp>__pair_<pid>_A_traj_<id>.mp4
|
| 88 |
+
├── run_<timestamp>__pair_<pid>_A_traj_<id>_meta.json
|
| 89 |
+
├── run_<timestamp>__pair_<pid>_B_traj_<id>.mp4
|
| 90 |
+
└── run_<timestamp>__pair_<pid>_B_traj_<id>_meta.json
|
| 91 |
```
|
| 92 |
|
| 93 |
+
For Equivalence, `pair_<pid>` identifies one graph unit and `_A_`/`_B_` identifies its two branches. The two branch trajectory IDs are consecutive.
|
|
|
|
|
|
|
|
|
|
| 94 |
|
| 95 |
+
Each metadata file contains, among other fields:
|
| 96 |
|
| 97 |
```json
|
| 98 |
{
|
| 99 |
"trajectory_id": 353,
|
|
|
|
| 100 |
"trajectory_type": "inverse",
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 101 |
"total_steps": 40,
|
| 102 |
"frames_per_step": 9,
|
| 103 |
"total_frames": 360,
|
| 104 |
+
"root_state": {"position": [-2490.0, 1200.0, 400.0]},
|
| 105 |
+
"action_sequence": ["move_right", "turn_right", "..."],
|
| 106 |
+
"collision_mask": [0, 0, 0],
|
| 107 |
+
"render_config": {"resolution": [1280, 720], "fov": 79.0}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 108 |
}
|
| 109 |
```
|
| 110 |
|
| 111 |
+
## Evaluation protocol
|
| 112 |
|
| 113 |
+
The evaluator accepts an action-conditioned generator through a `rollout(context, controls) -> frames` interface; no retraining is required.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 114 |
|
| 115 |
+
**GT-anchor tier — reference fidelity.** Compare generated endpoints with the released GT endpoint using LPIPS and PSNR. This tier is most interpretable when the model's control and conditioning interface is calibrated to the benchmark.
|
| 116 |
|
| 117 |
+
**Self-consistency tier — internal coherence.** Compare relation-defined endpoints produced by the same model: Inverse/Loop compare the returned endpoint with the root reference, while Equivalence compares the generated A/B endpoints. SC detects cross-history disagreement but does not by itself certify that the agreed output is the correct GT state; a constant or jointly wrong output can obtain a deceptively good agreement score. SC should therefore be read jointly with GT fidelity and motion/validity checks.
|
| 118 |
|
| 119 |
+
## Reference evaluations
|
| 120 |
|
| 121 |
+
The tables below summarise the latest completed evaluations associated with this release. LPIPS is lower-is-better and PSNR is higher-is-better. Values are endpoint means; the paper and evaluation artifact contain confidence intervals and per-graph records.
|
| 122 |
|
| 123 |
+
### Native-interface self-consistency
|
|
|
|
| 124 |
|
| 125 |
+
These original full-set evaluations use each model's documented native control interface. They provide broad diagnostic profiles, not a capacity-controlled universal ranking.
|
| 126 |
|
| 127 |
+
| Model | Inverse LPIPS / PSNR | Loop LPIPS / PSNR | Equivalence LPIPS / PSNR |
|
| 128 |
+
|---|---:|---:|---:|
|
| 129 |
+
| Chunk-AR | 0.45 / 12.57 | 0.65 / 13.98 | 0.52 / 14.75 |
|
| 130 |
+
| Matrix-Game 2.0 | 0.71 / 10.45 | 0.72 / 10.62 | 0.59 / 12.57 |
|
| 131 |
+
| Infinite-World | 0.60 / 12.02 | 0.67 / 11.47 | 0.60 / 12.14 |
|
| 132 |
|
| 133 |
+
### Common-camera R50 self-consistency
|
| 134 |
|
| 135 |
+
HY-WorldPlay and minWM receive the same frozen graph IDs and camera trajectories through their official pose-control pathways. The track contains 50 graph units per relation and 200 rollout videos in total. Both models completed all 200 rollouts.
|
|
|
|
|
|
|
|
|
|
|
|
|
| 136 |
|
| 137 |
+
| Model | Inverse LPIPS / PSNR | Loop LPIPS / PSNR | Equivalence LPIPS / PSNR |
|
| 138 |
+
|---|---:|---:|---:|
|
| 139 |
+
| HY-WorldPlay | **0.4597 / 15.07** | **0.4941 / 15.50** | **0.3723 / 16.94** |
|
| 140 |
+
| minWM | 0.7118 / 10.46 | 0.7442 / 10.85 | 0.4437 / 14.05 |
|
| 141 |
|
| 142 |
+
The relation-dependent gaps are informative: HY–minWM LPIPS differs by about 0.25 on Inverse/Loop but only 0.071 on Equivalence. This is a controlled common-camera comparison, but it does not equalise model capacity, training data, architecture, or memory.
|
| 143 |
+
|
| 144 |
+
### Additional camera-trajectory R20 evaluations
|
| 145 |
+
|
| 146 |
+
R20 contains 20 graph units per relation and 80 rollout videos per configuration because Equivalence retains both A/B branches. All rows below completed 80/80 rollouts without failures. These are configuration profiles rather than a single strict ranking: HY R20 uses 416 × 240 evaluation output, while the other rows use 512 × 288 endpoint preprocessing; SANA-WM generated at 640 × 352 and was evaluated after the common endpoint resize. Matrix-Game is shown separately because its R20 row uses native controls.
|
| 147 |
+
|
| 148 |
+
| Configuration | Inverse LPIPS / PSNR | Loop LPIPS / PSNR | Equivalence LPIPS / PSNR |
|
| 149 |
+
|---|---:|---:|---:|
|
| 150 |
+
| HY-WorldPlay (R20) | 0.4038 / 16.12 | 0.4562 / 15.48 | 0.3542 / 17.37 |
|
| 151 |
+
| minWM (R20) | 0.7229 / 10.46 | 0.7442 / 11.08 | 0.4227 / 14.05 |
|
| 152 |
+
| MagicWorld-Base | 0.7034 / 12.44 | 0.6935 / 12.09 | 0.4486 / 16.98 |
|
| 153 |
+
| MiniWorld-0.5B (LM) | 0.7287 / 11.22 | 0.7394 / 10.62 | 0.6403 / 10.85 |
|
| 154 |
+
| MiniWorld-1B (server) | 0.6920 / 13.01 | 0.6997 / 12.89 | 0.4007 / 19.81 |
|
| 155 |
+
| LingBot-World-v2 Light 1.3B | 0.6084 / 12.18 | 0.6568 / 11.79 | 0.5302 / 15.06 |
|
| 156 |
+
| SANA-WM streaming 4-step 360P | 0.5703 / 13.34 | 0.5694 / 13.24 | 0.5778 / 13.50 |
|
| 157 |
+
| Matrix-Game 2.0 (native R20) | 0.6749 / 10.50 | 0.7379 / 9.84 | 0.5658 / 12.96 |
|
| 158 |
|
| 159 |
+
Useful observations are relation-specific rather than a universal ranking. Loop LPIPS is higher than Inverse in most evaluated configurations, while Equivalence can obtain a low SC distance even when both paths share an incorrect scene. The MiniWorld upgrade is a concrete example: Equivalence SC-LPIPS improves from 0.6403 to 0.4007, whereas matched GT-terminal LPIPS improves from 0.7938 to 0.7428 on the same outputs. Agreement and reference recovery are complementary axes.
|
| 160 |
|
| 161 |
+

|
| 162 |
+
|
| 163 |
+
*Relation-resolved LPIPS/PSNR profiles. Native-interface and camera-trajectory tracks are separated; the figure is descriptive and should be read with the protocol notes above.*
|
| 164 |
+
|
| 165 |
+
### GT-anchor and same-output reference audits
|
| 166 |
+
|
| 167 |
+
The following GT-anchor runs use model-native conditioning and should be interpreted within each model because the available GT context differs.
|
| 168 |
+
|
| 169 |
+
| Model / conditioning | Inverse LPIPS / PSNR | Loop LPIPS / PSNR | Equivalence LPIPS / PSNR |
|
| 170 |
+
|---|---:|---:|---:|
|
| 171 |
+
| HY-WorldPlay R50, 1 reference frame | 0.5212 / 14.15 | 0.5306 / 14.95 | 0.5820 / 13.73 |
|
| 172 |
+
| minWM R50, 180 GT context frames | 0.5710 / 12.93 | 0.6195 / 12.67 | 0.5824 / 13.59 |
|
| 173 |
+
| HY-WorldPlay R20, 1 reference frame | 0.4735 / 15.10 | 0.4883 / 15.21 | 0.5706 / 14.27 |
|
| 174 |
+
| minWM R20, 180 GT context frames | 0.5725 / 13.27 | 0.6055 / 12.76 | 0.5746 / 13.81 |
|
| 175 |
+
|
| 176 |
+
MiniWorld's same-output GT-terminal audit is also available for the R20 SC rollouts:
|
| 177 |
+
|
| 178 |
+
| Configuration | Inverse LPIPS / PSNR | Loop LPIPS / PSNR | Equivalence LPIPS / PSNR |
|
| 179 |
+
|---|---:|---:|---:|
|
| 180 |
+
| MiniWorld-0.5B LM | 0.7281 / 11.19 | 0.7450 / 10.55 | 0.7938 / 10.04 |
|
| 181 |
+
| MiniWorld-1B server | 0.6920 / 13.01 | 0.7023 / 12.86 | 0.7428 / 13.14 |
|
| 182 |
+
|
| 183 |
+
### Endpoint FID diagnostic
|
| 184 |
+
|
| 185 |
+
Endpoint FID is reported separately from SC because it measures proximity to the GT endpoint distribution and is sensitive to sample size and preprocessing. It should not be used as a strict cross-protocol ranking.
|
| 186 |
+
|
| 187 |
+
| Model / protocol | Inverse | Loop | Equivalence |
|
| 188 |
+
|---|---:|---:|---:|
|
| 189 |
+
| Matrix-Game full set | 134.94 | 141.33 | 145.55 |
|
| 190 |
+
| Matrix-Game R20 | 263.19 | 330.96 | 271.31 |
|
| 191 |
+
| HY-WorldPlay R50 | 118.25 | 138.23 | 156.76 |
|
| 192 |
+
| minWM R50 | 242.46 | 249.40 | 240.23 |
|
| 193 |
+
| HY-WorldPlay R20 | 138.72 | 182.29 | 186.72 |
|
| 194 |
+
| minWM R20 | 275.49 | 294.76 | 268.41 |
|
| 195 |
+
| MagicWorld-Base R20 | 318.99 | 325.09 | 300.92 |
|
| 196 |
+
|
| 197 |
+
## What the benchmark reveals
|
| 198 |
+
|
| 199 |
+
The evaluation is designed to produce a capability profile rather than a single leaderboard number:
|
| 200 |
+
|
| 201 |
+
1. **Reference fidelity and internal coherence can disagree.** Equivalence may have the best SC while having the weakest GT-anchor or Endpoint-FID result, because two generated paths can agree on a shared wrong scene.
|
| 202 |
+
2. **Relation-specific failures are visible.** Return relations test recovery of an observed root; Equivalence tests agreement between alternative histories. A model that is close on one relation need not be close on another.
|
| 203 |
+
3. **Long-horizon drift is measurable.** On the frozen horizon study, Matrix-Game Inverse LPIPS increases from 0.4851 at 10 actions to 0.7062 at 40 actions; minWM increases by 0.2697 LPIPS and HY-WorldPlay by 0.1039 on the corresponding R20 comparisons.
|
| 204 |
+
4. **Agreement is not sufficient evidence of correctness.** SC should be paired with GT-anchor or same-output GT-terminal checks, motion checks, and visual inspection. The benchmark retains low-information outputs in aggregate rather than silently removing them.
|
| 205 |
+
|
| 206 |
+
## Loading the data
|
| 207 |
|
| 208 |
```python
|
| 209 |
import json
|
| 210 |
from glob import glob
|
| 211 |
from pathlib import Path
|
| 212 |
|
| 213 |
+
ROOT = Path("result_dataset")
|
| 214 |
|
| 215 |
def load_split(split_name):
|
| 216 |
+
records = []
|
|
|
|
| 217 |
for meta_path in sorted(glob(str(ROOT / split_name / "*_meta.json"))):
|
| 218 |
with open(meta_path, "r", encoding="utf-8") as f:
|
| 219 |
meta = json.load(f)
|
| 220 |
+
records.append((meta_path.replace("_meta.json", ".mp4"), meta))
|
| 221 |
+
return records
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 222 |
|
| 223 |
+
inverse_easy = load_split("inverse_easy")
|
| 224 |
+
loop_easy = load_split("loop_easy")
|
| 225 |
+
equivalence_easy = load_split("equivalence_easy")
|
|
|
|
|
|
|
|
|
|
| 226 |
```
|
| 227 |
|
| 228 |
+
For Equivalence, group records using `paired_trajectory.primary_trajectory_id` and `paired_trajectory.role` (`path_A` or `path_B`). Videos can be decoded with OpenCV, `decord`, or another H.264 reader.
|
|
|
|
|
|
|
| 229 |
|
| 230 |
+
## Reproducibility and evaluation code
|
| 231 |
|
| 232 |
+
The companion evaluation artifact contains manifests, evaluators, fixed-seed R20/R50 subsets, model adapters, metric summaries, and saved rollout archives used for the reported results:
|
| 233 |
|
| 234 |
+
- [Evaluation artifact](https://huggingface.co/datasets/VideoWorldmodel/Evaluation)
|
| 235 |
+
- [Project page](https://reasoningvideo.github.io/reasoning-structured-videos/)
|
| 236 |
|
| 237 |
+
Metric recomputation from saved rollouts does not require model inference. Regenerating rollouts requires the corresponding official model repository, checkpoint, environment, and GPU. Cross-model numerical comparisons should report the control protocol, context length, resolution, and whether the row is native-interface, common-camera, GT-anchor, or same-output GT-terminal.
|
|
|
|
|
|
|
| 238 |
|
| 239 |
+
## Scope and limitations
|
| 240 |
|
| 241 |
+
The primary setting is deterministic, static, single-agent, human-scale navigation with action-conditioned video generation. Dynamic subjects, stochastic exogenous events, non-rigid physics, multi-agent interaction, and non-human-scale navigation require synchronized state annotations or complementary benchmarks. GT-anchor pixel metrics can conflate control-scale mismatch with generation error when interfaces are not aligned; the common-camera SC track reduces this confound but does not equalise all model factors.
|
| 242 |
|
| 243 |
## Citation
|
| 244 |
|
| 245 |
```bibtex
|
| 246 |
@inproceedings{reasoningstructuredvideos2026,
|
| 247 |
title = {Reasoning-Structured Videos: A Stratified Diagnostic Suite for Compositional Consistency in World Models},
|
| 248 |
+
author = {Qing, Zhongfei and Cai, Zhongang and Yang, Zhitao and Yang, Lei},
|
| 249 |
+
booktitle = {Advances in Neural Information Processing Systems (NeurIPS), Datasets and Benchmarks Track},
|
| 250 |
+
year = {2026}
|
|
|
|
| 251 |
}
|
| 252 |
```
|