When Coarse Scores Suffice for Diffusion Steering
Year: 2026
Type: preprint
Abstract: Recent work on quadratic diffusion steering raised two questions: whether negative quadratic rewards admit sampling algorithms polynomial in the numerical magnitude of the reward, and how imperfect score access changes their tractability. We answer the first and characterise the second at two ends of the score-precision range. For bounded priors and fixed-rank symmetric quadratic rewards, sufficiently precise isotropic diffusion scores permit sampling in time polynomial in the numerical parameters, including the reward magnitude. This is a pseudopolynomial guarantee, not a bound polynomial in binary encoding length. At fixed absolute score tolerance, however, rank-one negative quadratic rewards exhibit a distinct, unconditional information-access barrier: in dimension m+1, the worst-case query complexity at constant Wasserstein accuracy has exponential order exp(Θ(m log(1+λ/m))), up to polynomial factors. The lower bound holds even for smooth priors with known marginals and reward normaliser. Matching upper-exponent constructions use rare-event likelihood-ratio control and Gaussian auxiliary sampling. Known low-dimensional nuisance geometry permits polynomial-query sampling for fixed auxiliary dimension, while noise cutoffs and prior-average denoising error can conceal reward-relevant rare modes. These results distinguish numerical score precision from access to the information needed for reliable posterior steering.
Author: Mishra, Shardul
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233561992
Cites:
Cited by:
Related to:
