- class ott.solvers.linear.discrete_barycenter.FixedBarycenter(threshold=0.01, norm_error=1, inner_iterations=10, min_iterations=0, max_iterations=2000, lse_mode=True, debiased=False)[source]#
A Wasserstein barycenter solver for histograms on a common geometry.
This solver uses a variant of the
Sinkhornalgorithm proposed in [Janati et al., 2020] to compute the barycenter of various measures supported on the same (common to all) geometry. The geometry is assumed to be either symmetric, or to describe costs between a set of points and another. In that case all reference measures have support on the first measure, whereas the barycenter is supported on the second.
float) – convergence threshold. The algorithm stops when the marginal violations of all transport plans computed for that barycenter go below that threshold.
int) – norm used to compute marginal deviation.
float) – number of iterations run before recomputing errors.
int) – number of iterations run without checking whether termination criterion is true.
int) – maximal number of iterations.
bool) – sets computations in kernel (
False) or log-sum-exp mode.
bool) – uses debiasing correction to avoid blur due to entropic regularization.