Saved in:
Bibliographic Details
Main Authors: Zhang, Yixin, Luo, Yunhao, Mishra, Utkarsh Aashu, Shin, Woo Chul, Chen, Yongxin, Xu, Danfei
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.02646
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914364941926400
author Zhang, Yixin
Luo, Yunhao
Mishra, Utkarsh Aashu
Shin, Woo Chul
Chen, Yongxin
Xu, Danfei
author_facet Zhang, Yixin
Luo, Yunhao
Mishra, Utkarsh Aashu
Shin, Woo Chul
Chen, Yongxin
Xu, Danfei
contents Diffusion models excel at short-horizon robot planning, yet scaling them to long-horizon tasks remains challenging due to computational constraints and limited training data. Existing compositional approaches stitch together short segments by separately denoising each component and averaging overlapping regions. However, this suffers from instability as the factorization assumption breaks down in noisy data space, leading to inconsistent global plans. We propose that the key to stable compositional generation lies in enforcing boundary agreement on the estimated clean data (Tweedie estimates) rather than on noisy intermediate states. Our method formulates long-horizon planning as inference over a chain-structured factor graph of overlapping video chunks, where pretrained short-horizon video diffusion models provide local priors. At inference time, we enforce boundary agreement through a novel combination of synchronous and asynchronous message passing that operates on Tweedie estimates, producing globally consistent guidance without requiring additional training. Our training-free framework demonstrates significant improvements over existing baselines, effectively generalizing to unseen start-goal combinations that were not present in the original training data. Project website: https://comp-visual-planning.github.io/
format Preprint
id arxiv_https___arxiv_org_abs_2603_02646
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Compositional Visual Planning via Inference-Time Diffusion Scaling
Zhang, Yixin
Luo, Yunhao
Mishra, Utkarsh Aashu
Shin, Woo Chul
Chen, Yongxin
Xu, Danfei
Robotics
Diffusion models excel at short-horizon robot planning, yet scaling them to long-horizon tasks remains challenging due to computational constraints and limited training data. Existing compositional approaches stitch together short segments by separately denoising each component and averaging overlapping regions. However, this suffers from instability as the factorization assumption breaks down in noisy data space, leading to inconsistent global plans. We propose that the key to stable compositional generation lies in enforcing boundary agreement on the estimated clean data (Tweedie estimates) rather than on noisy intermediate states. Our method formulates long-horizon planning as inference over a chain-structured factor graph of overlapping video chunks, where pretrained short-horizon video diffusion models provide local priors. At inference time, we enforce boundary agreement through a novel combination of synchronous and asynchronous message passing that operates on Tweedie estimates, producing globally consistent guidance without requiring additional training. Our training-free framework demonstrates significant improvements over existing baselines, effectively generalizing to unseen start-goal combinations that were not present in the original training data. Project website: https://comp-visual-planning.github.io/
title Compositional Visual Planning via Inference-Time Diffusion Scaling
topic Robotics
url https://arxiv.org/abs/2603.02646