Paid with Models: Optimal Contract Design for Collaborative Machine Learning
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_ | 1866917881915113472 |
|---|---|
| author | Wang, Bingchen Wu, Zhaoxuan Liu, Fusheng Low, Bryan Kian Hsiang |
| author_facet | Wang, Bingchen Wu, Zhaoxuan Liu, Fusheng Low, Bryan Kian Hsiang |
| contents | Collaborative machine learning (CML) provides a promising paradigm for democratizing advanced technologies by enabling cost-sharing among participants. However, the potential for rent-seeking behaviors among parties can undermine such collaborations. Contract theory presents a viable solution by rewarding participants with models of varying accuracy based on their contributions. However, unlike monetary compensation, using models as rewards introduces unique challenges, particularly due to the stochastic nature of these rewards when contribution costs are privately held information. This paper formalizes the optimal contracting problem within CML and proposes a transformation that simplifies the non-convex optimization problem into one that can be solved through convex optimization algorithms. We conduct a detailed analysis of the properties that an optimal contract must satisfy when models serve as the rewards, and we explore the potential benefits and welfare implications of these contract-driven CML schemes through numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_11122 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Paid with Models: Optimal Contract Design for Collaborative Machine Learning Wang, Bingchen Wu, Zhaoxuan Liu, Fusheng Low, Bryan Kian Hsiang Machine Learning Artificial Intelligence Computer Science and Game Theory Theoretical Economics Collaborative machine learning (CML) provides a promising paradigm for democratizing advanced technologies by enabling cost-sharing among participants. However, the potential for rent-seeking behaviors among parties can undermine such collaborations. Contract theory presents a viable solution by rewarding participants with models of varying accuracy based on their contributions. However, unlike monetary compensation, using models as rewards introduces unique challenges, particularly due to the stochastic nature of these rewards when contribution costs are privately held information. This paper formalizes the optimal contracting problem within CML and proposes a transformation that simplifies the non-convex optimization problem into one that can be solved through convex optimization algorithms. We conduct a detailed analysis of the properties that an optimal contract must satisfy when models serve as the rewards, and we explore the potential benefits and welfare implications of these contract-driven CML schemes through numerical experiments. |
| title | Paid with Models: Optimal Contract Design for Collaborative Machine Learning |
| topic | Machine Learning Artificial Intelligence Computer Science and Game Theory Theoretical Economics |
| url | https://arxiv.org/abs/2412.11122 |