Sign inGet started
Paper · arXiv

Proximal-Based Generative Modeling for Bayesian Inverse Problems

Score-based diffusion models demonstrate superior performance in generative tasks but encounter fundamental bottlenecks in inverse problems due to the analytical intractability of the time-dependent likelihood score. To bridge this gap, we propose a novel proximal-based generative modeling (PGM) framework that rigorously circumvents explicit likelihood evaluation. Our framework is built upon a theoretical equivalence between Gaussian convolution in diffusion processes and Moreau-Yosida regularization in nonsmooth optimization. This enables a new sampling mechanism driven by the proposed Moreau score, which admits a closed-form expression via proximal operators. Moreover, we introduce More...

AuthorsBoyang Zhang, Zhiguo Wang, Ya-Feng Liu
Primary categorymath.OC
Published13 May 2026
Last updated at source27 May 2026
math.OCcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/b70cf77b-a0c6-4e47-914e-808a084e1a5a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.