Clément L. Canonne

The University of Sydney — Australia

Computer Science · Physical Sciences

16h-index939citations148works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Machine Learning and Algorithms(60), Complexity and Algorithms in Graphs(35), Privacy-Preserving Technologies in Data(30), Cryptography and Data Security(20), Wireless Communication Security Techniques(12)

Publications148 total

Instance-Optimal Uniformity Testing and Tracking
2025
Interactive Proofs For Distribution Testing With Conditional Oracles
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2025Open Access
Nash Policy Gradient: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
arXiv (Cornell University)·2025Open Access
Uniformity Testing Under User-Level Local Privacy
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2025Open Access
Tight Bounds for Machine Unlearning via Differential Privacy
Journal of Privacy and Confidentiality·2025· 1 citedOpen Access
Instance-Optimal Uniformity Testing and Tracking
arXiv (Cornell University)·2025Open Access
Zero-Shot Attribution for Large Language Models: A Distribution Testing Approach
arXiv (Cornell University)·2025Open Access
Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
2025Open Access
With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
arXiv (Cornell University)·2025Open Access
Gaussian Mean Testing under Truncation
arXiv (Cornell University)·2025Open Access
Analysis, Design, and Implementation of a User-Friendly Differential Privacy Application
Sensors·2025· 1 citedOpen Access
Make some noise: the mathematical theories behind data privacy
2025Open Access
Uniformity Testing When You Have the Source Code
arXiv (Cornell University)·2024Open Access
Referee report. For: Togetherness in musical interaction [version 1; peer review: 1 approved]
Faculty of 1000 Research Ltd·2024Open Access
Simpler Distribution Testing with Little Memory
Society for Industrial and Applied Mathematics eBooks·2024· 2 cited
The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination
2023· 1 cited
Simpler Distribution Testing with Little Memory
arXiv (Cornell University)·2023Open Access
Optimal Rates for Nonparametric Density Estimation Under Communication Constraints
IEEE Transactions on Information Theory·2023· 2 cited
Learning bounded-degree polytrees with known skeleton
arXiv (Cornell University)·2023Open Access
Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine
arXiv (Cornell University)·2023Open Access
page 1 of 8Next →

Frequent Co-authors

Jayadev Acharya(15), Himanshu Tyagi(12), Gautam Kamath(7), Ilias Diakonikolas(7), Ronitt Rubinfeld(4), Alistair Stewart(4), Ziteng Sun(4), Dana Ron(3), Daniel M. Kane(3), Eric Blais(3), Tom Gur(3), Erik Waingarten(3), Cody Freitag(2), Themis Gouleakis(2), Rocco A. Servedio(2), Audra McMillan(2), Jonathan Ullman(2), Omri Ben‐Eliezer(2), Shoham Letzter(2), Thomas Steinke(1)