Decentralized Differentially Private Segmentation with PATE
- URL: http://arxiv.org/abs/2004.06567v1
- Date: Fri, 10 Apr 2020 00:05:48 GMT
- Title: Decentralized Differentially Private Segmentation with PATE
- Abstract summary: We show how PATE can be adapted for semantic segmentation.
On the Brain Tumor dataset, an Autoencoder-based PATE variant achieves a higher Dice coefficient for privacy work based on noisy Federated Averaging.
- Score: 19.074694101300373
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: When it comes to preserving privacy in medical machine learning, two
important considerations are (1) keeping data local to the institution and (2)
avoiding inference of sensitive information from the trained model. These are
often addressed using federated learning and differential privacy,
respectively. However, the commonly used Federated Averaging algorithm requires
a high degree of synchronization between participating institutions. For this
reason, we turn our attention to Private Aggregation of Teacher Ensembles
(PATE), where all local models can be trained independently without
inter-institutional communication. The purpose of this paper is thus to explore
how PATE -- originally designed for classification -- can best be adapted for
semantic segmentation. To this end, we build low-dimensional representations of
segmentation masks which the student can obtain through low-sensitivity queries
to the private aggregator. On the Brain Tumor Segmentation (BraTS 2019)
dataset, an Autoencoder-based PATE variant achieves a higher Dice coefficient
for the same privacy guarantee than prior work based on noisy Federated
Averaging.
Related papers
- Differentially Private Relational Learning with Entity-level Privacy Guarantees [17.567309430451616]
This work presents a principled framework for relational learning with formal entity-level DP guarantees.<n>We introduce an adaptive gradient clipping scheme that modulates clipping thresholds based on entity occurrence frequency.<n>These contributions lead to a tailored DP-SGD variant for relational data with provable privacy guarantees.
arXiv Detail & Related papers (2025-06-10T02:03:43Z) - A Stochastic Optimization Framework for Private and Fair Learning From Decentralized Data [14.748203847227542]
We develop a novel algorithm for private and fair federated learning (FL)
Our algorithm satisfies inter-silo record-level differential privacy (ISRL-DP)
Experiments demonstrate the state-of-the-art fairness-accuracy framework tradeoffs of our algorithm across different privacy levels.
arXiv Detail & Related papers (2024-11-12T15:51:35Z) - Using Decentralized Aggregation for Federated Learning with Differential
Privacy [0.32985979395737774]
Federated Learning (FL) provides some level of privacy by retaining the data at the local node.
This research deploys an experimental environment for FL with Differential Privacy (DP) using benchmark datasets.
arXiv Detail & Related papers (2023-11-27T17:02:56Z) - Little is Enough: Boosting Privacy by Sharing Only Hard Labels in Federated Semi-Supervised Learning [10.972006295280636]
In many critical applications, sensitive data is inherently distributed and cannot be centralized due to privacy concerns.
We propose a federated co-training (FedCT) approach that improves privacy by sharing only definitive (hard) labels on a public unlabeled dataset.
arXiv Detail & Related papers (2023-10-09T13:16:10Z) - Unlocking Accuracy and Fairness in Differentially Private Image
Classification [43.53494043189235]
Differential privacy (DP) is considered the gold standard framework for privacy-preserving training.
We show that pre-trained foundation models fine-tuned with DP can achieve similar accuracy to non-private classifiers.
arXiv Detail & Related papers (2023-08-21T17:42:33Z) - Differentially private partitioned variational inference [28.96767727430277]
Learning a privacy-preserving model from sensitive data which are distributed across multiple devices is an increasingly important problem.
We present differentially private partitioned variational inference, the first general framework for learning a variational approximation to a Bayesian posterior distribution.
arXiv Detail & Related papers (2022-09-23T13:58:40Z) - Mixed Differential Privacy in Computer Vision [133.68363478737058]
AdaMix is an adaptive differentially private algorithm for training deep neural network classifiers using both private and public image data.
A few-shot or even zero-shot learning baseline that ignores private data can outperform fine-tuning on a large private dataset.
arXiv Detail & Related papers (2022-03-22T06:15:43Z) - Personalization Improves Privacy-Accuracy Tradeoffs in Federated
Optimization [57.98426940386627]
We show that coordinating local learning with private centralized learning yields a generically useful and improved tradeoff between accuracy and privacy.
We illustrate our theoretical results with experiments on synthetic and real-world datasets.
arXiv Detail & Related papers (2022-02-10T20:44:44Z) - Differentially private federated deep learning for multi-site medical
image segmentation [56.30543374146002]
Collaborative machine learning techniques such as federated learning (FL) enable the training of models on effectively larger datasets without data transfer.
Recent initiatives have demonstrated that segmentation models trained with FL can achieve performance similar to locally trained models.
However, FL is not a fully privacy-preserving technique and privacy-centred attacks can disclose confidential patient data.
arXiv Detail & Related papers (2021-07-06T12:57:32Z) - Understanding Clipping for Federated Learning: Convergence and
Client-Level Differential Privacy [67.4471689755097]
This paper empirically demonstrates that the clipped FedAvg can perform surprisingly well even with substantial data heterogeneity.
We provide the convergence analysis of a differential private (DP) FedAvg algorithm and highlight the relationship between clipping bias and the distribution of the clients' updates.
arXiv Detail & Related papers (2021-06-25T14:47:19Z) - Source-Free Open Compound Domain Adaptation in Semantic Segmentation [99.82890571842603]
In SF-OCDA, only the source pre-trained model and the target data are available to learn the target model.
We propose the Cross-Patch Style Swap (CPSS) to diversify samples with various patch styles in the feature-level.
Our method produces state-of-the-art results on the C-Driving dataset.
arXiv Detail & Related papers (2021-06-07T08:38:41Z) - Graph-Homomorphic Perturbations for Private Decentralized Learning [64.26238893241322]
Local exchange of estimates allows inference of data based on private data.
perturbations chosen independently at every agent, resulting in a significant performance loss.
We propose an alternative scheme, which constructs perturbations according to a particular nullspace condition, allowing them to be invisible.
arXiv Detail & Related papers (2020-10-23T10:35:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.