Improved outlier detection in hierarchical Gaussian Processes using Wasserstein-2 kernels.
problem Outlier detection limitations in stacked Gaussian Processes.
method Proposed a hybrid kernel combining Euclidean and Wasserstein-2 distances, emphasizing variance in Wasserstein-2 computations.
result Improved performance and enhanced out-of-distribution detection on various datasets.
New method synthesizes and analyzes probability measures using entropy-regularized optimal transport.
problem Synthesize and analyze probability measures with entropy-regularized optimal transport.
method Entropy-regularized Wasserstein-2 cost and Sinkhorn divergence for synthesis and analysis.
result Computed barycentric coefficients and their stability for classification of corrupted point cloud data.
We propose a novel end-to-end non-minimax algorithm for training optimal transport mappings for the quadratic cost (Wasserstein-2 distance). The algorithm uses input convex neural networks and a cycle-consistency regularization to approximate Wasserstein-2 distance. In contrast to popular entropic and quadratic regular…
Scalable algorithm for computing Wasserstein-2 barycenters without bias.
problem Computing Wasserstein-2 barycenters efficiently and accurately.
method Input convex neural networks and cycle-consistency regularization.
result Our approach avoids introducing bias and does not require minimax optimization.
We present a framework for Nesterov's accelerated gradient flows in probability space to design efficient mean-field Markov chain Monte Carlo (MCMC) algorithms for Bayesian inverse problems. Here four examples of information metrics are considered, including Fisher-Rao metric, Wasserstein-2 metric, Kalman-Wasserstein m…
Proposes a new method for efficient model reconstruction with uncertain parameters.
problem Reconstructing models with latent variables or parameters of unknown distribution.
method Local squared Wasserstein-2 (W_2) method.
result Efficiently reconstructs output distributions from observation data.
The paper proposes a method to ensure fairness in machine learning models.
problem Ensuring fairness in machine learning models powered by supervised learning.
method Optimal affine transport and Wasserstein-2 barycenter to characterize the Pareto frontier between prediction error and statistical disparity.
result The proposed method effectively balances prediction accuracy and fairness, as demonstrated by numerical simulations.
Paper develops a generative model using Wasserstein-2 loss.
problem Creating realistic data samples from limited data.
method Uses a distribution-dependent ODE with a gradient flow for W2 loss.
result The method converges to the true data distribution exponentially.
The paper tackles efficient computation of optimal transport by approximating conjugates with amortized optimization.
problem Efficient computation of convex conjugates in optimal transport is challenging and limits the quality of transport maps.
method The approach combines amortized approximations of conjugates with a fine-tuning solver to improve transport map quality.
result The method significantly improves the quality of transport maps for the Wasserstein-2 benchmark and models many 2D couplings and flows.
Improved convergence rates for Stein Variational Gradient Descent in finite-particle settings.
problem Improving convergence rates for Stein Variational Gradient Descent in finite-particle settings.
method Analyzing the time derivative of relative entropy and splitting it into dominant and smaller parts.
result Finite-particle convergence rates of order 1/\sqrt{N} for Kernelized Stein Discrepancy and Wasserstein-2 metrics.
Improved efficiency in HMC samplers reduces dissipative behavior.
problem Reducing dissipative behavior in HMC samplers.
method Variable integration time and partial velocity refreshment.
result Efficiency improved by a √κ factor in Wasserstein-2 distance.
In this paper, we are concerned with a non-asymptotic analysis of sampling algorithms used in nonconvex optimization. In particular, we obtain non-asymptotic estimates in Wasserstein-1 and Wasserstein-2 distances for a popular class of algorithms called Stochastic Gradient Langevin Dynamics (SGLD). In addition, the afo…
Paper presents a new algorithm to approximate Wasserstein-2 barycenters without bias.
problem Approximating Wasserstein-2 barycenters of continuous measures.
method Generative model approach using arbitrary neural networks.
result The method does not introduce bias and is applicable to large-scale tasks.
New metric for probability measures connects physics and geometry.
problem Developing a new metric for probability measures.
method Transport Hessian metric, formulated dynamical systems.
result Connections to physics equations and mathematical models.
The paper provides convergence guarantees for ODE-based generative models using transformers.
problem Theoretical guarantees for ODE-based generative models.
method A pre-trained autoencoder maps inputs to a latent space, and a transformer predicts the velocity field.
result The distribution of samples generated via estimated ODE flow converges to the target distribution in Wasserstein-2 distance.
Paper tackles measure estimation in barycentric coding model.
problem Estimating an unknown measure in the barycentric coding model.
method Geometric, statistical, and computational insights; quadratic optimization problem; empirical i.i.d. samples algorithm.
result Proves precise rates of convergence for algorithm, ensuring statistical consistency.
Bayesian layer improves image segmentation and out-of-distribution detection.
problem Outlier detection in image segmentation.
method Parameter-efficient hierarchical convolutional Gaussian Processes in Wasserstein-2 space.
result Uncertainty estimates improve out-of-distribution detection.
We provide a nonasymptotic analysis of the convergence of the stochastic gradient Hamiltonian Monte Carlo (SGHMC) to a target measure in Wasserstein-2 distance without assuming log-concavity. Our analysis quantifies key theoretical properties of the SGHMC as a sampler under local conditions which significantly improves…
K-means clustering improved for robustness to outliers and distribution shifts.
problem K-means is brittle to outliers, distribution shifts, and limited samples.
method Developed a distributionally robust variant using Wasserstein-2 ball around the empirical distribution.
result Substantial gains in outlier detection and robustness to noise demonstrated.
New algorithm tames non-linear growth in stochastic optimization.
problem Computational challenges in E-step of EM framework.
method Employing interacting particle systems and taming techniques to create tIPLA.
result Non-asymptotic convergence error estimates in Wasserstein-2 distance for tIPLA.
DDPMs are robust to noisy score estimates and achieve optimal convergence rates in Wasserstein-2 distance.
problem Evaluating the quality of DDPMs in Wasserstein distance with noisy score estimates.
method Established finite-sample guarantees in Wasserstein-2 distance for DDPMs, considering noisy score estimates.
result Optimal convergence rates in Wasserstein-2 distance for DDPMs, matching Gaussian case.
The paper connects tempering and entropic mirror descent for sampling.
problem Sampling from a target distribution with known unnormalized density.
method Establishes the connection between tempering SMC and entropic mirror descent, deriving convergence rates and geometric insights.
result Tempering SMC iterates correspond to entropic mirror descent on the reverse KL divergence, providing new optimization perspectives.
The increasingly common use of neural network classifiers in industrial and social applications of image analysis has allowed impressive progress these last years. Such methods are however sensitive to algorithmic bias, i.e. to an under- or an over-representation of positive predictions or to higher prediction errors i…
Corrects local error estimates for UBU integrator in SDEs, improving complexity guarantees.
problem Improper local error estimates in UBU integrator for SDEs.
method Reconciles theory with practice by correcting local error estimates.
result Stronger assumptions needed for O ( d 1 / 4 ε − 1 / 2 ) \mathcal{O}(d^{1/4}ε^{-1/2}) O ( d 1/4 ε − 1/2 ) steps in Wasserstein-2 distance. Proposes a new RL method to fine-tune flow-based models with arbitrary rewards.
problem Challenges in fine-tuning continuous flow-based generative models with arbitrary reward functions.
method Online Reward-Weighted Conditional Flow Matching with Wasserstein-2 Regularization (ORW-CFM-W2)
result Achieves optimal policy convergence with controllable trade-offs between reward maximization and diversity preservation.
Generative flows learn distributions on low-dimensional manifolds robustly via Wasserstein proximals.
problem Learning distributions supported on low-dimensional manifolds robustly.
method Combining Wasserstein-1 and Wasserstein-2 proximal operators to formulate well-posed continuous-time generative flows.
result The combination of Wasserstein-1 and Wasserstein-2 proximals ensures the well-posedness of generative flows, leading to unique and robust learning.
This paper analyzes sampling from heavy-tailed distributions using discretized Itô diffusions.
problem Sampling from heavy-tailed distributions with finite variance.
method Mean-square analysis of discretized Itô diffusions with weighted Poincaré inequalities.
result Explicit iteration complexity for obtaining samples close to target distributions in Wasserstein-2 metric.
KIPLMC methods improve statistical inference in latent variable models.
problem Statistical inference in latent variable models.
method Joint diffusion process in parameter and latent variable spaces, with two explicit discretizations.
result KIPLMC methods achieve accelerated convergence rates in Wasserstein-2 distance.
New limits found for training deep learning models efficiently.
problem Optimizing the training speed of deep learning models without sacrificing accuracy.
method Applied stochastic thermodynamics to set speed limits for neural network training.
result Training neural networks is optimal within certain scaling assumptions.
A new tamed stochastic gradient Hamiltonian Monte Carlo algorithm for superlinearly growing stochastic gradients.
problem Sampling and stochastic optimization problems with superlinearly growing stochastic gradients.
method Tamed Stochastic Gradient Hamiltonian Monte Carlo (tSGHMC) algorithm.
result Established a non-asymptotic error bound in Wasserstein-2 distance with a convergence rate of 1 / 4 1/4 1/4 . New method proves dimension-free convergence for ULD in KL divergence.
problem Polynomial scaling of existing convergence guarantees in high dimensions.
method Refined KL local error framework, focusing on tr(H) instead of d.
result First dimension-free KL divergence bounds for discretized ULD.
Algorithm classifies point clouds using deep set linearized optimal transport.
problem Classifying point clouds efficiently and accurately.
method Deep Set Linearized Optimal Transport, ICNNs, and a discriminator network.
result Efficiently distinguishes between various classes of point clouds.
We study the problem of sampling from a probability distribution π π π on $\rset^d$ which has a density \wrt\ the Lebesgue measure known up to a normalization factor $x \mapsto \rme^{-U(x)} / \int_{\rset^d} \rme^{-U(y)} \rmd y$ . We analyze a sampling method based on the Euler discretization of the Langevin stochastic dif…
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.
ITSPACE improves covariance alignment faster than other methods.
problem Optimizing covariance matrices for machine learning tasks.
method Proximal majorization-minimization method that directly optimizes the Bures-Wasserstein objective.
result ITSPACE achieves lower BW gap solutions faster than other methods.
Bayesian Gaussian Processes layer detects out-of-distribution data in medical imaging.
problem Detecting out-of-distribution data in medical imaging tasks.
method Parameter-efficient hierarchical convolutional Gaussian Processes in Wasserstein-2 space.
result Uncertainty estimates enable superior out-of-distribution detection compared to previous methods.
This work improves SGMs' convergence guarantees for semiconvex distributions with discontinuous gradients.
problem Establishing convergence guarantees for SGMs under weak regularity conditions.
method Developed non-asymptotic Wasserstein-2 convergence analysis for SGMs targeting semiconvex distributions with discontinuous gradients.
result Achieved optimal dependence of O ( d ) O(\sqrt{d}) O ( d ) on data dimension d d d and convergence rate of order one. New analysis for learning and applying preconditioners in MCMC improves efficiency.
problem Improving efficiency of MCMC algorithms by modifying them with preconditioners.
method Analyzes and compares computational costs of MCMC schemes with and without preconditioners.
result Establishes non-asymptotic guarantees for MCMC algorithms that learn and use preconditioners.
New method learns discrete graph diffusion via free-energy gradient flows.
problem Challenges in translating continuous diffusion models to discrete spaces.
method Proposes a novel computational approach using a specific metric on the simplex.
result Recover the underlying functional for various graph classes.
Analyzes learning and applying preconditioners in MCMC for efficiency.
problem Improving efficiency of MCMC algorithms.
method Non-asymptotic analysis of schemes that learn preconditioners.
result Established non-asymptotic guarantees for preconditioned ULA.
The study provides guarantees for diffusion-based models under log-concave data, offering best-known convergence rates.
problem Theoretical guarantees for convergence of diffusion-based generative models under log-concave data distributions.
method Assumption of strongly log-concave data distributions, Lipschitz continuous functions for score estimation, and novel auxiliary process.
result Best known upper bounds for Wasserstein-2 distance between Gaussian distribution and sampling algorithm.
CNFs learn distributions from samples with error bounds.
problem Learning probability distributions from finite samples.
method Continuous normalizing flows with linear interpolation and flow matching objective function.
result Non-asymptotic error bounds for distribution estimator in Wasserstein-2 distance.
Proposes variance reduction techniques for sliced Wasserstein distance estimation.
problem Intractability of estimating sliced Wasserstein distances.
method Uses control variates based on Gaussian approximations of projected measures.
result Significant reduction in variance of SW distance estimators.
New DG method minimizes barycentric alignment and reconstruction loss.
problem Improving domain generalization in machine learning.
method Introduces a new upper bound and WBAE algorithm.
result WBAE outperforms state-of-the-art DG algorithms.
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 propose a new algorithm that uses an auxiliary neural network to express the potential of the optimal transport map between two data distributions. In the sequel, we use the aforementioned map to train generative networks. Unlike WGANs, where the Euclidean distance is i m p l i c i t l y {\it implicitly} implicitly used, this new method allows …
We propose regularization strategies for learning discriminative models that are robust to in-class variations of the input data. We use the Wasserstein-2 geometry to capture semantically meaningful neighborhoods in the space of images, and define a corresponding input-dependent additive noise data augmentation model. …
New algorithm samples superlinearly growing log-gradient distributions.
problem Sampling from distributions with superlinearly growing log-gradient.
method Proposes a novel taming Langevin-based scheme called sTULA.
result Derives non-asymptotic convergence bounds in KL, TV, and W2 distances.