Diffusion-Based Posterior Sampling: A Feynman-Kac Analysis of Bias and Stability
William PorteousAdvait ParulekarSebastien MotschSanjay ShakkottaiMatias G. Delgadino
Oct 2026
Machine Learning
Abstract
Diffusion-based posterior samplers draw from measurement- or reward-conditioned posteriors using pretrained diffusion priors. Though widely used for inverse problems, their output is biased even with exact prior scores. First, we quantify this bias for the DPS algorithm, the base method for a family of samplers, by introducing a surrogate curve of probability densities which interpolates between the true posterior and the standard Gaussian. The ratio of sampler to surrogate densities solves a parabolic PDE, and its Feynman--Kac formula yields an explicit representation of this ratio as the expectation of a path functional. This representation reveals which posterior regions are over- or under-sampled. This framework also provides a design principle for bias reduction that includes STSL, a related sampler.
Second, in hard-constraint problems (e.g. the low measurement noise regime) these samplers are known to be numerically unstable. We find that this instability of discretized DPS arises from an effective guidance update whose strength scales inversely with step size, inevitably violating the forward-Euler stability criterion near the constraint. This finding motivates implicit (backward-Euler) guidance updates. Finally, we show that the standard practice of early guidance-stopping, used to avoid oscillations, introduces a secondary bias which we characterize through our framework.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.
Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al.· Neural Information Processin...· 316 citations· ⚡15
It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...
Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al.· Neural Information Processin...· 302 citations· ⚡60
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.