mlsanityData to 14 Oct 2026

Data Valuation and Detections in Federated Learning

arXiv 2311.05304 ↗First posted 9 Nov 2023cs.LG cs.AI cs.CRcited by 17

Not on the map. Why?

Abstract (arXiv)

Federated Learning (FL) enables collaborative model training while preserving the privacy of raw data. A challenge in this framework is the fair and efficient valuation of data, which is crucial for incentivizing clients to contribute high-quality data in the FL task. In scenarios involving numerous data clients within FL, it is often the case that only a subset of clients and datasets are pertinent to a specific learning task, while others might have either a negative or negligible impact on the model training process. This paper introduces a novel privacy-preserving method for evaluating client contributions and selecting relevant datasets without a pre-specified training algorithm in an FL task. Our proposed approach FedBary, utilizes Wasserstein distance within the federated context, offering a new solution for data valuation in the FL framework. This method ensures transparent data valuation and efficient computation of the Wasserstein barycenter and reduces the dependence on validation datasets. Through extensive empirical experiments and theoretical analyses, we demonstrate the potential of this data valuation method as a promising avenue for FL research.

Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). Builds on 32 of its 49 references that are in the map. First posted on arXiv 9 Nov 2023.

Builds on

32 of 49 references.

References · 32

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
  4. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 497
  5. 2015Optimal Transport for Domain Adaptationcited by 463
  6. 2019Agnostic Federated Learningcited by 456
  7. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
  8. 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 281
  9. 2013Fast Computation of Wasserstein Barycenterscited by 216
  10. 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 165
  11. 2020Geometric Dataset Distances via Optimal Transportcited by 158
  12. 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 148
20 more
  1. 2022Data Banzhaf: A Robust Data Valuation Framework for Machine Learningcited by 132
  2. 2020A Principled Approach to Data Valuation for Federated Learningcited by 127
  3. 2019Data Valuation using Reinforcement Learningcited by 116
  4. 2016Theoretical Analysis of Domain Adaptation with Optimal Transportcited by 105
  5. 2020Robust Federated Learning: The Case of Affine Distribution Shiftscited by 102
  6. 2021GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learningcited by 74
  7. 2020Collaborative Machine Learning with Incentive-Aware Model Rewardscited by 71
  8. 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
  9. 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 68
  10. 2023OpenDataVal: a Unified Benchmark for Data Valuationcited by 55
  11. 2018Algorithms and Theory for Multiple-Source Adaptationcited by 54
  12. 2022Measuring the Effect of Training Data on Deep Learning Predictions via Randomized Experimentscited by 50
  13. 2014Multi-marginal optimal transport: theory and applicationscited by 41
  14. 2020Efficient computation and analysis of distributional Shapley valuescited by 38
  15. 2023Data-OOB: Out-of-bag Estimate as a Simple and Efficient Data Valuecited by 38
  16. 2020Multi-source Domain Adaptation via Weighted Joint Distributions Optimal Transportcited by 28
  17. 2020Optimal Transport for Conditional Domain Matching and Label Shiftcited by 20
  18. 2020A Theory of Multiple-Source Adaptation with Limited Target Labeled Datacited by 18
  19. 2023Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sourcescited by 16
  20. 2023Federated Wasserstein Distancecited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 4; 2026: 8.

17 papers.

Sort:

By area:

  1. 2024OpenFGL: A Comprehensive Benchmark for Federated Graph Learningcited by 16
  2. 2024Multimodal Misinformation Detection by Learning from Synthetic Data with Multimodal LLMscited by 13
  3. 2025From Points to Coalitions: Hierarchical Contrastive Shapley Values for Prioritizing Data Samplescited by 12
  4. 2024A Universal Metric of Dataset Similarity for Cross-silo Federated Learningcited by 4
  5. 2023ConfusionPrompt: Practical Private Inference for Online Large Language Modelscited by 3
  6. 2024Collaboratively Learning Federated Models from Noisy Decentralized Datacited by 2
  7. 2026Fed-ADE: Adaptive Learning Rate for Federated Post-adaptation under Distribution Shiftcited by 2
  8. 2025Losing is for Cherishing: Data Valuation Based on Machine Unlearning and Shapley Valuecited by 1
  9. 2025ACME: Adaptive Customization of Large Models via Distributed Systemscited by 1
  10. 2026When Sample Selection Bias Precipitates Model Collapsecited by 1
  11. 2025Data Valuation and Selection in a Federated Model Marketplacecited by 0
  12. 2026RIFLE: Robust Distillation-based FL for Deep Model Deployment on Resource-Constrained IoT Networkscited by 0
5 more
  1. 2026Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropycited by 0
  2. 2026Choose Wisely and Privately: Proactive Client Selection for Fair and Efficient Federated Learningcited by 0
  3. 2026TOFD: Target-Oriented Feature Decoupling against Poisoning Attacks in Split Federated Learningcited by 0
  4. 2026Different Corruptions, Different Signals: Uncertainty and Loss in Federated Data Qualitycited by 0
  5. 2026Optimal Transport Reweighting for Robust Learning under Spurious Correlations and Label Noisecited by 0