Skip to content
Preprint

One Inverse Step is a Convex Program: Bayes-Limit Calibration of Diffusion Inversion

Aug 2026 · 0 citations · 70 references
Mathematics Computer Science

TL;DR

One implicit DDIM inversion step is the cheapest probe of whether a pretrained diffusion model encodes local manifold geometry at the Bayes limit, strongly convex at the Bayes limit.

Abstract

One implicit DDIM inversion step is the cheapest probe of whether a pretrained diffusion model encodes local manifold geometry. It is the stationarity condition of an explicit potential, $x-G(x)=\nabla\Psi_t(x)$, strongly convex at the Bayes limit with modulus exactly $e^{-h_t}$ for the step's log-SNR gap $h_t$ $-$ for every data law, schedule and point, with no manifold, reach or unimodality hypothesis. Three consequences must be kept apart. (i) The solution is unique at the Bayes limit; a second one requires the trained score to violate the posterior-covariance bound by $1/(1-e^{-h_t})$, a hypothesis-free certificate of model error; the same bound makes contraction a schedule constant, $\rho_g^{\star}=1-e^{-h_t}<0.326$ throughout the standard DDPM schedule. (ii) The solver can still fail: Picard iteration is unit-step gradient descent on $\Psi_t$, unstable wherever $\lambda_{\max}(\nabla^2\Psi_t)>2$, so oscillation certifies nothing; damping below $2/\lambda_{\max}$ cures it. (iii) The geometry lives in the convergence domain: on the scale-free depth $w=r\kappa_{\max}$ the oscillation shell sits at $w=\tfrac12$, schedule-free, and the divergence shell at $w=1/(1+\rho_g^{\star})$, with a measured finite-noise correction in $\|\mathrm{II}\|^2$. Exact scores reproduce both to within $0.54\%$ on three classes; no trained score we probe shows a shell $-$ a derived limitation, not a null result: the Fermi window conflicts with the model's own training support by $3.6$-$5.6\times$, and the trained Hessian-Lipschitz constant is $2$-$12\%$ of the curvature the law reads, $0$ on a ReLU net. Finally the unconditional ceiling $\sigma_t\lambda_{\max}(\mathrm{sym}\,J)\le1$, from $\mathrm{Cov}(x_0\mid x_t)\succeq0$ alone, holds for the exact score to $3\times10^{-7}$ but is violated in all DDPM CIFAR-10/CelebA-HQ-256 settings, by $1.26$-$4.66\times$.

View source

Similar papers

Preprint Aug 2026

Sharp proper estimation of fixed-component Gaussian location mixtures in polynomial time

Exhaustive moment fitting in this constant-dimensional space produces a proper mixture and, together with the dimension-free moment characterization of Gaussian mixtures, achieves the optimal Hellinger rate in polynomial arithmetic time for every fixed $k$.

Heng-Zhi He, Guang Cheng · 0 citations
Preprint Jul 2026

Mirror Langevin diffusions: Convergence rates and Markov chain approximations

Given a strongly convex function $u$, equip $R^d$ with a Riemannian metric given by the Hessian $\nabla^2 u$. This is a so-called Hessian manifold. Given a probability density $\mu$ one may run a Langevin diffusion intrinsic to the manifold with stationary distribution $\mu$. Such (Hessian) manifold-valued Langevin dif...

Benjamin Capdeville, Young-Heon Kim, Soumik Pal · 0 citations
Jul 2026

Anderson acceleration of the proximal point method: the exact adaptive minimax, a spectral phase transition, and optimal safeguarding

\noindent We study residual-polynomial acceleration of the proximal point method (PPM) for maximal monotone inclusions, with Anderson acceleration (AA) as the prototypical adaptive scheme. We answer three questions exactly. (i)~The minimax complexity over all adaptive methods is precisely $d_0/(K+1)$ per $K$ resolvent...

Zheng Jia, Y. Shehu, Yong-Hong Yao · 0 citations
Preprint Jul 2026

Density-Dependent McKean--Vlasov Diffusions: Subgaussian Occupancy Bounds and Polynomial Propagation of Chaos

We study the local density-dependent diffusion $dY_t=-\Xi(p_t(Y_t))\nabla\Phi(Y_t)\,dt+\sqrt2\,dW_t$ and a clipped, randomly shifted histogram particle approximation on $\mathbb{R}^d$. The central difficulty is that the empirical density is evaluated at the particles'locations and re-enters their drift, while the confi...

Denis Belomestny, Ekaterina Morozova · 0 citations
Preprint Aug 2026

Langevin dynamics along the zero set of real-analytic potentials

We consider the Langevin diffusion $dX_t = - \beta \nabla V(X_t) dt + \sqrt{2} dB_t$ for a general nonnegative real-analytic potential $V$ and a large parameter $\beta$. In the large-$\beta$ limit the process is confined to the zero set of $V$, assuming that it starts there. We derive a candidate limiting evolution on...

Martin Larsson · 0 citations
Preprint Aug 2026

Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants

The lifted-selector reduction has an inverse-polynomial radial gap, proved through a quantitative theorem for rational cyclic zonogons, and the results apply to Euclidean zonotope radius and positive-semidefinite binary quadratic maximization parameterized by rank.

Pahan Dewasurendra, Subhashini Jayawardhana · 2 citations

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