Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

51101152202 · Jun 202019922001200920172026
48 results for 2-Wasserstein metric

The space of Gaussian measures on a Euclidean space is geodesically convex in the L2L^2-Wasserstein space. This space is a finite dimensional manifold since Gaussian measures are parameterized by means and covariance matrices. By restricting to the space of Gaussian measures inside the L2L^2-Wasserstein space, we manag…

2008-01-15abs ↗pdf ↗

Polynomial networks converge to Gaussian processes at a rate of O(n^(-1/2)).

problem Understanding the convergence rate of polynomial networks to Gaussian processes.
method Examined one-hidden-layer neural networks with random weights, focusing on polynomial activations and their convergence rate in the 2-Wasserstein metric.
result The rate of convergence for polynomial networks to Gaussian processes is $O(n^{- rac{1}{2}})$.

Study linearizes 2-Wasserstein space using optimal transport maps.

problem Stability and linearization of the 2-Wasserstein space.
method Explicit embedding of probability measures into a Hilbert space using optimal transport maps.
result The embedding is (bi-)Hölder continuous, with stability results for optimal transport maps.

Study entropic regularization of Gaussian measures and processes on Hilbert space.

problem Regularizing 2-Wasserstein distance for infinite-dimensional Gaussian measures and processes.
method Minimum Mutual Information property, closed form formulas, Fréchet differentiability, Sinkhorn barycenter equation.
result Entropic 2-Wasserstein distance and Sinkhorn divergence are Fréchet differentiable in Hilbert space.

Let K be an irreducible and reversible Markov kernel on a finite set X. We construct a metric W on the set of probability measures on X and show that with respect to this metric, the law of the continuous time Markov chain evolves as the gradient flow of the entropy. This result is a discrete counterpart of the Wassers…

2011-02-25abs ↗pdf ↗

This work studies Gaussian geometry under entropy-regularized 2-Wasserstein distance.

problem Understanding Gaussian distributions in uncertainty quantification and diffusivity.
method Entropy-regularized 2-Wasserstein distance, closed-form solutions, fixed-point characterization.
result Closed-form expressions for the 2-Sinkhorn divergence and fixed-point barycenter.

Study shows uniform-time chaos propagation in mean field Langevin dynamics.

problem Understanding the convergence of marginal distributions in mean field dynamics.
method Assumed functional convexity of energy, used LpL^p-convergence and Wasserstein metrics.
result Uniform-in-time propagation of chaos proved in both L2L^2-Wasserstein and relative entropy.

This note shows how independent elliptical distributions minimize the Wasserstein distance.

problem Minimizing the Wasserstein distance between elliptical distributions.
method Analyzing the Wasserstein distance between independent elliptical distributions with the same density generators.
result Independent elliptical distributions minimize their Wasserstein distance from other elliptical distributions with the same density generators.

Introduces spectral-domain Wasserstein distance and Gelbrich bound for elliptical processes.

problem Estimating distances and bounds for elliptical stochastic processes.
method Defines spectral-domain W2\mathcal{W}_2 Wasserstein distance and Gelbrich bound.
result Develops new spectral-domain bounds for non-elliptical processes.

Generative diffusion models improve channel sampling from limited data.

problem Challenges in channel modelling and data collection for wireless systems.
method Diffusion model with U-Net architecture for frequency domain synthesis.
result Stable training and diverse high-fidelity samples generated from true channel distribution.

New method estimates covariance in deep heteroscedastic regression without labels.

problem Estimating covariance in deep heteroscedastic models is challenging due to sample-dependent covariance and lack of ground truth.
method Proposes a self-supervised approach using KL Divergence and 2-Wasserstein distance for covariance estimation and a neighborhood-based heuristic for pseudo labels.
result Demonstrates effective pseudo labels and a computationally cheaper yet accurate deep heteroscedastic regression.

Study convergence and approximations of entropic regularized Wasserstein distances for Gaussian and RKHS measures.

problem Convergence and approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings.
method Analysis of convergence and finite sample approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings.
result Strictly weaker convergence in 2-Sinkhorn divergence for Gaussian measures compared to exact 2-Wasserstein distance.

LightSBB-M improves generative diffusion modeling with lower 2-Wasserstein distances.

problem Improving generative diffusion models using Schrödinger Bridge and Bass methods.
method Optimizes SBB transport plan with dual representation and tunable beta parameter.
result Achieves up to 32% improvement in 2-Wasserstein distance on synthetic datasets.

We prove that on compact Alexandrov spaces with curvature bounded below the gradient flow of the Dirichlet energy in the L2L^2-space produces the same evolution as the gradient flow of the relative entropy in the L2L^2-Wasserstein space. This means that the heat flow is well defined by either one of the two gradient fl…

2010-08-07abs ↗pdf ↗

We characterize lower bounds for the Bakry-Emery Ricci tensor of nonsymmetric diffusion operators by convexity of entropy on the L2L^2-Wasserstein space, and define a curvature-dimension condition for general metric measure spaces together with a square integrable 11-form in the sense of \cite{giglinonsmooth}. This ex…

2016-06-22abs ↗pdf ↗

Transformers can solve complex filtering problems for non-Gaussian signals.

problem Non-linear and non-Markovian filtering problems for conditionally Gaussian signals.
method Continuous-time transformer models called filterformers.
result Filterformers can approximate the conditional law of non-Markovian and conditionally Gaussian signal processes.

Improved KL bounds and Wasserstein guarantees for diffusion flow matching under minimal conditions.

