Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 219

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

AUCTION: Automated and Quality-Aware Client Selection Framework for Efficient Federated Learning

Deng, Yongheng, Lyu, Feng, Ren, Ju, Wu, Huaqing, Zhou, Yuezhi, Zhang, Yaoxue, Shen, Xuemin · 2022 · IEEE Transactions on Parallel and Distributed Systems

Abstract

The emergency of federated learning (FL) enables distributed data owners to collaboratively build a global model without sharing their raw data, which creates a new business chance for building data market. However, in practical FL scenarios, the hardware conditions and data resources of the participant clients can vary significantly, leading to different positive/negative effects on the FL performance, where the client selection problem becomes crucial. To this end, we proposeAUCTION, anAutomated and qUality-awareClient selecTIONframework for efficient FL, which can evaluate the learning quality of clients and select them automatically with quality-awareness for a given FL task within a limited budget. To designAUCTION, multiple factors such as data size, data quality, and learning budget that can affect the learning performance should be properly balanced. It is nontrivial since their impacts on the FL model are intricate and unquantifiable. Therefore,AUCTIONis designed to encode the client selection policy into a neural network and employ reinforcement learning to automatically learn client selection policies based on the observed client status and feedback rewards quantified by the federated learning performance. In particular, the policy network is built upon an encoder-decoder deep neural network with an attention mechanism, which can adapt to dynamic changes of the number of candidate clients and make sequential client selection actions to reduce the learning space significantly. Extensive experiments are carried out based on real-world datasets and well-known learning models to demonstrate the efficiency, robustness, and scalability ofAUCTION.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpds.2021.3134647

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 14 references

Cited by

See all 219

Metadata

Authors
Deng, Y., Lyu, F., Ren, J., Wu, H., Zhou, Y., Zhang, Y., & Shen, X.
Venue
IEEE Transactions on Parallel and Distributed Systems
Published
2022-08-01
Volume
33
Issue
8
Pages
1996-2009
ISSN
  • 1045-9219 (ISSN-L)
  • 1558-2183
  • 2161-9883
OpenAlex
W4205597275
Cited by
219
References
14
FWCI
11.29
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: AUCTION: Automated and Quality-Aware Client Selection Framework for Efficient Federated Learning. https://app.cochat.ai/papers/10.1109/tpds.2021.3134647
The paper
Deng, Y., Lyu, F., Ren, J., Wu, H., Zhou, Y., Zhang, Y., & Shen, X. (2022). AUCTION: Automated and Quality-Aware Client Selection Framework for Efficient Federated Learning. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2021.3134647

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.