CVMar 7

AdaGen: Learning Adaptive Policy for Image Synthesis

arXiv:2603.06993v11 citations
Predicted impact top 24% in CV · last 90 daysOriginality Highly original
AI Analysis

AdaGen offers a more efficient and effective method for managing step-specific parameters in iterative image synthesis, benefiting researchers and practitioners working with generative models by reducing manual tuning and improving generation quality.

This paper introduces AdaGen, a learnable and sample-adaptive framework for scheduling iterative image synthesis. It formulates the scheduling as a Markov Decision Process, trained with an adversarial reward, achieving better performance on DiT-XL with 3 times lower inference cost and improving VAR's FID from 1.92 to 1.59.

Recent advances in image synthesis have been propelled by powerful generative models, such as Masked Generative Transformers (MaskGIT), autoregressive models, diffusion models, and rectified flow models. A common principle behind their success is the decomposition of synthesis into multiple steps. However, this introduces a proliferation of step-specific parameters (e.g., noise level or temperature at each step). Existing approaches typically rely on manually-designed rules to manage this complexity, demanding expert knowledge and trial-and-error. Furthermore, these static schedules lack the flexibility to adapt to the unique characteristics of each sample, yielding sub-optimal performance. To address this issue, we present AdaGen, a general, learnable, and sample-adaptive framework for scheduling the iterative generation process. Specifically, we formulate the scheduling problem as a Markov Decision Process, where a lightweight policy network determines suitable parameters given the current generation state, and can be trained through reinforcement learning. Importantly, we demonstrate that simple reward designs, such as FID or pre-trained reward models, can be easily hacked and may not reliably guarantee the desired quality or diversity of generated samples. Therefore, we propose an adversarial reward design to guide the training of the policy networks. Finally, we introduce an inference-time refinement strategy and a controllable fidelity-diversity trade-off mechanism to further enhance the performance and flexibility of AdaGen. Comprehensive experiments on four generative paradigms validate the superiority of AdaGen. For example, AdaGen achieves better performance on DiT-XL with 3 times lower inference cost and improves the FID of VAR from 1.92 to 1.59 with negligible computational overhead.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes