
Title |
|---|
![]() Private List Learnability vs. Online List LearnabilityAnnual Conference Computational Learning Theory (COLT), 2025 |
![]() Optimal Learners for Realizable Regression: PAC Learning and Online
LearningNeural Information Processing Systems (NeurIPS), 2023 |
![]() Multiclass Boosting: Simple and Intuitive Weak Learning CriteriaNeural Information Processing Systems (NeurIPS), 2023 |
![]() Optimal PAC Bounds Without Uniform ConvergenceIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 |
![]() List Online ClassificationAnnual Conference Computational Learning Theory (COLT), 2023 |
![]() A Characterization of List LearnabilitySymposium on the Theory of Computing (STOC), 2022 |
![]() A Characterization of Multiclass LearnabilityIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022 |
![]() A Theory of PAC Learnability of Partial Concept ClassesIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2021 |
![]() List-Decodable Linear RegressionNeural Information Processing Systems (NeurIPS), 2019 |
![]() On statistical learning via the lens of compressionNeural Information Processing Systems (NeurIPS), 2016 |
![]() Sample compression schemes for VC classesInformation Theory and Applications Workshop (ITA), 2015 |