Establishes exponential contraction in Wasserstein distance on manifolds and flows.
problem Analyzing contraction rates in Wasserstein distance on manifolds and their evolution.
method Explicit estimates and extension to evolving manifolds under geometric flow.
result Gradient estimates with exponential contraction rate under weak curvature conditions.
The paper shows how heat flows and Wasserstein distances relate to space rigidity.
problem Understanding rigidity in Wasserstein contraction along heat flows.
method Establishing equivalence between rigidity and Bakry-Émery gradient estimates, applying results from Ambrosio-Brué-Semola and Han.
result Spaces with specific curvature bounds exhibit rigidity in Wasserstein contraction.
The curvature-dimension condition is a generalization of the Bochner inequality to weighted Riemannian manifolds and general metric measure spaces. It is now known to be equivalent to evolution variational inequalities for the heat semigroup, and quadratic Wasserstein distance contraction properties at different times.…
Algorithm improves variational inference in Wasserstein distance.
problem Improving variational inference methods for complex models.
method Wasserstein contraction analysis of coordinate ascent.
result General and sharp convergence guarantees for various models.
Nonnegative sectional curvature linked to matrix displacement convexity.
problem Nonnegative sectional curvature in Riemannian manifolds.
method Matrix displacement convexity as a criterion for nonnegative sectional curvature.
result Entropy functional matrix displacement convexity implies nonnegative sectional curvature.
Paper proposes new Langevin samplers for sampling from log-concave distributions with superlinear gradient growth.
problem Sampling from log-concave distributions with superlinear gradient growth.
method Proposes two novel discretizations of kinetic Langevin SDEs, showing contractivity and log-Sobolev inequality.
result Establishes non-asymptotic bounds in 2-Wasserstein distance between sampled distributions and target measures.
New method improves sampling efficiency in complex stochastic systems.
problem Sampling efficiency in nonconvex stochastic gradient cases.
method Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo.
result Quantitative Gaussian concentration bounds and convergence rates established.
We study contractivity properties of gradient flows for functions on normed spaces or, more generally, on Finsler manifolds. Contractivity of the flows turns out to be equivalent to a new notion of convexity for the functions. This is different from the usual convexity along geodesics in non-Riemannian Finsler manifold…
In this paper we will give a new proof of the monotonicity of Wasserstein distances of two diffusions under super Ricci flow. Our proof is based on the coupling method of B.Andrew and J.Clutterbuck. The same method can also be applied to the contractivity of normalized L-Wasserstein distance under backward Ricci flow.
The paper analyzes insurance contracts under distributional uncertainty using Bregman-Wasserstein divergence.
problem Optimal insurance contracts under distributional ambiguity.
method Utilizes Bregman-Wasserstein ball to characterize ambiguity sets, employs robust optimization.
result Derives optimal indemnity functions in closed form and studies their properties.
New approach to quantify posterior concentration rates using Wasserstein dynamics.
problem Quantifying the speed of posterior distribution concentration in Bayesian statistics.
method Combining local Lipschitz-continuity with dynamic formulation of Wasserstein distance.
result Optimal posterior contraction rates in finite and infinite-dimensional models.
SGLD proves geometric ergodicity via reflection coupling for nonconvex log-concave distributions.
problem Proving geometric ergodicity of SGLD in nonconvex, log-concave settings.
method Reflection coupling technique to handle SGLD's time discretization and minibatch issues.
result SGLD has an invariant distribution and geometric ergodicity in W 1 W_1 W 1 distance. Based on a new coupling approach, we prove that the transition step of the Hamiltonian Monte Carlo algorithm is contractive w.r.t. a carefully designed Kantorovich (L1 Wasserstein) distance. The lower bound for the contraction rate is explicit. Global convexity of the potential is not required, and thus multimodal targ…
New bounds for SGLD show error decreases with more data.
problem Establishing generalization error bounds for SGLD in non-convex settings.
method Using dissipativity, smoothness, and uniform stability, time-independent bounds are derived.
result Error bounds decay to zero as sample size increases.
Study non-negative curvature Markov chains, proving entropy contraction.
problem Prove entropy contraction for Markov chains with non-negative curvature.
method Prove 1-step contraction in Wasserstein distance implies 1-step contraction in relative entropy.
result Prove MLSI with constant equal to minimal rate increment for mean-field zero-range process.
New method for variational inference without conjugacy constraints.
problem Efficient variational inference with flexible prior and approximation families.
method Wasserstein gradient flow for mean-field approximation.
result Improved convergence and efficiency of variational inference.
Paper analyzes Hit-and-Run's convergence rates and applies similar methods to randomized Kaczmarz.
problem Quantifying advantages of Hit-and-Run's coordinate-free property.
method Sharp estimates via coupling methods and mixing time bounds.
result Ballistic and superdiffusive convergence rates in certain settings.
Paper proposes SinkhornDRL for distributional RL using Sinkhorn divergence and regularized Wasserstein loss.
problem Improving distributional reinforcement learning by minimizing Bellman return distribution differences.
method Introduces SinkhornDRL, a distributional RL algorithm using Sinkhorn divergence and regularized Wasserstein loss.
result SinkhornDRL consistently outperforms or matches existing algorithms on Atari games, especially in multi-dimensional reward settings.
Study on nonsmooth contractive SA with constant stepsize and Q-learning.
problem Understanding convergence and bias in nonsmooth contractive SA with different noise types.
method Proposed prelimit coupling technique for steady-state convergence and derived asymptotic bias.
result Asymptotic bias of nonsmooth SA is proportional to the square root of the stepsize.
New methods improve stability of Sinkhorn algorithm in machine learning.
problem Stability of Sinkhorn semigroups in high-dimensional settings.
method Semigroup analysis based on contraction coefficients and Lyapunov-type operator-theoretic techniques.
result Unified and simplified arguments in Sinkhorn algorithm stability.
Unified framework for analyzing convergence of RSAs using Wasserstein divergence.
problem Analyzing convergence of constant stepsize recursive stochastic algorithms (RSAs).
method Lifting RSA into a higher-dimensional space as a Markov chain and studying the distribution's contraction property with respect to Wasserstein divergence.
result RSAs' iterates' distribution converges to an invariant distribution under certain contraction properties.
Two algorithms learn Gaussian graphical models from Glauber dynamics trajectories.
problem Learning Gaussian graphical models from dependent data.
method Two complementary approaches: local edge-testing and burn-in/thinning reduction.
result Both approaches provide finite-sample recovery guarantees and empirical comparisons.
Accelerates sampling from Gibbs distributions using ARWP method.
problem Sampling from Gibbs distributions efficiently.
method ARWP method, combining Nesterov acceleration and regularized Wasserstein proximal.
result ARWP exhibits higher contraction rate and faster tail exploration.
LMC achieves sqrt(d) dependence in sampling error, improving previous bounds.
problem Analyzing sampling error in Langevin Monte Carlo.
method Refined mean-square analysis for discretizations of contractive SDEs.
result Establishes i l d e O ( d / ε ) ilde{O}(\sqrt{d}/ε) i l d e O ( d / ε ) mixing time bound for LMC. New algorithms improve sampling from constrained distributions.
problem Generating samples from distributions under constraints.
method Kinetic Langevin dynamics and splitting schemes.
result Improved complexity bounds over existing methods.
In this note we continue the analysis of metric measure space with variable ricci curvature bounds. First, we study ( κ , N ) (κ,N) ( κ , N ) -convex functions on metric spaces where κ κ κ is a lower semi-continuous function, and gradient flow curves in the sense of a new evolution variational inequality that captures the information that …
Paper analyzes convergence of ODE samplers in Wasserstein distances.
problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.
Researchers establish bounds for SGMs' KL and Wasserstein divergences under various noise schedules.
problem Estimating the error between target and estimated distributions in SGMs.
method Established upper bounds for KL divergence and Wasserstein distance, incorporating target distribution properties and SGM hyperparameters.
result Optimal noise schedules identified for SGMs, improving generative quality.
DCDC calculates convergence rates for Markov chains using neural networks.
problem Computing precise convergence rates for Markov chains is hard.
method Developed a neural network-based algorithm (DCDC) to bound convergence rates in Wasserstein distance.
result Demonstrated effective convergence bounds for real-world Markov chains.
The paper proves a conjecture about manifold limits and characterizes their structure.
problem Characterizing limits of manifolds with a uniform contractibility function.
method Short proof using Gromov-Hausdorff distance and ANR properties.
result Obstruction vanishes if and only if the manifold can be approximated by PL-manifolds.
New stability theory for Sinkhorn semigroups with explicit decay rates.
problem Stability and convergence of Sinkhorn iterations for various divergences.
method Operator-theoretic framework based on Lyapunov techniques.
result Explicit exponential decay rates for Sinkhorn iterates.
We show that the configuration space over a manifold M inherits many curvature properties of the manifold. For instance, we show that a lower Ricci curvature bound on M implies for the configuration space a lower Ricci curvature bound in the sense of Lott-Sturm-Villani, the Bochner inequality, gradient estimates and Wa…
Improved KLMC for sampling under various conditions.
problem Stable simulation of kinetic Langevin dynamics under different parameters.
method Revisited synchronous Wasserstein coupling analysis with stochastic exponential Euler discretization.
result Exponential integrator can simulate kinetic Langevin dynamics in the overdamped regime with proper time acceleration.
We prove the equivalence of the curvature-dimension bounds of Lott-Sturm-Villani (via entropy and optimal transport) and of Bakry--Émery (via energy and Γ_2$-calculus) in complete generality for infinitesimally Hilbertian metric measure spaces. In particular, we establish the full Bochner inequality on such metric meas…
A new method estimates multi-dimensional value distributions using Hilbert space embeddings.
problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.
SGD with constant stepsize converges to a non-Gaussian limit near flat minima.
problem Behavior of SGD near flat minima with convex objectives.
method Analyzes SGD with Markovian noise and contractive driving chain.
result Invariant law concentrates on scale α 1 / m α^{1/m} α 1/ m and converges weakly to a non-Gaussian stationary distribution. We construct geodesics in the Wasserstein space of probability measure along which all the measures have an upper bound on their density that is determined by the densities of the endpoints of the geodesic. Using these geodesics we show that a local Poincaré inequality and the measure contraction property follow from t…
SGD handles label noise with bounds improving over SGLD.
problem Label noise in non-convex optimization.
method Stochastic gradient descent with uniform dissipativity and smoothness conditions, using Wasserstein distance and algorithmic stability.
result Generalization error bounds with a rate of n − 2 / 3 n^{-2/3} n − 2/3 , better than SGLD's n − 1 / 2 n^{-1/2} n − 1/2 . Distortion (Denneberg 1990) is a well known premium calculation principle for insurance contracts. In this paper, we study sensitivity properties of distortion functionals w.r.t. the assumptions for risk aversion as well as robustness w.r.t. ambiguity of the loss distribution. Ambiguity is measured by the Wasserstein d…
The paper develops a new probabilistic framework for denoising diffusion models using free entropy and stochastic analysis.
problem Developing a mathematical framework for denoising diffusion models in noncommutative settings.
method Formulating diffusion and reverse processes governed by operator-valued stochastic dynamics, using tools from free stochastic analysis.
result Establishing an information-geometric link between entropy production, transport, and deconvolution.
Bayesian histograms achieve optimal distribution estimation with minimal memory usage.
problem Efficiently estimating distributions with minimal memory footprint.
method Bayesian histograms for distribution estimation under Wasserstein distance.
result Bayesian histograms require fewer bins to achieve minimax optimality, reducing memory usage by a polynomial factor.
Enhances privacy in machine learning through Rényi Pufferfish mechanisms.
problem Designing general and efficient Pufferfish mechanisms that maintain privacy and utility.
method Introduces a Rényi divergence-based variant of Pufferfish, generalizes the Wasserstein mechanism, and proves privacy amplification results.
result Extends the applicability of Pufferfish framework and provides stronger privacy guarantees.
Sampling with Markov chain Monte Carlo methods often amounts to discretizing some continuous-time dynamics with numerical integration. In this paper, we establish the convergence rate of sampling algorithms obtained by discretizing smooth Itô diffusions exhibiting fast Wasserstein- 2 2 2 contraction, based on local deviat…
New method improves sampling from non-convex distributions using HFHR dynamics.
problem Sampling from non-log-concave densities with non-convex potential functions.
method Hessian-free high-resolution dynamics (HFHR) with reflection/synchronous coupling.
result HFHR dynamics converges faster than kinetic Langevin dynamics (KLD) for non-convex potentials.
Batch normalization makes deep neural networks' representations increasingly orthogonal.
problem Orthogonality of deep neural network representations.
method Random linear transformations in successive batch-normalizations.
result Orthogonality of representations improves SGD performance.
Unified analysis of KL divergence using shifted composition for sampling.
problem Sampling from target distributions with KL divergence guarantees.
method Shifted composition rule applied to KL divergence, combining local error analysis and Girsanov's theorem.
result Unified KL guarantees for strongly log-concave, weakly log-concave, and log-Sobolev distributions.
SIMPOL solves complex economic models using numerical methods.
problem Optimizing consumption and savings under uncertainty.
method SIMPOL uses a modular numerical framework combining policy iteration and finite difference schemes.
result SIMPOL produces solutions consistent with economic and mathematical theory.
Robust VB framework for large datasets with outliers.
problem Handling outliers and contamination in large datasets.
method Divide and conquer approach with geometric median aggregation.
result VM-Posterior distribution preserves contraction properties.