3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in vertical-federated-learning-15
No benchmarks available.
Use these libraries to find vertical-federated-learning-15 models and implementations
No datasets available.
No subtasks available.
This paper presents Fedlearn-Algo, an open-source privacy preserving machine learning platform, and releases vertical federated kernel binary classification model and vertical Federated random forest model, the first batch of novel FL algorithm examples.
The algorithm proposed in this paper is the first practical solution for differentially private vertical federated k -means clustering, where the server can obtain a set of global centers with a provable differential privacy guarantee and improves the estimation accuracy in the setting with more than two data parties.
This paper proposes a method to balance the model interpretability and data privacy in vertical Federated Learning by using Shapley values to reveal detailed feature importance for host features and a unified importance value for federated guest features.
This paper presents several feature inference attack methods to investigate the potential privacy leakages in the model prediction stage of vertical FL and proposes two specific attacks on the logistic regression (LR) and decision tree (DT) models, according to individual prediction output.
A novel coupled training paradigm, FedSim, that integrates one-to-many linkage into the training process that enables VFL in many real-world applications with fuzzy identifiers and achieves better performance in traditional VFL tasks.
This work introduces PyVertical, a framework supporting vertical federated learning using split neural networks, and presents the training of a simple dual-headed split neural network for a MNIST classification task.
This work systematically formulate the problem of training fair models in VFL, and develops an asynchronous gradient coordinate-descent ascent algorithm, where some active data parties perform multiple parallelized local updates per communication round to effectively reduce the number of communication rounds.
Adding a benchmark result helps the community track progress.