 The Sample Complexity of Smooth Boosting and the Tightness of the
Hardcore TheoremIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2024 |
 Private Boosted Decision Trees via Smooth Re-WeightingJournal of Privacy and Confidentiality (JPC), 2022 |
 Transfer Learning In Differential Privacy's Hybrid-ModelInternational Conference on Machine Learning (ICML), 2022 |
 Reproducibility in LearningSymposium on the Theory of Computing (STOC), 2022 |
 Multiclass versus Binary Differentially Private PAC LearningNeural Information Processing Systems (NeurIPS), 2021 |
 Being Properly ImproperInternational Conference on Machine Learning (ICML), 2021 |
 A Computational Separation between Private Learning and Online LearningNeural Information Processing Systems (NeurIPS), 2020 |
 An Equivalence Between Private Classification and Online PredictionIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