problem Theoretical convergence properties of Brownian motion based diffusion flow matching.
method Refined analysis under Kullback-Leibler and 2-Wasserstein distances.
result State-of-the-art scaling in KL convergence bounds under minimal conditions.

Computing optimal transport maps between high-dimensional and continuous distributions is a challenging problem in optimal transport (OT). Generative adversarial networks (GANs) are powerful generative models which have been successfully applied to learn maps across high-dimensional domains. However, little is known ab…

2019-06-24abs ↗pdf ↗

Extends DAMs to Gaussian distributions for efficient pattern storage and retrieval.

problem Limited storage capacity and retrieval methods for non-vector pattern representations.
method Introduces a log-sum-exp energy function over Gaussian distributions, using optimal transport maps for retrieval dynamics.
result Proves exponential storage capacity and provides quantitative retrieval guarantees.

This work extends stochastic localization to joint probability measures for data analysis.

problem Data distributional analysis in high-dimensional probability.
method Unified stochastic localization under Eldan's α-scheme, coupled probability measures via shared Brownian motion.
result Eldan's α-distance as a scalable surrogate for Wasserstein distance.

Unified approach for sampling non-differentiable and heavy-tailed targets.

problem Sampling non-differentiable and heavy-tailed distributions using Langevin algorithms.
method Anchored Langevin dynamics, which modifies the Langevin diffusion with a smooth reference potential and multiplicative scaling.
result Non-asymptotic guarantees in the 2-Wasserstein distance to the target distribution.

Improved reSGLD accelerates convergence in non-convex learning problems.

problem Inefficient swaps due to noisy energy estimators in reSGLD.
method Variance reduction for noisy energy estimators, theoretical analysis, and numerical experiments.
result Exponential acceleration in convergence for non-convex learning problems.

New statistical methods for analyzing distributions using Wasserstein metric.

problem Statistical analysis of probability distributions on the real line.
method Projected methods exploiting Wasserstein metric and Riemannian structure.
result Projected PCA and regression methods are faster and more flexible.

New method uses trainable activations to make BNNs behave like GPs.

problem Making Bayesian Neural Networks (BNNs) behave like Gaussian Processes (GPs).
method Introduced trainable activations and periodic activations to map GP priors to BNNs. Used 2-Wasserstein distance for optimization.
result Method consistently outperforms existing approaches or matches heuristic methods.

The paper studies the geometry of probability measures on the unit circle.

problem Understanding the Riemannian geometry of probability measures on the unit circle.
method Developed an intrinsic framework using the Peter-Weyl Theorem to study the differential geometry of Wasserstein spaces of compact Lie groups.
result Explicitly demonstrated that the Wasserstein space of the unit circle is flat with vanishing curvature.

Diffusion models' speed-accuracy relations derived from thermodynamics.

problem Understanding the trade-off between model speed and accuracy.
method Connecting diffusion models to thermodynamics and optimal transport.
result Speed-accuracy relations derived, providing insights into optimal learning protocols.

The paper establishes convergence guarantees for SGMs in 2-Wasserstein distance.

problem Establishing convergence guarantees for SGMs in 2-Wasserstein distance.
method Assuming accurate score estimates and smooth log-concave data distribution, the paper specializes its result to several concrete SGMs with specific forward processes modeled by stochastic differential equations.
result Obtained an upper bound on the iteration complexity for each model and a lower bound for Gaussian data distribution.

FedGTEA learns new tasks in federated learning with task embeddings and alignment.

problem Federated class-incremental learning with task-specific knowledge and model uncertainty.
method Cardinality-Agnostic Task Encoder (CATE) for Gaussian task embeddings, 2-Wasserstein distance for inter-task alignment.
result FedGTEA achieves superior classification performance and mitigates forgetting.

GT is a new method for denoising and enhancing datasets using Gaussian density estimates.

problem Improving latent structures in datasets.
method GT is an iterative method that generates a new distance function by computing the 2\ell^2-Wasserstein distance between Gaussian density estimates.
result GT is stable under perturbations and asymptotically ellipsoidal neighborhoods in the continuous case.

New bounds for generative models under weaker assumptions.

problem Establishing convergence guarantees for generative models under weak assumptions.
method Non-asymptotic 2-Wasserstein distance bounds for probability flow ODEs under weak log-concavity and Lipschitz continuity.
result Concrete convergence rates for generative models, including non-log-concave distributions.

The paper studies stability of mean-field variational inference for log-concave distributions.

problem Stability of mean-field variational inference for log-concave distributions.
method Novel approach via linearized optimal transport, lifting non-convex problem to convex optimization over transport maps.
result Dimension-free Lipschitz continuity of the MFVI optimizer with respect to the target distribution, measured in 2-Wasserstein distance.

A new Wasserstein KK-means method for clustering probability distributions.

problem Clustering probability distributions using the Wasserstein metric.
method Distance-based KK-means with SDP relaxation for Wasserstein barycenters.
result Distance-based KK-means outperforms centroid-based KK-means for clustering probability distributions.

Neural Local Wasserstein Regression models distribution-on-distribution regression with flexible, localized transport maps.

problem Estimating distribution-on-distribution regression with global optimal transport maps or linearization limitations.
method Proposes Neural Local Wasserstein Regression, a flexible nonparametric framework using locally defined transport maps in Wasserstein space.
result Demonstrates effective capture of nonlinear and high-dimensional distributional relationships.

New method aligns diffusion models for inference-time properties without retraining.

problem Aligning pre-trained diffusion models for desired inference-time properties.
method Variationally stable Doob's matching for provable guidance estimation.
result Consistent estimator of guidance with non-asymptotic convergence guarantees.