Minimax Confidence Intervals for the Sliced Wasserstein Distance

Abstract

Motivated by the growing popularity of variants of the Wasserstein distance in statistics and machine learning, we study statistical inference for the Sliced Wasserstein distance--an easily computable variant of the Wasserstein distance. Specifically, we construct confidence intervals for the Sliced Wasserstein distance which have finite-sample validity under no assumptions or under mild moment assumptions. These intervals are adaptive in length to the regularity of the underlying distributions. We also bound the minimax risk of estimating the Sliced Wasserstein distance, and as a consequence establish that the lengths of our proposed confidence intervals are minimax optimal over appropriate distribution classes. To motivate the choice of these classes, we also study minimax rates of estimating a distribution under the Sliced Wasserstein distance. These theoretical findings are complemented with a simulation study demonstrating the deficiencies of the classical bootstrap, and the advantages of our proposed methods. We also show strong correspondences between our theoretical predictions and the adaptivity of our confidence interval lengths in simulations. We conclude by demonstrating the use of our confidence intervals in the setting of simulator-based likelihood-free inference. In this setting, contrasting popular approximate Bayesian computation methods, we develop uncertainty quantification methods with rigorous frequentist coverage guarantees.

Published at https://doi.org/10.1214/22-EJS2001 in the Electronic Journal of Statistics

References in corpus (13)

• Approximate Bayesian computation with the Wasserstein distance
• Sequential Monte Carlo with Adaptive Weights for Approximate Bayesian Computation
• Multilevel Clustering via Wasserstein Means
• Generalized Sliced Wasserstein Distances
• A Unifying Approach to Distributional Limits for Empirical Optimal Transport
• Convergence Rates for Gaussian Mixtures of Experts
• Central Limit Theorems for General Transportation Costs
• Distributional Sliced-Wasserstein and Applications to Generative Modeling
• On the Minimax Optimality of Estimating the Wasserstein Metric
• Limit Laws for Empirical Optimal Solutions in Stochastic Linear Programs
• Validation of Approximate Likelihood and Emulator Models for Computationally Intensive Simulations
• Confidence Sets and Hypothesis Testing in a Likelihood-Free Inference Setting
• Hypothesis Test and Confidence Analysis with Wasserstein Distance on General Dimension

Cited by in corpus (7)

• Faster Wasserstein Distance Estimation with the Sinkhorn Divergence
• Sharp Convergence Rates for Empirical Optimal Transport with Smooth Costs
• Statistical and Topological Properties of Sliced Probability Divergences
• Two-sample Test using Projected Wasserstein Distance
• Martingale Methods for Sequential Estimation of Convex Functionals and Divergences
• On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification
• Uniform Confidence Band for Optimal Transport Map on One-Dimensional Data