Federated Learning for Discrete Optimal Transport with Large Population under Incomplete Information

Navpreet Kaur, Juntao Chen, Yingdong Lu
11/12/2024
cs.AI

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Optimal transport is a powerful framework for the efficient allocation of resources between sources and targets. However, traditional models often struggle to scale effectively in the presence of large and heterogeneous populations. In this work, we introduce a discrete optimal transport framework designed to handle large-scale, heterogeneous target populations, characterized by type distributions. We address two scenarios: one where the type distribution of targets is known, and one where it is unknown. For the known distribution, we propose a fully distributed algorithm to achieve optimal resource allocation. In the case of unknown distribution, we develop a federated learning-based approach that enables efficient computation of the optimal transport scheme while preserving privacy. Case studies are provided to evaluate the performance of our learning algorithm.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kaur2024federated,
  title  = {Federated Learning for Discrete Optimal Transport with Large Population under Incomplete Information},
  author = {Navpreet Kaur and Juntao Chen and Yingdong Lu},
  year   = {2024},
  eprint = {2411.07841},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.07841v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.07841.svg)](https://codeofpaper.com/paper/2411.07841)

Discussion