H. Brendan McMahan

Orcid: 0009-0003-5892-4193

Affiliations:
  • Google


According to our database1, H. Brendan McMahan authored at least 90 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Federated Learning in Practice: Reflections and Projections.
CoRR, 2024

A Hassle-free Algorithm for Private Learning in Practice: Don't Use Tree Aggregation, Use BLTs.
CoRR, 2024

Fine-Tuning Large Language Models with User-Level Differential Privacy.
CoRR, 2024

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy.
CoRR, 2024

Confidential Federated Computations.
CoRR, 2024

One-shot Empirical Privacy Estimation for Federated Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacy.
J. Artif. Intell. Res., 2023

(Amplified) Banded Matrix Factorization: A unified approach to private training.
CoRR, 2023

Can Public Large Language Models Help Private Cross-device Federated Learning?
CoRR, 2023

An Empirical Evaluation of Federated Contextual Bandit Algorithms.
CoRR, 2023

Convergence of Gradient Descent with Linearly Correlated Noise and Applications to Differentially Private Learning.
CoRR, 2023

Unleashing the Power of Randomization in Auditing Differentially Private ML.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Gradient Descent with Linearly Correlated Noise: Theory and Applications to Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

(Amplified) Banded Matrix Factorization: A unified approach to private training.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

How to DP-fy ML: A Practical Tutorial to Machine Learning with Differential Privacy.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Multi-Epoch Matrix Factorization Mechanisms for Private Machine Learning.
Proceedings of the International Conference on Machine Learning, 2023

Differentially Private Adaptive Optimization with Delayed Preconditioners.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Learning to Generate Image Embeddings with User-Level Differential Privacy.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Federated Learning of Gboard Language Models with Differential Privacy.
Proceedings of the The 61st Annual Meeting of the Association for Computational Linguistics: Industry Track, 2023

2022
Federated Select: A Primitive for Communication- and Memory-Efficient Federated Learning.
CoRR, 2022

Private Online Prefix Sums via Optimal Matrix Factorizations.
CoRR, 2022

Federated learning and privacy.
Commun. ACM, 2022

Improved Differential Privacy for SGD via Optimal Private Linear Operators on Adaptive Streams.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Federated Learning and Privacy: Building privacy-preserving systems for machine learning and data science on decentralized data.
ACM Queue, 2021

Advances and Open Problems in Federated Learning.
Found. Trends Mach. Learn., 2021

A Field Guide to Federated Optimization.
CoRR, 2021

Differentially Private Learning with Adaptive Clipping.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Practical and Private (Deep) Learning Without Sampling or Shuffling.
Proceedings of the 38th International Conference on Machine Learning, 2021

Adaptive Federated Optimization.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Training Production Language Models without Memorizing User Data.
CoRR, 2020

Privacy Amplification via Random Check-Ins.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Is Local SGD Better than Minibatch SGD?
Proceedings of the 37th International Conference on Machine Learning, 2020

Generative Models for Effective ML on Private, Decentralized Datasets.
Proceedings of the 8th International Conference on Learning Representations, 2020

Federated Heavy Hitters Discovery with Differential Privacy.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Advances and Open Problems in Federated Learning.
CoRR, 2019

Can You Really Backdoor Federated Learning?
CoRR, 2019

Differentially Private Learning with Adaptive Clipping.
CoRR, 2019

SysML: The New Frontier of Machine Learning Systems.
CoRR, 2019

Towards Federated Learning at Scale: System Design.
Proceedings of the Second Conference on Machine Learning and Systems, SysML 2019, 2019

Semi-Cyclic Stochastic Gradient Descent.
Proceedings of the 36th International Conference on Machine Learning, 2019

Federated Learning with Autotuned Communication-Efficient Secure Aggregation.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
Expanding the Reach of Federated Learning by Reducing Client Resource Requirements.
CoRR, 2018

A General Approach to Adding Differential Privacy to Iterative Training Procedures.
CoRR, 2018

LEAF: A Benchmark for Federated Settings.
CoRR, 2018

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

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

cpSGD: Communication-efficient and differentially-private distributed SGD.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning Differentially Private Recurrent Language Models.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
A survey of Algorithms and Analysis for Adaptive Online Learning.
J. Mach. Learn. Res., 2017

Practical Secure Aggregation for Privacy Preserving Machine Learning.
IACR Cryptol. ePrint Arch., 2017

Learning Differentially Private Language Models Without Losing Accuracy.
CoRR, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approaches.
CoRR, 2017

Distributed Mean Estimation with Limited Communication.
Proceedings of the 34th International Conference on Machine Learning, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approches.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Communication-Efficient Learning of Deep Networks from Decentralized Data.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Federated Learning of Deep Networks using Model Averaging.
CoRR, 2016

Federated Learning: Strategies for Improving Communication Efficiency.
CoRR, 2016

Federated Optimization: Distributed Machine Learning for On-Device Intelligence.
CoRR, 2016

Practical Secure Aggregation for Federated Learning on User-Held Data.
CoRR, 2016

Deep Learning with Differential Privacy.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Federated Optimization: Distributed Optimization Beyond the Datacenter.
CoRR, 2015

2014
Analysis Techniques for Adaptive Online Learning.
CoRR, 2014

Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization
CoRR, 2013

Minimax Optimal Algorithms for Unconstrained Linear Optimization.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Estimation, Optimization, and Parallelism when Data is Sparse.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Ad click prediction: a view from the trenches.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Large-Scale Learning with Less RAM via Randomization.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Open Problem: Better Bounds for Online Logistic Regression.
Proceedings of the COLT 2012, 2012

On Calibrated Predictions for Auction Selection Mechanisms
CoRR, 2012

No-Regret Algorithms for Unconstrained Online Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization.
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Discussion of "Contextual Bandit Algorithms with Supervised Learning Guarantees".
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

2010
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and Implicit Updates
CoRR, 2010

Less Regret via Online Conditioning
CoRR, 2010

Adaptive Bound Optimization for Online Convex Optimization.
Proceedings of the COLT 2010, 2010

2009
Sleeping Experts and Bandits with Stochastic Action Availability and Adversarial Rewards.
Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009

Tighter Bounds for Multi-Armed Bandits with Expert Advice.
Proceedings of the COLT 2009, 2009

2007
A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games.
Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007

Selecting Observations against Adversarial Objectives.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

Efficiently computing minimax expected-size confidence regions.
Proceedings of the Machine Learning, 2007

A Unification of Extensive-Form Games and Markov Decision Processes.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2005
Online convex optimization in the bandit setting: gradient descent without a gradient.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees.
Proceedings of the Machine Learning, 2005

Fast Exact Planning in Markov Decision Processes.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

2004
Multi-source spanning trees: algorithms for minimizing source eccentricities.
Discret. Appl. Math., 2004

Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003
Planning in the Presence of Cost Functions Controlled by an Adversary.
Proceedings of the Machine Learning, 2003


  Loading...