Efficient Federated Learning With Quality-Aware Generated Models: An Incentive Mechanism

Federated learning (FL) encounters slow convergence due to data heterogeneity issues. Recently, generative artificial intelligence (AI) has showcased remarkable capabilities in synthesizing realistic data. To effectively address the challenges of nonindependent and identically distributed (non-IID) data, this article introduces a collaborative AI training framework that leverages generative AI to enhance the learning performance of FL. In this framework, heterogeneous edge devices (HEDs) identify specific data categories lacking in their local data sets and acquire these data from generative AI providers (GAPs). This strategy aims to improve the convergence rate of FL. However, HEDs and GAPs may be reluctant to contribute their resources to FL training due to self-interest. Therefore, an incentive mechanism is necessary to encourage their participation. We propose a reverse auction model to facilitate data transactions among FL training buyers, GAPs, and HEDs within the FL training buyer’s budget. It focuses on determining winners and devising payment rules to maximize the FL training buyer’s utility. This involves solving a 0-1 programming problem with two sellers (GAPs and HEDs). To tackle this, we use joint bidding and virtual seller pairs for analysis. We demonstrate that our method ensures truthfulness, individual rationality, and computational efficiency. Furthermore, we employ a one-side matching mechanism to approximate the optimal solution. We further investigate a strategy to analyze and allocate data based on variance, aiming to minimize non-IID issues in local data. Simulation results demonstrate that our proposed matching mechanism can effectively improve the computational efficiency, with the test accuracy differing from the theoretical optimum by only about 0.7%, and our mechanism can outperform the other greedy algorithms. Additionally, our data allocation strategy enhances the test accuracy by approximately 7% compared to existing methods.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-09-16
DOI
https://doi.org/10.1109/jiot.2024.3461329
Citations
3
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Federated Learning With Quality-Aware Generated Models: An Incentive Mechanism

Peichun Li, Minghui Dai, Hanwen Zhang, Liping Qian et al.
3 citations
IEEE Internet of Things Journal
Privacy-Preserving Technologies in Data
1.04
article

Efficient Federated Learning With Quality-Aware Generated Models: An Incentive Mechanism

Peichun Li, Minghui Dai, Hanwen Zhang, Liping Qian, Yuan Wu
article en
3 citations

Abstract

Federated learning (FL) encounters slow convergence due to data heterogeneity issues. Recently, generative artificial intelligence (AI) has showcased remarkable capabilities in synthesizing realistic data. To effectively address the challenges of nonindependent and identically distributed (non-IID) data, this article introduces a collaborative AI training framework that leverages generative AI to enhance the learning performance of FL. In this framework, heterogeneous edge devices (HEDs) identify specific data categories lacking in their local data sets and acquire these data from generative AI providers (GAPs). This strategy aims to improve the convergence rate of FL. However, HEDs and GAPs may be reluctant to contribute their resources to FL training due to self-interest. Therefore, an incentive mechanism is necessary to encourage their participation. We propose a reverse auction model to facilitate data transactions among FL training buyers, GAPs, and HEDs within the FL training buyer’s budget. It focuses on determining winners and devising payment rules to maximize the FL training buyer’s utility. This involves solving a 0-1 programming problem with two sellers (GAPs and HEDs). To tackle this, we use joint bidding and virtual seller pairs for analysis. We demonstrate that our method ensures truthfulness, individual rationality, and computational efficiency. Furthermore, we employ a one-side matching mechanism to approximate the optimal solution. We further investigate a strategy to analyze and allocate data based on variance, aiming to minimize non-IID issues in local data. Simulation results demonstrate that our proposed matching mechanism can effectively improve the computational efficiency, with the test accuracy differing from the theoretical optimum by only about 0.7%, and our mechanism can outperform the other greedy algorithms. Additionally, our data allocation strategy enhances the test accuracy by approximately 7% compared to existing methods.

IEEE Internet of Things JournalVol. 12(2)
University of Macau (MO), Zhejiang University of Technology (CN), City University of Macau (MO)
Openalex Percentile: Top 19%
Privacy-Preserving Technologies in Data
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.