Planners Exploit Deterministic Error: Dithered Low-Bit World Models
Planners Exploit Deterministic Error: Dithered Low-Bit World Models
This research abstract introduces a technique where sampling-based planners exploit deterministic errors introduced by round-to-nearest activation quantization. By applying shared dither redrawn at every iteration, the authors demonstrate that planning collapse can be significantly reduced in low-bit world models (e.g., W8A4 integer) without calibration or training. The study reports speedups of 1.9-3.3x for planning rollouts and 1.3-1.5x for whole planning steps on an Ampere GPU compared to FP32, alongside improved success rates in affected tasks within the TD-MPC2 benchmark suite.
The paper presents a method using dithered low-bit quantization to mitigate planning collapse in world model-based control, reporting speedups on an Ampere GPU and success rate improvements across specific benchmark tasks without requiring calibration or training for the dithering scheme.
Source: arXiv Robotics — research abstracts · Read original article ↗
Loading article text…
What the source reports
Publisher-reported claims, with original evidence. These results have not been independently verified by RoboSignal.
Reported numbers
success points lost
≤100
View original evidence
arXiv:2611.11780v1 Announce Type: new Abstract: Sampling-based planners such as MPPI and CEM query a learned world model thousands of times per control step, so low-bit world models are an obvious way to make model-based control cheaper on a robot. With round-to-nearest activation quantization and no calibration, we find that planning can collapse, by up to 100 points of success, while the world model's latent one-st
Open source S2planning speedup factor
1.9–3.3
View original evidence
on an Ampere GPU, a W8A4 integer TD-MPC2 world model runs its planning rollouts 1.9-3.3$\times$ and the whole planning step 1.3-1.5$\times$ faster than FP32, though not faster than BF16 with pre-converted weights; shared dither adds at most 2.3% latency. In TD-MPC2, block-scaled NVFP4 removes most of the damage and MXFP4 part of it, which ties the failure to coarse grids with a shared scale. Hypotheses, thresholds a
Open source S5planning step speedup factor
1.3–1.5
View original evidence
on an Ampere GPU, a W8A4 integer TD-MPC2 world model runs its planning rollouts 1.9-3.3$\times$ and the whole planning step 1.3-1.5$\times$ faster than FP32, though not faster than BF16 with pre-converted weights; shared dither adds at most 2.3% latency. In TD-MPC2, block-scaled NVFP4 removes most of the damage and MXFP4 part of it, which ties the failure to coarse grids with a shared scale. Hypotheses, thresholds a
Open source S5parameter count
317,000,000
View original evidence
ither fixed within a step or an episode brings the drift back. Dither shared by all candidates and redrawn at every iteration removes most of the damage at the same bit width and without training: at least half of it in all 19 affected Meta-World cells (task $\times$ bit width) of TD-MPC2 (median 95%), in 4 of 5 DINO-WM cells, and in all 8 affected tasks of a 317M-parameter multi-task TD-MPC2. Captured as CUDA graphs
Open source S4
- paper: not_reported
- code: not_reported
- weights: not_reported
- dataset: not_reported
Source excerpts and review record
Automatically extracted; no manual editorial approval recorded.
arXiv:2611.11780v1 Announce Type: new Abstract: Sampling-based planners such as MPPI and CEM query a learned world model thousands of times per control step, so low-bit world models are an obvious way to make model-based control cheaper on a robot. With round-to-nearest activation quantization and no calibration, we find that planning can collapse, by up to 100 points of success, while the world model's latent one-st
Open source S2
on an Ampere GPU, a W8A4 integer TD-MPC2 world model runs its planning rollouts 1.9-3.3$\times$ and the whole planning step 1.3-1.5$\times$ faster than FP32, though not faster than BF16 with pre-converted weights; shared dither adds at most 2.3% latency. In TD-MPC2, block-scaled NVFP4 removes most of the damage and MXFP4 part of it, which ties the failure to coarse grids with a shared scale. Hypotheses, thresholds a
Open source S5
ither fixed within a step or an episode brings the drift back. Dither shared by all candidates and redrawn at every iteration removes most of the damage at the same bit width and without training: at least half of it in all 19 affected Meta-World cells (task $\times$ bit width) of TD-MPC2 (median 95%), in 4 of 5 DINO-WM cells, and in all 8 affected tasks of a 317M-parameter multi-task TD-MPC2. Captured as CUDA graphs
Open source S4
Source：arXiv Robotics — research abstracts · arxiv.org