Pith. sign in

REVIEW 1 cited by

FedSDG-FS: Efficient and Secure Feature Selection for Vertical Federated Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.10417 v1 pith:UMXWVLZU submitted 2023-02-21 cs.LG cs.CR

classification cs.LGcs.CR
keywords featurefeaturesselectionfederatedfedsdg-fsdatadual-gateexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Vertical Federated Learning (VFL) enables multiple data owners, each holding a different subset of features about largely overlapping sets of data sample(s), to jointly train a useful global model. Feature selection (FS) is important to VFL. It is still an open research problem as existing FS works designed for VFL either assumes prior knowledge on the number of noisy features or prior knowledge on the post-training threshold of useful features to be selected, making them unsuitable for practical applications. To bridge this gap, we propose the Federated Stochastic Dual-Gate based Feature Selection (FedSDG-FS) approach. It consists of a Gaussian stochastic dual-gate to efficiently approximate the probability of a feature being selected, with privacy protection through Partially Homomorphic Encryption without a trusted third-party. To reduce overhead, we propose a feature importance initialization method based on Gini impurity, which can accomplish its goals with only two parameter transmissions between the server and the clients. Extensive experiments on both synthetic and real-world datasets show that FedSDG-FS significantly outperforms existing approaches in terms of achieving accurate selection of high-quality features as well as building global models with improved performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Vertical Federated Unlearning via Backdoor Certification

    cs.LG 2024-12 reject novelty 3.0 of 10

    A gradient-ascent unlearning algorithm verified by backdoor accuracy is proposed for federated models, but the experimental setup and the unenforced constraint weaken the central VFL claim.

Pith tools