Fair and efficient contribution valuation for vertical federated learning

• URL: http://arxiv.org/abs/2201.02658v2
• Date: Thu, 21 Aug 2025 21:42:53 GMT
• Title: Fair and efficient contribution valuation for vertical federated learning
• Abstract summary: Federated learning is an emerging technology for training machine learning models across decentralized data sources without sharing data.<n>We propose a contribution valuation metric called vertical federated Shapley value (VerFedSV) based on the classic Shapley value.<n>We show that VerFedSV satisfies many desirable properties of fairness but is also efficient to compute.
• Score: 19.536358114259887
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Federated learning is an emerging technology for training machine learning models across decentralized data sources without sharing data. Vertical federated learning, also known as feature-based federated learning, applies to scenarios where data sources have the same sample IDs but different feature sets. To ensure fairness among data owners, it is critical to objectively assess the contributions from different data sources and compensate the corresponding data owners accordingly. The Shapley value is a provably fair contribution valuation metric originating from cooperative game theory. However, its straight-forward computation requires extensively retraining a model on each potential combination of data sources, leading to prohibitively high communication and computation overheads due to multiple rounds of federated learning. To tackle this challenge, we propose a contribution valuation metric called vertical federated Shapley value (VerFedSV) based on the classic Shapley value. We show that VerFedSV not only satisfies many desirable properties of fairness but is also efficient to compute. Moreover, VerFedSV can be adapted to both synchronous and asynchronous vertical federated learning algorithms. Both theoretical analysis and extensive experimental results demonstrate the fairness, efficiency, adaptability, and effectiveness of VerFedSV.

Related papers

• Incentivizing Truthfulness and Collaborative Fairness in Bayesian Learning [68.76184067877499]
  Collaborative machine learning involves training high-quality models using datasets from a number of sources.<n>To incentivize sources to share data, existing data valuation methods fairly reward each source based on its data submitted as is.<n>This paper presents the first mechanism that ensures (F) collaborative fairness and incentivizes (T) truthfulness at equilibrium for Bayesian models.
  arXiv  Detail & Related papers  (2026-05-12T10:02:23Z)
• Certifying the Right to Be Forgotten: Primal-Dual Optimization for Sample and Label Unlearning in Vertical Federated Learning [31.54643729002375]
  Federated unlearning enables the removal of specific data influences from trained models.<n>Federated Optimization for data Removal via primal-dual Algorithm proposed.<n>New unlearning loss function promotes classification uncertainty rather than misclassification.
  arXiv  Detail & Related papers  (2025-12-29T03:25:52Z)
• Balancing Similarity and Complementarity for Federated Learning [91.65503655796603]
  Federated Learning (FL) is increasingly important in mobile and IoT systems. One key challenge in FL is managing statistical heterogeneity, such as non-i.i.d. data. We introduce a novel framework, textttFedSaC, which balances similarity and complementarity in FL cooperation.
  arXiv  Detail & Related papers  (2024-05-16T08:16:19Z)
• Probabilistic Contrastive Learning for Long-Tailed Visual Recognition [78.70453964041718]
  Longtailed distributions frequently emerge in real-world data, where a large number of minority categories contain a limited number of samples. Recent investigations have revealed that supervised contrastive learning exhibits promising potential in alleviating the data imbalance. We propose a novel probabilistic contrastive (ProCo) learning algorithm that estimates the data distribution of the samples from each class in the feature space.
  arXiv  Detail & Related papers  (2024-03-11T13:44:49Z)
• FedLALR: Client-Specific Adaptive Learning Rates Achieve Linear Speedup for Non-IID Data [54.81695390763957]
  Federated learning is an emerging distributed machine learning method. We propose a heterogeneous local variant of AMSGrad, named FedLALR, in which each client adjusts its learning rate. We show that our client-specified auto-tuned learning rate scheduling can converge and achieve linear speedup with respect to the number of clients.
  arXiv  Detail & Related papers  (2023-09-18T12:35:05Z)
• Accelerating Fair Federated Learning: Adaptive Federated Adam [0.0]
  When datasets are not independent and identically distributed (non-IID), models trained by naive federated algorithms may be biased towards certain participants. This is known as the fairness problem in federated learning. We propose Adaptive Federated Adam (AdaFedAdam) to accelerate fair federated learning with alleviated bias.
  arXiv  Detail & Related papers  (2023-01-23T10:56:12Z)
• FEDIC: Federated Learning on Non-IID and Long-Tailed Data via Calibrated Distillation [54.2658887073461]
  Dealing with non-IID data is one of the most challenging problems for federated learning. This paper studies the joint problem of non-IID and long-tailed data in federated learning and proposes a corresponding solution called Federated Ensemble Distillation with Imbalance (FEDIC) FEDIC uses model ensemble to take advantage of the diversity of models trained on non-IID data.
  arXiv  Detail & Related papers  (2022-04-30T06:17:36Z)
• Improving Fairness for Data Valuation in Federated Learning [39.61504568047234]
  We propose a new measure called completed federated Shapley value to improve the fairness of federated Shapley value. It is shown under mild conditions that this matrix is approximately low-rank by leveraging concepts and tools from optimization.
  arXiv  Detail & Related papers  (2021-09-19T02:39:59Z)
• Fairness-aware Agnostic Federated Learning [47.26747955026486]
  We develop a fairness-aware agnostic federated learning framework (AgnosticFair) to deal with the challenge of unknown testing distribution. We use kernel reweighing functions to assign a reweighing value on each training sample in both loss function and fairness constraint. Built model can be directly applied to local sites as it guarantees fairness on local data distributions.
  arXiv  Detail & Related papers  (2020-10-10T17:58:20Z)
• A Principled Approach to Data Valuation for Federated Learning [73.19984041333599]
  Federated learning (FL) is a popular technique to train machine learning (ML) models on decentralized data sources. The Shapley value (SV) defines a unique payoff scheme that satisfies many desiderata for a data value notion. This paper proposes a variant of the SV amenable to FL, which we call the federated Shapley value.
  arXiv  Detail & Related papers  (2020-09-14T04:37:54Z)
• Privacy-Preserving Asynchronous Federated Learning Algorithms for Multi-Party Vertically Collaborative Learning [151.47900584193025]
  We propose an asynchronous federated SGD (AFSGD-VP) algorithm and its SVRG and SAGA variants on the vertically partitioned data. To the best of our knowledge, AFSGD-VP and its SVRG and SAGA variants are the first asynchronous federated learning algorithms for vertically partitioned data.
  arXiv  Detail & Related papers  (2020-08-14T08:08:15Z)

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.