Stochastic approximation versus sample average approximation for Wasserstein barycenters
From MaRDI portal
(Redirected from Publication:5058387)
Recommendations
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- Robust Stochastic Approximation Approach to Stochastic Programming
- Sample complexity of sample average approximation for conditional stochastic optimization
- Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures
- Regularized barycenters in the Wasserstein space
Cites work
- A friendly smoothed analysis of the simplex method
- A smoothed dual approach for variational Wasserstein problems
- A Stochastic Approximation Method
- A transportation \(L^p\) distance for signal analysis
- A Wasserstein-Type Distance in the Space of Gaussian Mixture Models
- Alternating minimization methods for strongly convex optimization
- Barycenters in the Wasserstein space
- Bayesian learning with Wasserstein barycenters
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Characterization of barycenters in the Wasserstein space by averaging optimal transport maps
- Convex color image segmentation with optimal transport distances
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Data-driven regularization of Wasserstein barycenters with an application to multivariate density registration
- Distribution's template estimate with Wasserstein metrics
- Elements of statistical inference in 2-Wasserstein space
- Empirical regularized optimal transport: statistical theory and applications
- Existence and consistency of Wasserstein barycenters
- Fast convergence of empirical barycenters in Alexandrov spaces and the Wasserstein space
- Faster scaling algorithms for general graph matching problems
- Gradient methods for problems with inexact model of the objective
- Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
- scientific article; zbMATH DE number 3053873 (Why is no real title available?)
- Inference for empirical Wasserstein distances on finite spaces
- Iterative Bregman projections for regularized transportation problems
- Learning by mirror averaging
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lectures on Stochastic Programming
- Network flows. Theory, algorithms, and applications.
- Non-asymptotic confidence bounds for the optimal value of a stochastic program
- On complexity of stochastic programming problems
- On the scaling of multidimensional matrices
- Parametric estimation. Finite sample theory
- Penalization of barycenters in the Wasserstein space
- Primal-dual subgradient methods for convex problems
- Robust clustering tools based on optimal transportation
- Robust Stochastic Approximation Approach to Stochastic Programming
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Statistical inference for Bures-Wasserstein barycenters
- Understanding machine learning. From theory to algorithms
- Unifying mirror descent and dual averaging
- Upper and lower risk bounds for estimating the Wasserstein barycenter of random measures on the real line
Cited in
(5)- Wide consensus aggregation in the Wasserstein space. Application to location-scatter families
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- Sampling of probability measures in the convex order by Wasserstein projection
- Stochastic Approximation versus Sample Average Approximation for population Wasserstein barycenters
This page was built for publication: Stochastic approximation versus sample average approximation for Wasserstein barycenters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058387)
