ComboStoc: Combinatorial Stochasticity for Diffusion Generative Models
<|reference_start|>ComboStoc: Combinatorial Stochasticity for Diffusion Generative Models: In this paper, we study an under-explored but important factor of diffusion generative models, i.e., the combinatorial complexity. Data samples are generally high-dimensional, and for various structured generation tasks, there are additional attributes which are combined to associate with data samples. We show that the space spanned by the combination of dimensions and attributes is insufficiently sampled by existing training scheme of diffusion generative models, causing degraded test time performance. We present a simple fix to this problem by constructing stochastic processes that fully exploit the combinatorial structures, hence the name ComboStoc. Using this simple strategy, we show that network training is significantly accelerated across diverse data modalities, including images and 3D structured shapes. Moreover, ComboStoc enables a new way of test time generation which uses insynchronized time steps for different dimensions and attributes, thus allowing for varying degrees of control over them.<|reference_end|>
@article{xu2024combostoc:,
    title={ComboStoc: Combinatorial Stochasticity for Diffusion Generative Models},
    author={Rui Xu, Jiepeng Wang, Hao Pan, Yang Liu, Xin Tong, Shiqing Xin,
  Changhe Tu, Taku Komura, Wenping Wang},
    journal={arXiv preprint arXiv:2405.13729},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.13729},
    primaryClass={cs.LG cs.AI cs.CV cs.GR}
}