mlsanityData to 7 Oct 2026

CoAst: Validation-Free Contribution Assessment for Federated Learning based on Cross-Round Valuation

arXiv 2409.02495 ↗First posted 4 Sep 2024cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In the federated learning (FL) process, since the data held by each participant is different, it is necessary to figure out which participant has a higher contribution to the model performance. Effective contribution assessment can help motivate data owners to participate in the FL training. Research works in this field can be divided into two directions based on whether a validation dataset is required. Validation-based methods need to use representative validation data to measure the model accuracy, which is difficult to obtain in practical FL scenarios. Existing validation-free methods assess the contribution based on the parameters and gradients of local models and the global model in a single training round, which is easily compromised by the stochasticity of model training. In this work, we propose CoAst, a practical method to assess the FL participants' contribution without access to any validation data. The core idea of CoAst involves two aspects: one is to only count the most important part of model parameters through a weights quantization, and the other is a cross-round valuation based on the similarity between the current local parameters and the global parameter updates in several subsequent communication rounds. Extensive experiments show that CoAst has comparable assessment reliability to existing validation-based methods and outperforms existing validation-free methods.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 27 references that are in the map. First posted on arXiv 4 Sep 2024.

Builds on

10 of 27 references.

References · 10

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
  3. 2016Ternary Weight Networkscited by 195
  4. 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
  5. 2021Sampling Permutations for Shapley Value Estimationcited by 101
  6. 2019Measure Contribution of Participants in Federated Learningcited by 78
  7. 2020Collaborative Machine Learning with Incentive-Aware Model Rewardscited by 71
  8. 2020Ternary Compression for Communication-Efficient Federated Learningcited by 57
  9. 2021Game of Gradients: Mitigating Irrelevant Clients in Federated Learningcited by 35
  10. 2022Probably Approximate Shapley Fairness with Applications in Machine Learningcited by 6

Built on by

Not cited yet.