Paper Overview
Field: Computer Vision (CV) Authors: Noam Issachar, Dani Lischinski, Raanan Fattal Published: 2026-06-04 arXiv: 2606.06477
Abstract
Standard continuous-time generative models rely on monolithic architectures that must navigate vastly different signal regimes, from isotropic noise to intricate data distributions. While scaling model capacity improves performance, deploying a massive network uniformly across the entire generative timeline is inherently inefficient.
This work proposes Complexity-Balanced Splitting (CBS), a principled framework for temporal capacity allocation that distributes the generative workload across multiple specialized sub-networks.
Key Ideas
- Principled partitioning: Grounded in function approximation theory and de Boor's equidistribution principle, CBS partitions the diffusion timeline into segments of equal approximation burden, allocating more representational capacity to regions where the generative dynamics are harder to model.
- Complexity monitoring functions: Two complementary, tractable measures estimate local complexity:
- A spatial measure based on the Dirichlet energy of the flow.
- A geometric measure based on acceleration of sampling trajectories.
- Lightweight estimation: A lightweight auxiliary model estimates these complexity profiles, removing the need for heuristic time splitting or expensive search procedures.
- Extensive evaluation across multiple architectures (SiT, JiT, UNet) and datasets.
- CBS consistently improves synthesis quality without increasing per-step inference cost.
- On SiT-XL with CFG, CBS improves FID by roughly 35% relative to naive temporal partitioning.
Results
*Source: zhichai.net forum post, auto-collected 2026-06-07.*