Here is a list of upcoming online seminars in combinatorics, automatically generated from researchseminars.org and a few other calendars available in the iCal format. Please let me know if you find any interesting iCal feed / Google Calendar of the seminars.
You can also find a list of upcoming workshops, conferences, and schools.
Timezone: Korea (KST), UTC/GMT+9.
December 2024
December 12
- 6:00 pm – 7:00 pm
-
David Saulpic, «Making Old Things New: A Unified Algorithm for Differentially Private Clustering»
As a staple of data analysis and unsupervised learning, the
problem of private clustering has been widely studied under various
privacy models. Centralized differential privacy is the first of them,
and the problem has also been studied for the local and the shuffle
variation. In each case, the goal is to design an algorithm that
computes privately a clustering, with the smallest possible error. The
study of each variation gave rise to new algorithms: the landscape of
private clustering algorithms is therefore quite intricate.
With Max Dupré la Tour and Monika Henzinger, we showed that a
20-year-old greedy algorithm can be slightly modified to work for any
of these models. This provides a unified picture: while matching
almost all previously known results, it allows us to improve some of
them and extend it to some recent privacy models.In this talk, I will present this old greedy algorithm, and try to
explain its advantages over other approaches for clustering. I will
then introduce the notion of differential privacy and its variants,
and show how to use the greedy algorithm for private clustering.