Federated Learning for Discrete Optimal Transport with Large Population under Incomplete Information
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912116251820032 |
|---|---|
| author | Kaur, Navpreet Chen, Juntao Lu, Yingdong |
| author_facet | Kaur, Navpreet Chen, Juntao Lu, Yingdong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07841 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Federated Learning for Discrete Optimal Transport with Large Population under Incomplete Information Kaur, Navpreet Chen, Juntao Lu, Yingdong Artificial Intelligence 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. |
| title | Federated Learning for Discrete Optimal Transport with Large Population under Incomplete Information |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2411.07841 |