Searcharxiv⌕ Search

arXiv · 2609.33629

Optimal Transport Bounds for Latent Density Smoothing on MTW($K>0$) Manifolds

Abstract

Smoothing an empirical distribution can fill gaps between observations, but noise added in the surrounding space also moves probability mass away from the manifold supporting the data. We study this tradeoff through Wasserstein error bounds for intrinsic heat smoothing, ambient Gaussian smoothing, and smoothing in an encoder--decoder's latent space. Under the Ma--Trudinger--Wang condition with positive cross-curvature and the stated transport-regularity assumptions, we prove that sufficiently small intrinsic smoothing improves upon the unsmoothed empirical measure. Our ambient bound quantifies how increasing the surrounding dimension restricts the smoothing scale suggested by the bound. For latent smoothing, the analysis shows how the benefit depends on reconstruction accuracy and on how the encoder--decoder pair preserves movement along the manifold and responds to noise in other directions. A quadratic approximation to the bound yields bandwidth-selection rules and conditions favoring latent smoothing in this comparison. Controlled synthetic experiments examine the predicted bandwidth and geometric trends. An exploratory MNIST study illustrates latent smoothing relative to pixel-space perturbations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wonjun Lee, Wenyan Luo. 2026-09-27. Optimal Transport Bounds for Latent Density Smoothing on MTW($K>0$) Manifolds. https://arxiv.org/abs/2609.33629

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

KEEP EXPLORING

Related papers

Accelerating Natural Gradient Descent for PINNs with Randomized Numerical Linear Algebra

Natural Gradient Descent (NGD) has emerged as a promising optimization algorithm for training neural network-based solvers for partial differential equations (PDEs), such as Physics-Informed Neural Networks (PINNs). However, its practical use is often limited by the high computational cost of solving linear systems involving the Gramian matrix. While matrix-free NGD methods based on the conjugate gradient (CG) method avoid explicit matrix inversion, the ill-conditioning of the Gramian significantly slows the convergence of CG. In this work, we extend matrix-free NGD to broader classes of problems than previously considered and propose the use of Randomized Numerical Linear Algebra (RandNLA) techniques for efficient preconditioning of the inner CG solver. The resulting algorithms demonstrate substantial performance improvements over existing NGD-based methods on a range of PDE problems discretized using neural networks, and offer competitive results compared to other state-of-the-art optimizers.

math.NA↗

Helmholtz boundary integral methods and the pollution effect

This paper is concerned with solving the Helmholtz exterior Dirichlet and Neumann problems with large wavenumber $k$ and smooth obstacles using the standard second-kind boundary integral equations. We consider Galerkin and collocation methods -- with subspaces consisting of $\textit{either}$ piecewise polynomials (in 2-d for collocation, in any dimension for Galerkin) $\textit{or}$ trigonometric polynomials (in 2-d) -- as well as a fully discrete quadrature (Nyström) method based on trigonometric polynomials (in 2-d). For each of these methods, we prove -- in many cases for the first time -- rigorous results about the fundamental question: how quickly must the number of degrees of freedom (the dimension of the approximation space) grow with $k$ to maintain accuracy of the computed solution? Importantly, we determine which of these methods suffer from $\textit{the pollution effect}$. That is, we address the question: must the number of points per wavelength $\to \infty$ to maintain accuracy as $k\to\infty$?

math.NA↗

DE-Sinc approximation for unilateral rapidly decreasing functions and its computable error bound

The Sinc approximation is highly effective for functions that decay rapidly at both ends of the real axis. For unilateral rapidly decreasing functions, which decay algebraically as $t\to-\infty$ and exponentially as $t\to\infty$, an appropriate variable transformation is required. Existing single-exponential transformations for this class of functions yield only root-exponential convergence, even when improved transformations are employed. This paper develops a double-exponential (DE)-Sinc approximation based on the transformation $t=2\sinh(\log(\log(1+\exp(π\sinh x))))$, which was previously introduced for numerical integration. The main contribution is a rigorous and computable error bound of order $\operatorname{O}(\exp(-cn/\log n))$ with a constant explicitly expressed in terms of the problem parameters. Under the stated assumptions, the resulting approximation achieves almost exponential convergence and is suitable for computation with guaranteed accuracy. Numerical examples satisfying these assumptions confirm the predicted convergence behavior and the validity of the derived error bound.

math.NA↗