Searcharxiv⌕ Search

arXiv · 2609.39531

WEIRDO: WEak resIdual Regularized DOob's h-transform diffusion alignment

Abstract

We study the problem of estimating the guidance that steers the distribution learned by a diffusion generative model toward a tilted target $q_0 \propto w\,p_0$ at inference time. Relying on the stochastic optimal control approach, we observe that the exact drift correction is the gradient of the logarithm of Doob's $h$-function, and we study the problem of estimating it from a sample. In the present paper, we assume that the score of the pretrained model is available, that the tilting weight is bounded and positive, and that the reference distribution has a bounded support, no smoothness of the weight is required. Introducing a penalized least-squares risk in which the penalty is the residual of the space-time harmonicity equation satisfied by the $h$-function, measured in a dual Sobolev norm, we derive high-probability bounds on the squared error of the resulting guidance estimate. Since the penalty vanishes at the target, the estimator is free of regularization bias, and in favourable scenarios its rate of convergence is faster than the minimax rate of estimating first-order derivatives of a smooth regression function. Assuming that $w$ is bounded and positive with $\mathbb{E}_{p_0}[w^{-\mathrm{s}}] < \infty$ for some $\mathrm{s} \in (0,\infty]$, and that the reference data are compactly supported, we prove that the guidance is estimable in squared $L^2$ at rate $\varepsilon_n^{\mathrm{s}/(\mathrm{s}+4)}$, where $\varepsilon_n = n^{-2(β-1)/(2(β-1)+d)}.$ We also transfer the obtained bounds to the total variation distance between the marginals of the estimated and the exactly guided samplers, and illustrate the performance of the suggested approach with numerical experiments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Denis Suchkov. 2026-09-30. WEIRDO: WEak resIdual Regularized DOob's h-transform diffusion alignment. https://arxiv.org/abs/2609.39531

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optimal Estimation of Large-Dimensional Nonlinear Factor Models

This paper studies optimal estimation of large-dimensional nonlinear factor models. The key challenge is that the observed variables are possibly nonlinear functions of some latent variables, with the functional forms left unspecified. A local principal component analysis method combining K-nearest neighbors matching and principal component analysis is proposed to estimate the factor structure and recover information on latent variables and latent functions. Large-sample properties are established, including a sharp bound on the matching discrepancy of nearest neighbors, sup-norm error bounds for estimated local factors and factor loadings, and the uniform convergence rate of the factor structure estimator. Under mild conditions our estimator of the latent factor structure can achieve the optimal rate of uniform convergence for nonparametric regression. The method is illustrated with a Monte Carlo experiment and an empirical application studying the effect of tax cuts on economic growth.

math.ST↗

Adaptive Density Estimation Using Projection Kernels and Penalized Comparison to Overfitting

In this work, we study wavelet projection estimators for density estimation, based on compactly supported $\mathcal S$-regular scaling functions. The main issue is the choice of the resolution level, which determines the bias--variance trade-off. We select this level by a Penalized Comparison to Overfitting (PCO) criterion: each candidate estimator is compared in $Ł^2(\R)$ with a single overfitting reference, and the additional stochastic fluctuation is corrected by an explicit penalty. For the selected estimator, we prove a high-probability oracle inequality and a risk oracle inequality in expectation. Over Besov balls of densities satisfying a common $Ł^\infty$ bound, the risk inequality yields the rate $n^{-2r/(2r+1)}$ uniformly over the class, with a sufficient penalty threshold that can be chosen uniformly over the class. This rate has the classical minimax order, and the procedure adapts to the unknown Besov regularity. Numerical experiments on several density shapes confirm that the data-driven level is close to the oracle one and adapts to the structure of the target.

math.ST↗

Minimax Optimal Estimation of Mean and Covariance Functions with Spectral Regularization

Estimation of the mean and covariance functions is a fundamental problem in functional data analysis, particularly for discretely observed functional data. In this work, we study a regularization-based framework for estimating the mean and the covariance functions within a reproducing kernel Hilbert space (RKHS) setting. Our approach utilizes a spectral regularization technique under Hölder-type source conditions, allowing for a broad class of regularization schemes and accommodating a wide range of smoothness assumptions on the target functions. In contrast to RKHS formulations that assume the target belongs to the underlying RKHS, our source-condition framework also accommodates misspecified targets. Convergence rates for the proposed estimators are derived, and we derive corresponding minimax lower bounds and identify regimes in which the upper bounds are optimal, or optimal up to logarithmic factors.

math.ST↗