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

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

FAIR: Quality-Aware Federated Learning with Precise User Incentive and Model Aggregation

Deng, Yongheng, Lyu, Feng, Ren, Ju, Chen, Yi-Chao, Yang, Peng, Zhou, Yuezhi, Zhang, Yaoxue · 2021 · IEEE INFOCOM 2021 - IEEE Conference on Computer Communications

Abstract

Federated learning enables distributed learning in a privacy-protected manner, but two challenging reasons can affect learning performance significantly. First, mobile users are not willing to participate in learning due to computation and energy consumption. Second, with various factors (e.g., training data size/quality), the model update quality of mobile devices can vary dramatically, inclusively aggregating low-quality model updates can deteriorate the global model quality. In this paper, we propose a novel system named FAIR, i.e., Federated leArning with qualIty awaReness. FAIR integrates three major components: 1) learning quality estimation: we leverage historical learning records to estimate the user learning quality, where the record freshness is considered and the exponential forgetting function is utilized for weight assignment; 2) quality-aware incentive mechanism: within the recruiting budget, we model a reverse auction problem to encourage the participation of high-quality learning users, and the method is proved to be truthful, individually rational, and computationally efficient; and 3) model aggregation: we devise an aggregation algorithm that integrates the model quality into aggregation and filters out non-ideal model updates, to further optimize the global learning model. Based on real-world datasets and practical learning tasks, extensive experiments are carried out to demonstrate the efficacy of FAIR.

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/infocom42981.2021.9488743

Cites

7 of 7 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 7 references

Cited by

See all 211

Metadata

Authors
Deng, Y., Lyu, F., Ren, J., Chen, Y.-C., Yang, P., Zhou, Y., & Zhang, Y.
Venue
IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
Publisher
IEEE
Published
2021-05-10
Pages
1-10
OpenAlex
W3155189475
Cited by
211
References
7
FWCI
16.91
Type
conference paper
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: FAIR: Quality-Aware Federated Learning with Precise User Incentive and Model Aggregation. https://app.cochat.ai/papers/10.1109/infocom42981.2021.9488743
The paper
Deng, Y., Lyu, F., Ren, J., Chen, Y.-C., Yang, P., Zhou, Y., & Zhang, Y. (2021). FAIR: Quality-Aware Federated Learning with Precise User Incentive and Model Aggregation. IEEE INFOCOM 2021 - IEEE Conference on Computer Communications. https://doi.org/10.1109/infocom42981.2021.9488743

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.