Papers › FairVFL: A Fair Vertical Federated Learning Framework with Contrastive Adversarial Learning

FairVFL: A Fair Vertical Federated Learning Framework with Contrastive Adversarial Learning

7 Jun 2022arXiv:2206.03200archive 2025-07-28

Tao Qi, Fangzhao Wu, Chuhan Wu, Lingjuan Lyu, Tong Xu, Zhongliang Yang, Yongfeng Huang, Xing Xie

Vertical federated learning (VFL) is a privacy-preserving machine learning paradigm that can learn models from features distributed on different platforms in a privacy-preserving way. Since in real-world applications the data may contain bias on fairness-sensitive features (e.g., gender), VFL models may inherit bias from training data and become unfair for some user groups. However, existing fair machine learning methods usually rely on the centralized storage of fairness-sensitive features to achieve model fairness, which are usually inapplicable in federated scenarios. In this paper, we propose a fair vertical federated learning framework (FairVFL), which can improve the fairness of VFL models. The core idea of FairVFL is to learn unified and fair representations of samples based on the decentralized feature fields in a privacy-preserving way. Specifically, each platform with fairness-insensitive features first learns local data representations from local features. Then, these local representations are uploaded to a server and aggregated into a unified representation for the target task. In order to learn a fair unified representation, we send it to each platform storing fairness-sensitive features and apply adversarial learning to remove bias from the unified representation inherited from the biased data. Moreover, for protecting user privacy, we further propose a contrastive adversarial learning method to remove private information from the unified representation in server before sending it to the platforms keeping fairness-sensitive features. Experiments on three real-world datasets validate that our method can effectively improve model fairness with user privacy well-protected.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2206.03200")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

taoqi98/fairvfl officialmentioned in paperMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from taoqi98/fairvfl. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

ZipImages taoqi98/fairvfl/CelebA/raw_data_process.py official repository unverified MIT (permissive) · 056528ae1a7e37bf · report
evaluate_performance taoqi98/fairvfl/Adult/evaluation.py official repository unverified MIT (permissive) · 66e15f4aa7e87d58 · report
get_behavior_classifier taoqi98/fairvfl/CelebA/models.py official repository unverified MIT (permissive) · 3c2a7d667723ed8b · report
get_contrastive_scorer taoqi98/fairvfl/Adult/models.py official repository unverified MIT (permissive) · 183905474d688b9a · report
get_data_flow taoqi98/fairvfl/CelebA/models.py official repository unverified MIT (permissive) · 330bd3d3891e8e89 · report
get_mapper taoqi98/fairvfl/Adult/models.py official repository unverified MIT (permissive) · d393197c1300c3a2 · report
get_mapper_discrimator taoqi98/fairvfl/Adult/models.py official repository unverified MIT (permissive) · b2ea0d61d0a4abc8 · report
get_user_info_classifier taoqi98/fairvfl/CelebA/models.py official repository unverified MIT (permissive) · ad05a74e231521c8 · report
load_data taoqi98/fairvfl/Adult/preprocessing.py official repository unverified MIT (permissive) · 579466b24ba469d9 · report
load_data taoqi98/fairvfl/CelebA/preprocessing.py official repository unverified MIT (permissive) · 37a129fb2fcab303 · report
load_data taoqi98/fairvfl/CelebA/raw_data_process.py official repository unverified MIT (permissive) · abbf0d8c243d107c · report

Tasks

FairnessFederated LearningPrivacy PreservingVertical Federated Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections