Asymptotics of discrete Schrödinger bridges via chaos decomposition

DOI10.3150/23-BEJ1659zbMATH Open1542.60027MaRDI QIDQ6565309FDOQ6565309

Authors: Zaid Harchaoui, Lang Liu, Soumik Pal 

Publication date: 2 July 2024

Published in: Bernoulli (Search for Journal in Brave)

Recommendations

• From the Schrödinger problem to the Monge-Kantorovich problem
• An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
• Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
• A survey of the Schrödinger problem and some of its connections with optimal transport
• On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint

zbMATH Keywords

optimal transportcontiguitychaos decompositionHoeffding decompositionentropy regularizationSchrödinger bridgeinfinite-order U-statisticsoptimal mtching

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Functional limit theorems; invariance principles (60F17) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Transition functions, generators and resolvents (60J35)

Cites Work

• Estimation in exponential families on permutations
• NON-NULL RANKING MODELS. I
• Large deviations for symmetrised empirical measures
• Asymptotic Statistics
• A Class of Statistics with Asymptotically Normal Distribution
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symmetric statistics, Poisson point processes, and multiple Wiener integrals
• On optimal matchings
• Asymptotics for transportation cost in high dimensions
• I-divergence geometry of probability distributions and minimization problems
• Monge's problem with a quadratic cost by the zero-noise limit of \(h\)-path processes
• On the rate of convergence in Wasserstein distance of the empirical measure
• From the Schrödinger problem to the Monge-Kantorovich problem
• Classes of linear operators. Vol. I
• Logarithmic combinatorial structures: A probabilistic approach
• Limit laws of the empirical Wasserstein distance: Gaussian distributions
• A survey of the Schrödinger problem and some of its connections with optimal transport
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Hermite polynomial identities and their combinatorics
• Asymptotics for \(L_2\) functionals of the empirical quantile process, with applications to tests of fit based on weighted Wasserstein distances
• Central limit theorems for the Wasserstein distance between the empirical and the true distributions
• Regularized discrete optimal transport
• Matching random samples in many dimensions
• Nonparametric Validation of Similar Distributions and Assessment of Goodness of Fit
• The Theory of Unbiased Estimation
• Title not available (Why is that?)
• Approximating the permanent via importance sampling with application to the dimer covering problem
• Note on the Schrödinger equation and \(I\)-projections
• Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
• Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
• Permutations with fixed pattern densities
• On the elementary symmetric polynomials of independent random variables
• Atomic Theory of the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>λ</mml:mi></mml:math>Transition in Helium
• Asymptotic Feynman-Kac formulae for large symmetrised systems of random walks
• Large deviations for trapped interacting Brownian particles and paths
• Large deviations for many Brownian bridges with symmetrised initial-terminal condition
• Asymptotic behaviour of symmetric polynomial statistics
• The limit behavior of elementary symmetric polynomials of i. i. d. random variables when their order tends to infinity
• Cones and gauges in complex spaces: spectral gaps and complex Perron-Frobenius theory
• On the weak limits of elementary symmetric polynomials
• Elementary symmetric polynomials of increasing order
• Central limit theorems for empirical transportation cost in general dimension
• The invisible hand algorithm: solving the assignment problem with statistical physics
• Approximation theorems for random permanents and associated stochastic processes
• Entropic optimal transport is maximum-likelihood deconvolution
• Multiplicative Schrödinger problem and the Dirichlet transport
• Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
• Inference for empirical Wasserstein distances on finite spaces
• Limiting behavior of random permanents
• Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
• Empirical regularized optimal transport: statistical theory and applications
• Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
• Limit laws for empirical optimal solutions in random linear programs

This page was built for publication: Asymptotics of discrete Schrödinger bridges via chaos decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565309)