Skip to content

Poisson-Corrector Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling

Sep 2026 · 0 citations · 13 references
Computer Science

Abstract

We study the classical Moreau--Yosida unadjusted Langevin algorithm (MYULA) for $\pi(\,\mathrm{d} x)\propto e^{-f(x)-g(x)}\,\mathrm{d} x$, where $f\in C^2(\mathbb{R}^d)$ is $m$-strongly convex with $L_f$-Lipschitz gradient and $g:\mathbb{R}^d\to\mathbb{R}$ is convex and globally $G$-Lipschitz. For the Moreau-smoothed target $\pi_\lambda$ and the MYULA invariant law $\widehat\pi_{\lambda,h}$, we prove \[ \sqrt m\,W_2(\pi_\lambda,\widehat\pi_{\lambda,h}) =O(h)+\widetilde O(h^{3/4}) \] under $0<h(L_f+\lambda^{-1})\le c$, with only logarithmic dependence on $\lambda^{-1}$ in the error coefficients. Combining this estimate with the Moreau approximation bias yields $\widetilde O(\varepsilon^{-4/3})$ iterations to achieve $\sqrt m\,W_2(\mu_N,\pi)\le\varepsilon$, for fixed model parameters and initialization. The proof combines a discrete Poisson corrector with active-trace estimates and a shared-noise bound for the exact--Euler two-point curvature.

View source

Similar papers

Preprint Sep 2026

A spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size

Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\, \mathrm{d} x$ on $\mathbb{R}^d$, where $U$ is continuously differentiable and $m$-strongly convex with a globally $L$-Lipschitz gradient, $0<m\leq L<\infty$, and $\kappa=L/m$. Fixed-step Metropolis-adjusted Langevin algorithm (MALA) has known warm-start mixing-time upper bounds...

Qian Qin · 0 citations
Preprint Sep 2026

Endpoint Estimates for Stein's Purely Quadratic Carleson Operator

We study the near $L^1$ behavior of the maximally quadratically modulated Hilbert transform \[ \mathcal{C}_2f(x) := \sup_{\lambda} \left|\operatorname{p.v.} \int_{\mathbb{R}}f(x-y)e^{2 \pi i \lambda y^2} \frac{\mathrm{d} y }{y} \right| \] and its lacunary counterpart obtained by restricting $\lambda$ to $2^{\mathbb{Z}}...

A. Fragkos, Ben Krause, Michael T. Lacey · 0 citations
Preprint Oct 2026

A counterexample to integral Aleksandrov-Bakelman-Pucci estimates for a nonlocal operator

We construct a counterexample to integral Aleksandrov-Bakelman-Pucci estimates for nonlocal inequalities of the form \begin{equation*} L_au(x):=\int_{\mathbb R^n}\delta_yu(x) \frac{a(x,y)}{|y|^{n+\sigma}}\,dy \ge-f(x)\quad\text{in }B_1, \end{equation*} with $u\le0$ in $\mathbb R^n\setminus B_1$, where $\delta_yu(x)=u(x...

Yong-Sheng Jiang, Lei Xu · 0 citations
Preprint Sep 2026

Observability Inequalities and the Logvinenko--Sereda Theorem for the Dunkl Transform

Let $R$ be a normalized root system in $\mathbb{R}^d$ with reflection group $G$, let $k$ be a $G$-invariant multiplicity function, and let $\mathcal{F}_k$ be the associated Dunkl transform. We write $k_\alpha=k(\alpha)>0$ and $\mathrm{d}\mu_k(x)=w(x)\,\mathrm{d}x$, where $w(x)=\prod_{\alpha\in R_+}|\langle x,\alpha\ran...

Xing-Yu Zhao, Long Wei, Zhi-Wen Duan · 0 citations
Preprint Aug 2026

Strichartz estimates to fractional Schr\"odinger equations

In this paper, we firstly study Strichartz estimates $\|e^{it D^\alpha} u_0\|_{L_t^q(\mathbb{R};L_x^r(\mathbb{R}^d))}\leq C(d,\alpha,q,r,s)\|u_0\|_{\dot{H}^s}.$ We show some counterexamples for $(q,r) = (2,\infty)$. Then we consider the embedding $X^{s,b}_\alpha \hookrightarrow L_t^q(\mathbb{R};L_x^r(\mathbb{R}^d))$, w...

Jie Chen, Yi-Ran Gong, Ying Zhang · 0 citations
Preprint Aug 2026

Bilinear Bochner-Riesz Means on the Complex Sphere

In this paper, we establish the boundedness of the bilinear Bochner-Riesz means $\mathcal{B}^{\alpha}_R$ on the complex sphere $\mathbb{S}$. More precisely, we prove that $\mathcal{B}^{\alpha}_R$ is bounded from $L^{p_1}(\mathbb{S}) \times L^{p_2}(\mathbb{S}) \to L^p(\mathbb{S})$ where $1/p_1+1/p_2=1/p$ and $1\leq p_1,...

Sayan Bagchi, Md Nurul Molla, Joydwip Singh et al. · 0 citations

Related blog posts

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

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