Utility-Maximizing Bidding Strategy for Data Consumers in Auction-based
Federated Learning
- URL: http://arxiv.org/abs/2305.06784v2
- Date: Mon, 15 May 2023 01:49:56 GMT
- Title: Utility-Maximizing Bidding Strategy for Data Consumers in Auction-based
Federated Learning
- Authors: Xiaoli Tang, Han Yu
- Abstract summary: Auction-based Federated Learning (AFL) has attracted extensive research interest due to its ability to motivate data owners to join FL through economic means.
This paper proposes a first-of-its-kind utility-maximizing bidding strategy for data consumers in federated learning (Fed-Bidder)
- Score: 14.410324763825733
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Auction-based Federated Learning (AFL) has attracted extensive research
interest due to its ability to motivate data owners to join FL through economic
means. Existing works assume that only one data consumer and multiple data
owners exist in an AFL marketplace (i.e., a monopoly market). Therefore, data
owners bid to join the data consumer for FL. However, this assumption is not
realistic in practical AFL marketplaces in which multiple data consumers can
compete to attract data owners to join their respective FL tasks. In this
paper, we bridge this gap by proposing a first-of-its-kind utility-maximizing
bidding strategy for data consumers in federated learning (Fed-Bidder). It
enables multiple FL data consumers to compete for data owners via AFL
effectively and efficiently by providing with utility estimation capabilities
which can accommodate diverse forms of winning functions, each reflecting
different market dynamics. Extensive experiments based on six commonly adopted
benchmark datasets show that Fed-Bidder is significantly more advantageous
compared to four state-of-the-art approaches.
Related papers
- Vertical Federated Learning Hybrid Local Pre-training [4.31644387824845]
We propose a novel VFL Hybrid Local Pre-training (VFLHLP) approach for Vertical Federated Learning (VFL)
VFLHLP first pre-trains local networks on the local data of participating parties.
Then it utilizes these pre-trained networks to adjust the sub-model for the labeled party or enhance representation learning for other parties during downstream federated learning on aligned data.
arXiv Detail & Related papers (2024-05-20T08:57:39Z) - Agent-oriented Joint Decision Support for Data Owners in Auction-based Federated Learning [32.6997332038178]
Auction-based Federated Learning (AFL) has attracted extensive research interest due to its ability to motivate data owners (DOs) to join FL through economic means.
We propose a first-of-its-kind agent-oriented joint Pricing, Acceptance and Sub-delegation decision support approach for data owners in AFL (PAS-AFL)
It is the first to enable each DO to take on multiple FL tasks simultaneously to earn higher income for DOs and enhance the throughput of FL tasks in the AFL ecosystem.
arXiv Detail & Related papers (2024-05-09T02:35:46Z) - Intelligent Agents for Auction-based Federated Learning: A Survey [41.4320233892375]
Auction-based federated learning (AFL) is an emerging category of FL incentive mechanism design.
We provide a first-of-its-kind survey on the Intelligent Agents for AFL (IA-AFL) literature.
arXiv Detail & Related papers (2024-04-20T03:05:25Z) - A Bargaining-based Approach for Feature Trading in Vertical Federated
Learning [54.51890573369637]
We propose a bargaining-based feature trading approach in Vertical Federated Learning (VFL) to encourage economically efficient transactions.
Our model incorporates performance gain-based pricing, taking into account the revenue-based optimization objectives of both parties.
arXiv Detail & Related papers (2024-02-23T10:21:07Z) - PFL-GAN: When Client Heterogeneity Meets Generative Models in
Personalized Federated Learning [55.930403371398114]
We propose a novel generative adversarial network (GAN) sharing and aggregation strategy for personalized learning (PFL)
PFL-GAN addresses the client heterogeneity in different scenarios. More specially, we first learn the similarity among clients and then develop an weighted collaborative data aggregation.
The empirical results through the rigorous experimentation on several well-known datasets demonstrate the effectiveness of PFL-GAN.
arXiv Detail & Related papers (2023-08-23T22:38:35Z) - DPP-based Client Selection for Federated Learning with Non-IID Data [97.1195165400568]
This paper proposes a client selection (CS) method to tackle the communication bottleneck of federated learning (FL)
We first analyze the effect of CS in FL and show that FL training can be accelerated by adequately choosing participants to diversify the training dataset in each round of training.
We leverage data profiling and determinantal point process (DPP) sampling techniques to develop an algorithm termed Federated Learning with DPP-based Participant Selection (FL-DP$3$S)
arXiv Detail & Related papers (2023-03-30T13:14:54Z) - Towards Interpretable Federated Learning [19.764172768506132]
Federated learning (FL) enables multiple data owners to build machine learning models collaboratively without exposing their private local data.
It is important to balance the need for performance, privacy-preservation and interpretability, especially in mission critical applications such as finance and healthcare.
We conduct comprehensive analysis of the representative IFL approaches, the commonly adopted performance evaluation metrics, and promising directions towards building versatile IFL techniques.
arXiv Detail & Related papers (2023-02-27T02:06:18Z) - FL Games: A Federated Learning Framework for Distribution Shifts [71.98708418753786]
Federated learning aims to train predictive models for data that is distributed across clients, under the orchestration of a server.
We propose FL GAMES, a game-theoretic framework for federated learning that learns causal features that are invariant across clients.
arXiv Detail & Related papers (2022-10-31T22:59:03Z) - DataPerf: Benchmarks for Data-Centric AI Development [81.03754002516862]
DataPerf is a community-led benchmark suite for evaluating ML datasets and data-centric algorithms.
We provide an open, online platform with multiple rounds of challenges to support this iterative development.
The benchmarks, online evaluation platform, and baseline implementations are open source.
arXiv Detail & Related papers (2022-07-20T17:47:54Z) - VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations.
Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data.
Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
arXiv Detail & Related papers (2022-05-31T17:45:30Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.