Incentive Allocation in Vertical Federated Learning Based on Bankruptcy Problem

• URL: http://arxiv.org/abs/2307.03515v3
• Date: Mon, 10 Feb 2025 10:10:45 GMT
• Title: Incentive Allocation in Vertical Federated Learning Based on Bankruptcy Problem
• Authors: Afsana Khan, Marijn ten Thij, Frank Thuijsman, Anna Wilbik,
• Abstract summary: Vertical federated learning (VFL) is a promising approach for collaboratively training machine learning models. In this paper, we focus on the problem of allocating incentives to the passive parties by the active party. Using the Talmudic division rule, which leads to the Nucleolus, we ensure a fair distribution of incentives.
• Score: 0.0
• License:
• Abstract: Vertical federated learning (VFL) is a promising approach for collaboratively training machine learning models using private data partitioned vertically across different parties. Ideally in a VFL setting, the active party (party possessing features of samples with labels) benefits by improving its machine learning model through collaboration with some passive parties (parties possessing additional features of the same samples without labels) in a privacy preserving manner. However, motivating passive parties to participate in VFL can be challenging. In this paper, we focus on the problem of allocating incentives to the passive parties by the active party based on their contributions to the VFL process. We address this by formulating the incentive allocation problem as a bankruptcy game, a concept from cooperative game theory. Using the Talmudic division rule, which leads to the Nucleolus as its solution, we ensure a fair distribution of incentives. We evaluate our proposed method on synthetic and real-world datasets and show that it ensures fairness and stability in incentive allocation among passive parties who contribute their data to the federated model. Additionally, we compare our method to the existing solution of calculating Shapley values and show that our approach provides a more efficient solution with fewer computations.

Related papers

• Unlearning Clients, Features and Samples in Vertical Federated Learning [1.6124402884077915]
  Vertical Learning (VFL) has received less attention from the research community. In this paper, we explore unlearning in VFL from three perspectives: unlearning clients, unlearning features, and unlearning samples. To unlearn clients and features we introduce VFU-KD which is based on knowledge distillation (KD) while to unlearn samples, VFU-GA is introduced which is based on gradient ascent.
  arXiv  Detail & Related papers  (2025-01-23T14:10:02Z)
• Redefining Contributions: Shapley-Driven Federated Learning [3.9539878659683363]
  Federated learning (FL) has emerged as a pivotal approach in machine learning. It is challenging to ensure global model convergence when participants do not contribute equally and/or honestly. This paper proposes a novel contribution assessment method called ShapFed for fine-grained evaluation of participant contributions in FL.
  arXiv  Detail & Related papers  (2024-06-01T22:40:31Z)
• Mitigating federated learning contribution allocation instability through randomized aggregation [1.827018440608344]
  Federated learning (FL) is a collaborative and privacy-preserving Machine Learning paradigm. A critical challenge in FL lies in fairly and accurately allocating contributions from diverse participants. Inaccurate allocation can undermine trust, lead to unfair compensation, and thus participants may lack the incentive to join or actively contribute to the federation.
  arXiv  Detail & Related papers  (2024-05-13T13:55:34Z)
• 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)
• Vertical Semi-Federated Learning for Efficient Online Advertising [50.18284051956359]
  Semi-VFL (Vertical Semi-Federated Learning) is proposed to achieve a practical industry application fashion for VFL. We build an inference-efficient single-party student model applicable to the whole sample space. New representation distillation methods are designed to extract cross-party feature correlations for both the overlapped and non-overlapped data.
  arXiv  Detail & Related papers  (2022-09-30T17:59:27Z)
• 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)
• Fair and efficient contribution valuation for vertical federated learning [49.50442779626123]
  Federated learning is a popular technology for training machine learning models on distributed data sources without sharing data. The Shapley value (SV) is a provably fair contribution valuation metric originated from cooperative game theory. We propose a contribution valuation metric called vertical federated Shapley value (VerFedSV) based on SV.
  arXiv  Detail & Related papers  (2022-01-07T19:57:15Z)
• Achieving Model Fairness in Vertical Federated Learning [47.8598060954355]
  Vertical federated learning (VFL) enables multiple enterprises possessing non-overlapped features to strengthen their machine learning models without disclosing their private data and model parameters. VFL suffers from fairness issues, i.e., the learned model may be unfairly discriminatory over the group with sensitive attributes. We propose a fair VFL framework to tackle this problem.
  arXiv  Detail & Related papers  (2021-09-17T04:40:11Z)
• GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learning [25.44023017628766]
  Federated Learning (FL) bridges the gap between collaborative machine learning and preserving data privacy. It is essential to fairly evaluate participants' contribution to the performance of the final FL model without exposing their private data. We propose the Guided Truncation Gradient Shapley approach to address this challenge.
  arXiv  Detail & Related papers  (2021-09-05T12:17:00Z)
• Federated Robustness Propagation: Sharing Adversarial Robustness in Federated Learning [98.05061014090913]
  Federated learning (FL) emerges as a popular distributed learning schema that learns from a set of participating users without requiring raw data to be shared. adversarial training (AT) provides a sound solution for centralized learning, extending its usage for FL users has imposed significant challenges. We show that existing FL techniques cannot effectively propagate adversarial robustness among non-iid users. We propose a simple yet effective propagation approach that transfers robustness through carefully designed batch-normalization statistics.
  arXiv  Detail & Related papers  (2021-06-18T15:52:33Z)

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.