We study the Moreau–Yosida unadjusted Langevin algorithm (MYULA) for the nonsmooth composite target where is -strongly convex with -Lipschitz gradient and is convex and -Lipschitz. Let be the Moreau envelope of , the corresponding smoothed target, and , where is the a.e./weak Hessian of . We show that the leading MYULA discretization error is controlled by the reference active trace , the average of along the heat substep of one MYULA update started from , rather than by the global curvature bound . If is an a.e. upper bound for , then, up to logarithmic factors, iterations suffice to ensure , where is the law of the -th iterate and is the quadratic Wasserstein distance. We also prove the Moreau-bias bound Thus, choosing gives an end-to-end guarantee for . The universal estimate yields accuracy dependence. For the structured piecewise-linear, lasso-type, group, and total-variation penalties considered here, curvature–tube estimates make independent of , yielding for the same classical MYULA kernel.

生成讲解博客的中文版本

生成AI智能校验的中文版本