mlsanityData to 14 Oct 2026

Selective information exchange in collaborative clustering using regularized Optimal Transport

arXiv 2103.12071 ↗First posted 22 Mar 2021cs.LG cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

Collaborative learning has recently achieved very significant results. It still suffers, however, from several issues, including the type of information that needs to be exchanged, the criteria for stopping and how to choose the right collaborators. We aim in this paper to improve the quality of the collaboration and to resolve these issues via a novel approach inspired by Optimal Transport theory. More specifically, the objective function for the exchange of information is based on the Wasserstein distance, with a bidirectional transport of information between collaborators. This formulation allows to learns a stopping criterion and provide a criterion to choose the best collaborators. Extensive experiments are conducted on multiple data-sets to evaluate the proposed approach.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 39 references that are in the map. First posted on arXiv 22 Mar 2021.

Builds on

4 of 39 references.

References · 4

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2013Fast Computation of Wasserstein Barycenterscited by 216
  3. 2013A Survey on Multi-view Learningcited by 152
  4. 2017Multilevel Clustering via Wasserstein Meanscited by 49

Built on by

Not cited yet.