This repository contains the code used for the experiments in "Fast solution to the fair ranking problem using the Sinkhorn algorithm" (PRICAI 2024) In two-sided marketplaces such as online flea ...

def sinkhorn_normalized(x, y, epsilon, n, niter): Wxy = sinkhorn_loss(x, y, epsilon, n, niter) Wxx = sinkhorn_loss(x, x, epsilon, n, niter) Wyy = sinkhorn_loss(y, y ...

Abstract: In this paper, we present COFFEE, cross-layer optimization for fast and efficient executions of the Sinkhorn-Knopp (SK) algorithm on HPC systems with clusters of compute nodes by exploring ...

Abstract: Multimodal alignment aims to establish a matching relationship between multimodal features, connecting parts of different modalities that contain the same or similar semantics. To increase ...

Optimal transport offers an alternative to maximum likelihood for learning generative autoencoding models. We show that minimizing the p-Wasserstein distance between the generator and the true data ...