Incentive-Aware Decentralized Data Collaboration
Yatong Wang, Yuncheng Wu, Xincheng Chen, Gang Feng, Beng Chin Ooi
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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get faa74f19-ddc3-4418-b2f4-c9d59270e65aCited by top-tier papers2
- Secure and Verifiable Data Collaboration with Low-Cost Zero-Knowledge ProofsYizheng Zhu, Yuncheng Wu, Zhaojing Luo, Beng Chin Ooi et al.VLDB 2024 · 14 citations
- Performance-Based Pricing of Federated Learning via AuctionZitao Li, Bolin Ding, Liuyi Yao, Yaliang Li et al.VLDB 2024 · 7 citations
Related papers
- MMDFL: Multi-Model-based Decentralized Federated Learning for Resource-Constrained AIoT SystemsDengke Yan, Yanxin Yang, Ming Hu, Xin Fu et al.DAC 2025 · 3 citations
- One for One, or All for All: Equilibria and Optimality of Collaboration in Federated LearningAvrim Blum, Nika Haghtalab, Richard Lanas Phillips, Han ShaoICML 2021 · 62 citations
- Incentive-Aware Federated Learning with Training-Time Model RewardsZhaoxuan Wu, Mohammad Mohammadi Amiri, Ramesh Raskar, Bryan Kian Hsiang LowICLR 2024 · 9 citations
- An Incentive Mechanism Design for Efficient Edge Learning by Deep Reinforcement Learning ApproachYufeng Zhan, Jiang ZhangINFOCOM 2020 · 102 citations
- DisPFL: Towards Communication-Efficient Personalized Federated Learning via Decentralized Sparse TrainingRong Dai, Li Shen, Fengxiang He, Xinmei Tian et al.ICML 2022 · 163 citations
