Quantitative Factorization and Stability Guarantees for Decoupled Diffusion World Models

Decoupled diffusion world models separate the prediction of future geometry from the synthesis of future appearance. In a staggered RGB--depth formulation, an action-conditioned model first predicts the next depth latent, after which an action-free model generates the RGB latent conditioned on that predicted depth and the RGB history. This architecture offers a useful route to exploiting action-labelled trajectories for dynamics while using larger collections of RGB--depth data for appearance learning. Its probabilistic justification, however, relies on conditional-independence approximations, and its practical performance can be affected by depth prediction error and autoregressive distribution shift.We develop a quantitative theory for this factorization. First, we prove an exact decomposition of the expected joint Kullback--Leibler divergence into two conditional mutual-information terms, measuring structural departures from the proposed conditional independences, and two conditional model-fitting terms. This identity distinguishes approximation error caused by the factorization from error caused by imperfect diffusion models. We derive an expected total-variation bound by Pinsker's inequality. Second, we establish a depth-conditioning robustness bound: under a stated regularity condition on the RGB conditional law, the divergence induced by substituting predicted depth for true depth is controlled by the mean-square depth prediction error. Third, we give finite-horizon bounds for autoregressive rollouts, both for coupled state trajectories and for probability distributions in Wasserstein distance. We also prove a path-space KL bound that accumulates one-step conditional modeling errors over a rollout horizon.The results are theoretical guarantees under explicit assumptions, not empirical claims about a particular trained system. We conclude with estimators, diagnostics, and controlled experiments designed to test the assumptions and quantify the bounds in diffusion world models. The framework provides a principled way to measure when staggered factorization is justified, how depth errors propagate into appearance, and how local model errors accumulate over time.

Authors

Publication Details

Journal
Figshare
Published
2026-11-16
DOI
https://doi.org/10.6084/m9.figshare.35018395
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Quantitative Factorization and Stability Guarantees for Decoupled Diffusion World Models

Yunhu Nam, Rajit Chatterjea
1 links
Figshare
Reinforcement Learning in Robotics
article

Quantitative Factorization and Stability Guarantees for Decoupled Diffusion World Models

Yunhu Nam, Rajit Chatterjea
article en

Abstract

Decoupled diffusion world models separate the prediction of future geometry from the synthesis of future appearance. In a staggered RGB--depth formulation, an action-conditioned model first predicts the next depth latent, after which an action-free model generates the RGB latent conditioned on that predicted depth and the RGB history. This architecture offers a useful route to exploiting action-labelled trajectories for dynamics while using larger collections of RGB--depth data for appearance learning. Its probabilistic justification, however, relies on conditional-independence approximations, and its practical performance can be affected by depth prediction error and autoregressive distribution shift.We develop a quantitative theory for this factorization. First, we prove an exact decomposition of the expected joint Kullback--Leibler divergence into two conditional mutual-information terms, measuring structural departures from the proposed conditional independences, and two conditional model-fitting terms. This identity distinguishes approximation error caused by the factorization from error caused by imperfect diffusion models. We derive an expected total-variation bound by Pinsker's inequality. Second, we establish a depth-conditioning robustness bound: under a stated regularity condition on the RGB conditional law, the divergence induced by substituting predicted depth for true depth is controlled by the mean-square depth prediction error. Third, we give finite-horizon bounds for autoregressive rollouts, both for coupled state trajectories and for probability distributions in Wasserstein distance. We also prove a path-space KL bound that accumulates one-step conditional modeling errors over a rollout horizon.The results are theoretical guarantees under explicit assumptions, not empirical claims about a particular trained system. We conclude with estimators, diagnostics, and controlled experiments designed to test the assumptions and quantify the bounds in diffusion world models. The framework provides a principled way to measure when staggered factorization is justified, how depth errors propagate into appearance, and how local model errors accumulate over time.

Figshare
Reinforcement Learning in Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon