معرفی
Clément Canonne is a Senior Lecturer in the School of Computer Science at The University of Sydney, where he is a member of the Sydney Algorithms and Computing Theory (SACT) group. He holds an ARC DECRA Fellowship and has established himself as a leading researcher in theoretical computer science with a focus on distribution testing and learning theory.
His educational background includes:
- Ph.D. in Computer Science from Columbia University (advised by Prof. Rocco Servedio)
- M.Sc. in Computer Science from the Parisian Master of Research in Computer Science
- Engineering degree from École Centrale Paris
Canonne's research primarily centers on distribution testing (a branch of property testing), learning theory, and randomized algorithms within the theory of machine learning. He investigates the computational aspects of learning and statistical inference under various resource or information constraints, with particular emphasis on data privacy and differential privacy. His work bridges theoretical computer science, statistics, and information theory to develop rigorous approaches for modern data analysis challenges.
His recent publications reveal a strong trajectory in theoretical foundations of data science, with increasing focus on privacy-preserving techniques and constrained statistical inference. The publications span top venues including FOCS, STOC, NeurIPS, and COLT, demonstrating consistent contributions to both theoretical foundations and practical applications of distribution testing. A significant portion of his recent work addresses differential privacy, communication constraints, and the interplay between computational and statistical aspects of learning.
Among his notable recognitions are:
- 2024 Caspar Bowden PET Award for work on the Discrete Gaussian mechanism
- ARC DECRA Fellowship
Canonne actively mentors the next generation of researchers, currently advising three PhD students (Kenny Chen, Abigail Gentle, and Joy Yang) and having previously supervised Yun Li to completion of an MPhil. He serves in significant leadership roles including General Chair of FOCS 2025, Program Committee co-Chair for ITW 2025, and Program Committee member for SODA 2026. His service extends to editorial roles, including membership on the Theory of Computing editorial board.
He is actively involved with the Sydney Algorithms and Computing Theory (SACT) group at the University of Sydney, contributing to both research and community-building initiatives such as co-organizing the Australasian Summer School on Recent Trends in Algorithms.
