The paper introduces a new ODE approach to improve Wasserstein GANs.
problem Improving Wasserstein GANs for better training results.
method Derives an ODE representing the gradient flow of Wasserstein-1 loss and proposes a new model W1-FE.
result W1-FE outperforms WGAN in training experiments across various dimensions.
Study error bounds in evaluating distributional computational graphs.
problem Error analysis in evaluating graphs with inputs as probability distributions.
method Establish non-asymptotic error bounds using Wasserstein-1 distance.
result Non-asymptotic error bounds for discretization errors in distributional computational graphs.
Flow Matching improves Wasserstein 1 distance convergence in high dimensions.
problem Improving Wasserstein 1 distance estimation for unbounded distributions.
method Flow Matching approach based on ODEs, controlling Lipschitz constant.
result Derives a convergence rate for Wasserstein 1 distance, improving previous results.
Wasserstein GANs with Gradient Penalty compute a different optimal transport problem called congested transport.
problem Training generative models to produce high-quality synthetic data.
method Wasserstein GANs with Gradient Penalty (WGAN-GP) approach to calculate the Wasserstein 1 distance.
result WGAN-GP computes the minimum of the congested transport problem, not the Wasserstein 1 distance.
Quantum Earth Mover's distance improves stability and efficiency in quantum learning.
problem Quantum learning's loss landscapes often lead to poor local minima and gradients.
method Introduced the quantum Earth Mover's (EM) distance and proposed a quantum Wasserstein generative adversarial network (qWGAN).
result The quantum EM distance makes quantum learning more stable and efficient.
WAPPO optimizes feature distributions for better visual transfer in RL.
problem Improving visual transfer in reinforcement learning.
method WAPPO uses Wasserstein Confusion to minimize feature distribution distance.
result WAPPO outperforms previous methods in visual transfer across different environments.
A new discrete formula connects vertex and edge distributions on graphs.
problem Optimal transport on graphs with mixed vertex and edge distributions.
method Discrete transport equation and Benamou-Brenier formulation.
result Classification of all Wasserstein-1 geodesics on graphs.
Study the tradeoff between signal distortion and human perception over finite channels.
problem Characterize the distortion-perception tradeoff for finite channels with arbitrary metrics.
method Solve linear programming problems to compute the distortion-perception function and optimal reconstructions.
result DP function is piecewise linear in the perception index.
We propose an approach to fair classification that enforces independence between the classifier outputs and sensitive information by minimizing Wasserstein-1 distances. The approach has desirable theoretical properties and is robust to specific choices of the threshold used to obtain class predictions from model output…
Neural network models accurately price assets in rough Bergomi model.
problem Accurately pricing assets in the rough Bergomi model with hidden parameters.
method Used a neural SDE to learn the forward variance curve, proposing a numerical scheme for simulation.
result The learned forward variance curve calibrates asset prices and option prices simultaneously.
Efficiently simulates and calibrates the rough Bergomi model using Wasserstein distance.
problem High computational complexity in pricing and calibration of the rough Bergomi model.
method Developed a modified-sum-of-exponentials Monte Carlo scheme and a calibration approach based on Wasserstein-1 distance.
result The method achieves high pricing accuracy and improved parameter recovery, optimization stability, and out-of-sample performance.
New method calculates Ricci curvature from distances between weighted volumes.
problem Calculating Ricci curvature for weighted Riemannian manifolds.
method Asymptotic retrieval of generalized Ricci tensor from scaled metric derivatives of Wasserstein 1-distances.
result Limiting coarse curvature of random graphs converges to generalized Ricci tensor.
New Wasserstein divergence improves generative model robustness and structure preservation.
problem Improving generative model robustness and structure preservation.
method Introduces a novel Wasserstein-1 path-space divergence and a WUP theorem.
result Derives robustness and generalization bounds for flow-based models.
Paper provides statistical guarantees for GANs estimating Hölder space densities.
problem Statistical properties and theoretical guarantees for GANs.
method Approximation and statistical guarantees for GANs using Hölder space densities.
result GANs are consistent estimators of data distributions under strong discrepancy metrics.
Wasserstein Generative Adversarial Networks (WGANs) provide a versatile class of models, which have attracted great attention in various applications. However, this framework has two main drawbacks: (i) Wasserstein-1 (or Earth-Mover) distance is restrictive such that WGANs cannot always fit data geometry well; (ii) It …
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.
This study analyzes the quadratic Wasserstein metric's effects on inverse data matching.
problem Analyzing the quadratic Wasserstein metric's impact on inverse data matching.
method Characterizes and numerically analyzes the smoothing effect and convexity improvement of W2 distance. result The W2 distance improves convexity and reduces resolution for reconstructed objects at a given noise level. Novel coarse extrinsic curvature for Riemannian submanifolds.
problem Understanding extrinsic curvature of submanifolds.
method Derived from Wasserstein 1-distance between probability measures.
result New insights and approximation of mean curvature from data.
In the last couple of years, several adversarial attack methods based on different threat models have been proposed for the image classification problem. Most existing defenses consider additive threat models in which sample perturbations have bounded L_p norms. These defenses, however, can be vulnerable against advers…
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 W1 distance. Paper improves MMD flow efficiency with Riesz kernels for image generation.
problem High computational costs in MMD flows for large scale computations.
method Introduces Riesz kernels and sliced MMD for efficient computation.
result Efficient computation of MMD gradients in one-dimensional setting.
Generative models improve inverse problems by providing tailored priors.
problem Analyzing the error in inverse problems solved with generative priors.
method Quantitative error bounds for minimum Wasserstein-2 generative models.
result The error in the posterior due to the generative prior is bounded by the prior's error in Wasserstein-1 distance.
The paper improves GANs' theoretical guarantees for low-dimensional data.
problem Theoretical guarantees for GANs' statistical accuracy remain pessimistic.
method Analytical derivation of statistical guarantees on estimated densities.
result Theoretical rates of convergence for GANs and BiGANs are derived.
The study derives generalization bounds for neural oscillators, improving their performance with regularization.
problem Quantifying the generalization capacities of neural oscillators.
method Using Rademacher complexity and squared Wasserstein-1 distances, the study derives theoretical upper PAC generalization bounds for neural oscillators.
result Theoretical bounds show polynomial growth in estimation errors with MLP size and time length, and regularization improves performance.
The paper improves generative models to avoid replicating observed examples.
problem Improving generative models to avoid replicating observed examples.
method Theoretical insights into the Wasserstein GAN, constrained to left-invertible push-forward maps, generating distributions that avoid replication and significantly deviate from the empirical distribution.
result Left-invertibility achieves this without compromising statistical optimality.
The paper develops methods for sampling from log-concave distributions with constraints.
problem Sampling from log-concave distributions with constraints.
method Randomized midpoint discretization of Langevin diffusions with various projections.
result New convergence guarantees for constrained Langevin algorithms.
Estimates changes in parameters from sparse binomial observations.
problem Sparse observations of binomial parameters over a large population.
method Two-step procedure: MLE for joint distribution, then for change distribution and magnitude.
result Achieves optimal error bounds for estimating change distribution and magnitude.
Solves memorization in diffusion models for manifold data.
problem Memorization effect in diffusion models for manifold data.
method Inertia update at the end of empirical diffusion simulation.
result Approximates true data distribution on a C2 manifold. Bounds on Gaussian approximation for neural networks with novel smoothing techniques.
problem Approximating the distribution of wide random neural networks.
method Stein's method, Gaussian smoothing, Laplacian operators, Cameron-Martin space.
result First bounds on Gaussian approximation of wide random neural networks.
This paper proposes an efficient method for sampling from stochastic differential equations using PSD models.
problem Efficient sampling from stochastic differential equations with positive semi-definite models.
method The approach leverages a PSD model to sample from the Fokker-Planck equation or its fractional variant, with a complexity of m2dlog(1/ε). result The method produces i.i.d. samples with error ε in Wasserstein-1 distance, with a cost of O(dε−2(d+1)/β−2log(1/ε)2d+3) per sample. Paper proposes a new framework to improve policy optimization by aligning real and simulated data distributions.
problem Inaccurate model estimation leads to performance degradation in model-based reinforcement learning.
method Introduces unsupervised model adaptation to minimize the IPM between real and simulated data distributions.
result Achieves state-of-the-art performance in sample efficiency on various continuous control tasks.
To improve the performance of classical generative adversarial network (GAN), Wasserstein generative adversarial networks (W-GAN) was developed as a Kantorovich dual formulation of the optimal transport (OT) problem using Wasserstein-1 distance. However, it was not clear how cycleGAN-type generative models can be deriv…
Improved change point detection using matched filters for non-parametric tests.
problem False positives and localization ambiguity in non-parametric two-sample tests.
method Derived and applied matched filters for various two-sample tests.
result Matched filters reduce false positives and improve test precision.
The paper tests properties of multiple distributions with limited samples.
problem Testing properties of multiple distributions with few samples.
method Designing testers for uniformity, identity, and closeness testing under specific conditions.
result Sample optimal testers for uniformity, identity, and closeness testing are provided.
Uniform-in-time analysis for Stein Variational Gradient Descent across various metrics.
problem Understanding long-term behavior of finite-particle systems in relation to their mean-field limits.
method Developed uniform-in-time propagation-of-chaos results for continuous-time SVGD using cutoff strategies and finite-dimensional theories.
result Uniform-in-time propagation-of-chaos bounds in various metrics, including Langevin kernel Stein discrepancy, Wasserstein-1, and Wasserstein-2 distances.
LACD uses unlabeled data to improve conditional diffusion models.
problem Costly and time-consuming acquisition of labeled data.
method Label-augmented conditional diffusion (LACD) with joint denoising score matching.
result LACD converges faster in total variation and Wasserstein-1 distances with sufficient unlabeled data.
This paper approximates SA iterates using Gaussian distributions for tail bounds.
problem Characterizing the distribution of stochastic approximation iterates in finite time.
method Approximating pre-limit distributions of SA iterates by Gaussian sequences with recursively defined covariances.
result Explicit bounds on the Wasserstein-1 distance between rescaled iterates and Gaussians.
The paper bounds the expectation of empirical processes indexed by Hölder classes.
problem Estimating the expectation of the supremum of empirical processes for distributions on bounded sets.
method Providing upper bounds on the expectation of the supremum of empirical processes indexed by Hölder classes.
result Deriving non-asymptotic risk bounds for estimating distributions using empirical processes and IPM.
Comparing counterfactual distributions can provide more nuanced and valuable measures for causal effects, going beyond typical summary statistics such as averages. In this work, we consider characterizing causal effects via distributional distances, focusing on two kinds of target parameters. The first is the counterfa…
Network embedding has become a hot research topic recently which can provide low-dimensional feature representations for many machine learning applications. Current work focuses on either (1) whether the embedding is designed as an unsupervised learning task by explicitly preserving the structural connectivity in the n…
New framework for robust regularization under uncertain data distributions.
problem Addressing ill-posed inverse problems and statistical estimation under distributional uncertainty.
method Distributionally robust optimal regularization using convex duality.
result Identifies robust regularizers that remain effective under data distributional perturbations.
We study three fundamental statistical-learning problems: distribution estimation, property estimation, and property testing. We establish the profile maximum likelihood (PML) estimator as the first unified sample-optimal approach to a wide range of learning tasks. In particular, for every alphabet size k and desired…
Wasserstein GANs fail to approximate Wasserstein distance, leading to their success.
problem Approximating Wasserstein distance in deep generative models.
method Analysis of differences between theoretical setup and training reality.
result Wasserstein GANs' success is due to their failure to approximate Wasserstein distance.
Study on conditions for achieving optimal robustness in statistical estimators.
problem Achieving the optimal robustness of estimators in statistical models.
method Developed a Wasserstein analogue of the Cramer-Rao inequality and investigated conditions for achieving the Wasserstein-Cramer-Rao lower bound.
result Conditions for the existence of asymptotically efficient estimators in one-parameter models and location-scale families.
We define a C^1 distance between submanifolds of a riemannian manifold M and show that, if a compact submanifold N is not moved too much under the isometric action of a compact group G, there is a G-invariant submanifold C^1-close to N. The proof involves a procedure of averaging nearby submanifolds of riemannian manif…
Sharp stability result for maps near infinitely concentrated minimisers.
problem Stability of maps near minimisers with infinite concentration.
method Dynamic approach to deform maps into harmonic maps, controlling topology changes.
result Sharp quantitative estimates on map distance to infinitely concentrated minimisers.
Unified score and distance-based GoF tests for model adequacy.
problem Difficulty in extending score-based GoF tests to nonparametric alternatives.
method Introducing semiparametric kernelized Stein discrepancy (SKSD) test.
result SKSD test is computationally efficient and universally consistent.
Study shows continuity and geometric regularity of Kähler-Ricci flow blow-up limits.
problem Geometric regularity of blow-up limits of the Kähler-Ricci flow.
method Established geometric regularity for Type I blow-up limits based on sequences of Ricci vertices.
result The limiting flow is continuous in time in Gromov-Hausdorff and Gromov-W1 distance.