Incentive-Aware Decentralized Data Collaboration

Author:

Wang Yatong1ORCID,Wu Yuncheng2ORCID,Chen Xincheng2ORCID,Feng Gang1ORCID,Ooi Beng Chin2ORCID

Affiliation:

1. University of Electronic Science and Technology of China, ChengDu, China

2. National University of Singapore, Singapore, Singapore

Abstract

Data collaboration enables multiple parties to pool data for deriving meaningful data insights. However, data misuse and unlawful data collection have led to precautionary measures being imposed by individual organizations to guide against data leakage and abuse. As a response, decentralized federated learning (DFL) has emerged as an attractive paradigm to facilitate data collaboration while being amenable to privacy-preserving data and knowledge sharing, cost reduction, and prediction accuracy improvement. Unfortunately, the participating parties in DFL tend to be heterogeneous with skew datasets and uneven capabilities. Inevitably, training and transmission costs, and the presence of free-riders pose challenges to the adoption and participation of DFL. The absence of centralized parameter servers further exacerbates the problem of evaluating the contribution of each individual party. Therefore, an effective incentive mechanism is essential to promote data collaboration. In this paper, we propose a novel Incentive-aware Decentralized fEderated leArning (IDEA) framework for facilitating data collaboration. Specifically, we first design a customizable reward scheme for heterogeneous parties to optimize their respective objectives such as higher model accuracy, communication efficiency, and computational efficiency. To reward fairly to deserving parties while offering flexibility, we propose a novel multi-agent reinforcement learning (MARL) incentive mechanism, which enables heterogeneous parties to learn their own optimal collaboration policy. We then design an efficient decentralized data collaboration algorithm that supports the customizable reward scheme based on individual objective-specific collaboration policy. We theoretically prove that the algorithm achieves a Nash equilibrium, which ensures the fairness of the corresponding rewards for parties. We conduct extensive experiments to evaluate the performance of our proposed framework against four baselines on five real-world datasets. The results show that IDEA outperforms state-of-the-art methods in terms of effectiveness, efficiency, and accumulated reward.

Funder

Singapore Ministry of Education Academic Research Fund Tier 3

Huawei cooperation project

National Key Research and Development Program of China

Publisher

Association for Computing Machinery (ACM)

Reference72 articles.

1. Durmus Alp Emre Acar Yue Zhao Ramon Matas Matthew Mattina Paul Whatmough and Venkatesh Saligrama. 2020. Federated Learning Based on Dynamic Regularization. In ICLR. Durmus Alp Emre Acar Yue Zhao Ramon Matas Matthew Mattina Paul Whatmough and Venkatesh Saligrama. 2020. Federated Learning Based on Dynamic Regularization. In ICLR.

2. Skellam mixture mechanism

3. Albert-László Barabási and Réka Albert . 1999. Emergence of scaling in random networks. science , Vol. 286 , 5439 ( 1999 ), 509--512. Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512.

4. Albert-László Barabási , Réka Albert , and Hawoong Jeong . 1999. Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications , Vol. 272 , 1--2 ( 1999 ), 173--187. Albert-László Barabási, Réka Albert, and Hawoong Jeong. 1999. Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications, Vol. 272, 1--2 (1999), 173--187.

5. Lawrence E Blume . 1993. The statistical mechanics of strategic interaction. Games and economic behavior , Vol. 5 , 3 ( 1993 ), 387--424. Lawrence E Blume. 1993. The statistical mechanics of strategic interaction. Games and economic behavior, Vol. 5, 3 (1993), 387--424.

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Responsible Sharing of Spatiotemporal Data;Companion of the 2024 International Conference on Management of Data;2024-06-09

2. Adaptive Data Collaboration Based on Multi-Agent Reinforcement Learning in Internet of Things;2024 IEEE International Conference on Communications Workshops (ICC Workshops);2024-06-09

3. Applications and Challenges for Large Language Models: From Data Management Perspective;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. Performance-Based Pricing for Federated Learning via Auction;Proceedings of the VLDB Endowment;2024-02

5. The Metaverse Data Deluge: What Can We Do About It?;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3