English

Variational Trajectory Optimization of Anisotropic Diffusion Schedules

Machine Learning 2026-02-24 v1 Computer Vision and Pattern Recognition

Abstract

We introduce a variational framework for diffusion models with anisotropic noise schedules parameterized by a matrix-valued path Mt(θ)M_t(\theta) that allocates noise across subspaces. Central to our framework is a trajectory-level objective that jointly trains the score network and learns Mt(θ)M_t(\theta), which encompasses general parameterization classes of matrix-valued noise schedules. We further derive an estimator for the derivative with respect to θ\theta of the score that enables efficient optimization of the Mt(θ)M_t(\theta) schedule. For inference, we develop an efficiently-implementable reverse-ODE solver that is an anisotropic generalization of the second-order Heun discretization algorithm. Across CIFAR-10, AFHQv2, FFHQ, and ImageNet-64, our method consistently improves upon the baseline EDM model in all NFE regimes. Code is available at https://github.com/lizeyu090312/anisotropic-diffusion-paper.

Keywords

Cite

@article{arxiv.2602.19512,
  title  = {Variational Trajectory Optimization of Anisotropic Diffusion Schedules},
  author = {Pengxi Liu and Zeyu Michael Li and Xiang Cheng},
  journal= {arXiv preprint arXiv:2602.19512},
  year   = {2026}
}
R2 v1 2026-07-01T10:46:53.178Z