University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Federated Learning

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Federated Learning

Download to your calendar using vCal

If you have a question about this talk, please contact .

The goal of federated learning is to perform distributed training without centralising data. The training dataset is split across multiple devices or clients, potentially in a non-IID way. The key motivating factors are security and privacy of personal data. Use-cases include training on data from customers’ mobile phones, and collaboratively training a healthcare model on patient data from hospitals. Communication is usually the limiting factor, and the field has grown recently with many communication-efficient algorithms proposed. We will start by considering federated learning’s cryptographic origins. We will then explicitly consider its core challenges. We will build up from the simplest proposed SGD algorithms to more recent Bayesian algorithms. We will also briefly consider techniques that enhance security (like Secure Multi-Party Computation) and privacy (like Differential Privacy), which are of crucial importance in federated learning.

This talk is part of the Machine Learning Reading Group @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Zoom meeting ID 837 8058 8985. Passcode 428653 Old Hall, Queens' College Hughes Hall Pavilion Room

Other talks

C2D3 Computational Biology Annual Symposium 2026 Washing machines and their rare components: lessons from kidney patients Peri-Operative Medicine, and Obstetrics and Gynaecology Max Perutz Lecture - Title TBC Beyond Hubble: Studying the Earliest Galaxies with the James Webb Space Telescope Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity