Corpus ID: 235765327

Geometric averages of partitioned datasets

@article{Needham2021GeometricAO,
  title={Geometric averages of partitioned datasets},
  author={Tom Needham and Thomas Weighill},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.03460}
}
We introduce a method for jointly registering ensembles of partitioned datasets in a way which is both geometrically coherent and partition-aware. Once such a registration has been defined, one can group partition blocks across datasets in order to extract summary statistics, generalizing the commonly used order statistics for scalar-valued data. By modeling a partitioned dataset as an unordered k-tuple of points in a Wasserstein space, we are able to draw from techniques in optimal transport… Expand

References

SHOWING 1-10 OF 50 REFERENCES
Geometry of Sample Spaces.
In statistics, independent, identically distributed random samples do not carry a natural ordering, and their statistics are typically invariant with respect to permutations of their order. Thus, anExpand
Discrete Wasserstein barycenters: optimal transport for discrete data
TLDR
The results rely heavily on polyhedral theory which is possible due to the discrete structure of the marginals, and it is established that Wasserstein barycenters must also be discrete measures and there is always a barycenter which is provably sparse. Expand
Fast Computation of Wasserstein Barycenters
TLDR
The Wasserstein distance is proposed to be smoothed with an entropic regularizer and recover in doing so a strictly convex objective whose gradients can be computed for a considerably cheaper computational cost using matrix scaling algorithms. Expand
On the Computation of Wasserstein Barycenters
TLDR
A general version of the equivalence of the Wasserstein barycenter problem to the n-coupling problem is state, which provides as a main contribution a simple to implement algorithm for computing barycenters. Expand
Stochastic Wasserstein Barycenters
TLDR
This work presents a stochastic algorithm to compute the barycenter of a set of probability distributions under the Wasserstein metric from optimal transport that can be extended to applications such as generating super samples from a given distribution and recovering blue noise approximations. Expand
Ricci curvature for metric-measure spaces via optimal transport
We dene a notion of a measured length space X having nonnegative N-Ricci curvature, for N 2 [1;1), or having1-Ricci curvature bounded below byK, forK2 R. The denitions are in terms of theExpand
Wasserstein Barycenter and Its Application to Texture Mixing
TLDR
A new definition of the averaging of discrete probability distributions as a barycenter over the Monge-Kantorovich optimal transport space is proposed and a new fast gradient descent algorithm is introduced to compute Wasserstein barycenters of point clouds. Expand
Geometry of Graph Partitions via Optimal Transport
TLDR
The distance between partitions of a graph is defined using machinery from optimal transport and several theoretical properties of the metric are derived, specifically focusing on its value for new problems in ensemble-based analysis of political districting plans. Expand
Probability Measures on Metric Spaces of Nonpositive Curvature
We present an introduction to metric spaces of nonpositive curvature (”NPC spaces”) and a discussion of barycenters of probability measures on such spaces. In our introduction to NPC spaces, we willExpand
A geometric study of Wasserstein spaces: Hadamard spaces
Optimal transport enables one to construct a metric on the set of (sufficiently small at infinity) probability measures on any (not too wild) metric space X, called its Wasserstein space W(X). InExpand
...
1
2
3
4
5
...