paper-with-me

Papers

NanoBatch Privacy: Enabling fast Differentially Private learning on the IPU

2021-09-24 · Edward H. Lee, Mario Michael Krell, Alexander Tsyplikhin, Victoria Rege, Errol Colak, Kristen W. Yeom

Differentially private SGD (DPSGD) has recently shown promise in deep learning. However, compared to non-private SGD, the DPSGD algorithm places computational overheads that can undo the benefit of batching in GPUs. Micro-batching is a common method to alleviate this and is fully supported in the TensorFlow Privacy library (TFDP). However, it degrades accuracy. We propose NanoBatch Privacy, a lightweight add-on to TFDP to be used on Graphcore IPUs by leveraging batch size of 1 (without microbatching) and gradient accumulation. This allows us to achieve large total batch sizes with minimal impacts to throughput. Second, we illustrate using Cifar-10 how larger batch sizes are not necessarily optimal from a privacy versus utility perspective. On ImageNet, we achieve more than 15x speedup over TFDP versus 8x A100s and significant speedups even across libraries such as Opacus. We also provide two extensions: 1) DPSGD for pipelined models and 2) per-layer clipping that is 15x faster than the Opacus implementation on 8x A100s. Finally as an application case study, we apply NanoBatch training for use on private Covid-19 chest CT prediction.

📄 PDF Abstract BibTeX arXiv:2109.12191

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…
Group Normalization Group Normalization is a normalization layer that divides channels into groups and normalizes the features within each group. GN does not exploit the batch dimension, and its…

Similar Papers 제목 키워드 기반

Enabling Fast Differentially Private SGD via Just-in-Time Compilation and Vectorization

2020-10-18 · NeurIPS 2021 12 · Pranav Subramani, Nicholas Vadivelu, Gautam Kamath

A common pain point in differentially private machine learning is the significant runtime overhead incurred when executing Differentially Private Stochastic Gradient Descent (DPSGD), which may be as large as two orders o…

FAST DIFFERENTIALLY PRIVATE-SGD VIA JL PROJECTIONS

2021-01-01 · Zhiqi Bu, Sivakanth Gopi, Janardhan Kulkarni, Yin Tat Lee 외

Differentially Private-SGD (DP-SGD) of Abadi et al. (2016) and its variations are the only known algorithms for private training of large scale neural networks. This algorithm requires computation of per-sample gradients…

The Differentially Private Lottery Ticket Mechanism

2020-02-16 · Lovedeep Gondara, Ke Wang, Ricardo Silva Carvalho

We propose the differentially private lottery ticket mechanism (DPLTM). An end-to-end differentially private training paradigm based on the lottery ticket hypothesis. Using "high-quality winners", selected via our custom…

Differentially Private Stochastic Gradient Descent with Low-Noise

2022-09-09 · Puyu Wang, Yunwen Lei, Yiming Ying, Ding-Xuan Zhou

Modern machine learning algorithms aim to extract fine-grained information from data to provide accurate predictions, which often conflicts with the goal of privacy protection. This paper addresses the practical and theo…

Privacy Preserving

Fast and Memory Efficient Differentially Private-SGD via JL Projections

2021-02-05 · NeurIPS 2021 12 · Zhiqi Bu, Sivakanth Gopi, Janardhan Kulkarni, Yin Tat Lee 외

Differentially Private-SGD (DP-SGD) of Abadi et al. (2016) and its variations are the only known algorithms for private training of large scale neural networks. This algorithm requires computation of per-sample gradients…