Skip to content

Learning Sampling Parameters for Diffusion Models

Jul 2026 · arXiv.org · Vol abs/2607.23488 · 0 citations · 30 references
Computer Science

TL;DR

This work introduces LeSAMP, a framework for learning prompt-conditioned, timestep-varying sampling parameters, and suggests that learned sampling-parameter policies provide a complementary approach to existing post-training methods for improving diffusion model outputs.

Abstract

Text-to-image diffusion models expose many inference-time sampling parameters, including prompts, negative prompts, classifier-free guidance scales, and noise schedules. These parameters are typically manually chosen once and then held fixed across prompts and denoising timesteps, even though different prompts and stages of generation can benefit from different parameter values. We introduce LeSAMP, a framework for learning prompt-conditioned, timestep-varying sampling parameters. We formulate parameter selection as a reinforcement learning problem: Given a user prompt, a large language model is trained to emit schedules for the chosen sampling parameters. We optimize our model using rewards from human preference models and VLM-as-a-judge. We evaluate our model on Flux.1 [dev] and Stable Diffusion 3.5, and find that compared to baselines, LeSAMP has a win rate of up to 68.12% using human preference scores and 73.37% using VLM-as-a-judge. These gains are validated in a user study where we achieve win rates of up to 59.46% over previous baselines. Our results suggest that learned sampling-parameter policies provide a complementary approach to existing post-training methods for improving diffusion model outputs.

View source

Similar papers

#machine learning Preprint Aug 2026

Optimize Your Sampling: Tuned Diffusion Sampling with Bayesian Optimization

Optizing Your Sampling (OYS), which instead treats timestep selection as a black-box optimization problem, optimizing the target metric directly with Bayesian optimization, improves both simple and sophisticated samplers such as Euler and DPM-Solver++.

Travis Zhang, Christian K. Belardi, Justin Lovelace et al. · 0 citations
Preprint Aug 2026

Adversarial Learning of Classifier-Free Guidance Schedules

This paper learns the guidance schedule as a function of diffusion time, conditioning and the current noisy sample, in order to better align sampled images with the text prompt.

A. Pokle, Alexandre Galashov, Arnaud Doucet et al. · 0 citations
Preprint Aug 2026

Revisiting Classifier-Free Guidance Methods in Latent Diffusion Models

This study studies a family of training-free techniques conceptually rooted in Classifier-Free Guidance, most of which were originally proposed on older U-Net diffusion models and validated using metrics that assess image quality in isolation, without accounting for compositional alignment or semantic correspondence.

A. Sergievskii, Artyom Turevich, Sergey Kastryulin · 0 citations
Jul 2026

Conditioning Tree-Based Diffusions and Flows for Probabilistic Tabular Regression

DiffGBM exposes the score-side recipe---residualization, EDM-style preconditioning, log-sigma time sampling, noise-level features, loss weighting, and histogram resolution---as jointly tunable axes over a shared LightGBM surface rather than one frozen bundle.

Silas Koemen · 0 citations
Preprint Aug 2026

PAST: Prompt-Adaptive Sampling Termination for Efficient Diffusion Model

PAST is proposed, which provides differentiated rewards while adaptively regulating training episode length by jointly perceiving denoising progress and prompt difficulty and establishes a dual adaptive coordination mechanism that balances the extrinsic and intrinsic rewards.

Ren-Ye Yan, Ji-Kang Cheng, You Wu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.