Evidence map›Paper›PMID 35571559›Full record

ArticleKDD : proceedings. International Conference on Knowledge Discovery & Data Mining2021

Federated Adversarial Debiasing for Fair and Transferable Representations.

Junyuan Hong, Zhuangdi Zhu, Shuyang Yu, Zhangyang Wang, Hiroko Dodge, Jiayu Zhou

Abstract read
In one paragraph

Article in KDD : proceedings. International Conference on Knowledge Discovery & Data Mining, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

8 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Review
  4. Article
  5. Review
  6. Article
  7. Article
  8. Efficient Split-Mix Federated Learning for On-Demand and In-Situ Customization.... International Conference on Learning Representations · 2022
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Junyuan HongMichigan State University, East Lansing, Michigan, USA.
Zhuangdi ZhuMichigan State University, East Lansing, Michigan, USA.
Shuyang YuMichigan State University, East Lansing, Michigan, USA.
Zhangyang WangUniversity of Texas at Austin, Austin, Texas, USA.
Hiroko DodgeOregon Health & Science University, Portland, Oregon, USA.
Jiayu ZhouMichigan State University, East Lansing, Michigan, USA.

Funding

Research Education ComponentP30AG066518 · NIA · OREGON HEALTH & SCIENCE UNIVERSITY · PI Zachary Beattie · 2020 to 2026
$28.6M
Pilot CoreP30AG024978 · NIA · OREGON HEALTH & SCIENCE UNIVERSITY · PI KAYE, JEFFREY A · 2004 to 2023
$9.0M
Conversational Engagement as a Means to Delay Onset AD: Phase II Administrative SupplementR01AG051628 · NIA · OREGON HEALTH & SCIENCE UNIVERSITY · PI DODGE, HIROKO HAYAMA · 2016 to 2020
$4.8M
Web-enabled social interaction to delay cognitive decline among seniors with MCI: Phase I Administrative SupplementR01AG056102 · NIA · OREGON HEALTH & SCIENCE UNIVERSITY · PI DODGE, HIROKO HAYAMA · 2017 to 2021
$4.6M
Identification of Mild Cognitive Impairment using Machine Learning from Language and Behavior MarkersRF1AG072449 · NIA · MICHIGAN STATE UNIVERSITY · PI DODGE, HIROKO HAYAMA, WANG, FEI · 2021 to 2023
$2.6M
NIA NIH HHS P30 AG024978NIA NIH HHS P30 AG066518NIA NIH HHS R01 AG051628NIA NIH HHS R01 AG056102NIA NIH HHS RF1 AG072449
6 · The paper itself

Abstract

Federated learning is a distributed learning framework that is communication efficient and provides protection over participating users' raw training data. One outstanding challenge of federate learning comes from the users' heterogeneity, and learning from such data may yield biased and unfair models for minority groups. While adversarial learning is commonly used in centralized learning for mitigating bias, there are significant barriers when extending it to the federated framework. In this work, we study these barriers and address them by proposing a novel approach Federated Adversarial DEbiasing (FADE). FADE does not require users' sensitive group information for debiasing and offers users the freedom to opt-out from the adversarial component when privacy or computational costs become a concern. We show that ideally, FADE can attain the same global optimality as the one by the centralized algorithm. We then analyze when its convergence may fail in practice and propose a simple yet effective method to address the problem. Finally, we demonstrate the effectiveness of the proposed framework through extensive empirical studies, including the problem settings of unsupervised domain adaptation and fair learning. Our codes and pre-trained models are available at: https://github.com/illidanlab/FADE.

Indexed as

Adversarial learningFairnessFederated learningUnsupervised domain adaptation

Identifiers

PMID35571559
PMCPMC9105979

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.