← Search

Brendan Mcmahan

9 accepted papers

2023

Federated Learning of Gboard Language Models with Differential Privacy

ACL 2023industry

We train and deploy language models (LMs) with federated learning (FL) and differential privacy (DP) in Google Keyboard (Gboard). The recent DP-Follow the Regularized Leader (DP-FTRL) algorithm is applied to achieve meaningfully formal DP guarantees without requiring uniform sampling of clients. To…

2021

Practical and Private (Deep) Learning Without Sampling or Shuffling

ICML 2021spotlight

We consider training models with differential privacy (DP) using mini-batch gradients. The existing state-of-the-art, Differentially Private Stochastic Gradient Descent (DP-SGD), requires \emph{privacy amplification by sampling or shuffling} to obtain the best privacy/accuracy/computation trade-offs…

Cited by 226SourcePDFScholar
2020

Federated Heavy Hitters Discovery with Differential Privacy

AISTATS 2020poster

The discovery of heavy hitters (most frequent items) in user-generated data streams drives improvements in the app and web ecosystems, but can incur substantial privacy risks if not done with care. To address these risks, we propose a distributed and privacy-preserving algorithm for discovering the…

2020

Is Local SGD Better than Minibatch SGD?

ICML 2020poster

We study local SGD (also known as parallel SGD and federated SGD), a natural and frequently used distributed optimization method. Its theoretical foundations are currently lacking and we highlight how all existing error guarantees in the convex setting are dominated by a simple baseline, minibatch S…

Cited by 316SourcePDFScholar
2020

Privacy Amplification via Random Check-Ins

NeurIPS 2020poster

Differentially Private Stochastic Gradient Descent (DP-SGD) forms a fundamental building block in many applications for learning over sensitive data. Two standard approaches, privacy amplification by subsampling, and privacy amplification by shuffling, permit adding lower noise in DP-SGD than via na…

Cited by 98SourcePDFScholar
2019

Semi-Cyclic Stochastic Gradient Descent

ICML 2019oral

We consider convex SGD updates with a block-cyclic structure, i.e., where each cycle consists of a small number of blocks, each with many samples from a possibly different, block-specific, distribution. This situation arises, e.g., in Federated Learning where the mobile devices available for updates…

Cited by 134SourcePDFScholar
2018

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization

NeurIPS 2018spotlight

We suggest a general oracle-based framework that captures parallel stochastic optimization in different parallelization settings described by a dependency graph, and derive generic lower bounds in terms of this graph. We then use the framework and derive lower bounds to study several speci…

Cited by 138SourcePDFScholar
2018

cpSGD: Communication-efficient and differentially-private distributed SGD

NeurIPS 2018spotlight

Distributed stochastic gradient descent is an important subroutine in distributed learning. A setting of particular interest is when the clients are mobile devices, where two important concerns are communication efficiency and the privacy of the clients. Several recent works have focused on reducing…

Cited by 587SourcePDFScholar
2017

Communication-Efficient Learning of Deep Networks from Decentralized Data

AISTATS 2017poster

Modern mobile devices have access to a wealth of data suitable for learning models, which in turn can greatly improve the user experience on the device. For example, language models can improve speech recognition and text entry, and image models can automatically select good photos. However, this ri…

Cited by 23789SourcePDFScholar