| Learnability can be undecidable S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff Nature Machine Intelligence 1 (1), 44-48, 2019 | 112 | 2019 |
| Private PAC learning implies finite Littlestone dimension N Alon, R Livni, M Malliaris, S Moran Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 101 | 2019 |
| Learners that use little information R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff Algorithmic Learning Theory, 25-55, 2018 | 95 | 2018 |
| Sample compression schemes for VC classes S Moran, A Yehudayoff Journal of the ACM (JACM) 63 (3), 1-10, 2016 | 86 | 2016 |
| Active classification with comparison queries DM Kane, S Lovett, S Moran, J Zhang 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 68 | 2017 |
| Sign rank versus Vapnik-Chervonenkis dimension N Alon, S Moran, A Yehudayoff Sbornik: Mathematics 208 (12), 1724, 2017 | 67* | 2017 |
| An equivalence between private classification and online prediction M Bun, R Livni, S Moran 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 65 | 2020 |
| Limits of private learning with access to public data N Alon, R Bassily, S Moran Advances in neural information processing systems 32, 2019 | 52 | 2019 |
| On statistical learning via the lens of compression O David, S Moran, A Yehudayoff arXiv preprint arXiv:1610.03592, 2016 | 51* | 2016 |
| Adversarial laws of large numbers and optimal regret in online classification N Alon, O Ben-Eliezer, Y Dagan, S Moran, M Naor, E Yogev Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 45 | 2021 |
| Near-optimal linear decision trees for k-SUM and related problems DM Kane, S Lovett, S Moran Journal of the ACM (JACM) 66 (3), 1-18, 2019 | 45 | 2019 |
| Private query release assisted by public data R Bassily, A Cheu, S Moran, A Nikolov, J Ullman, S Wu International Conference on Machine Learning, 695-703, 2020 | 44 | 2020 |
| Proper learning, Helly number, and an optimal SVM bound O Bousquet, S Hanneke, S Moran, N Zhivotovskiy Conference on Learning Theory, 582-609, 2020 | 39 | 2020 |
| A theory of universal learning O Bousquet, S Hanneke, S Moran, R Van Handel, A Yehudayoff Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 37 | 2021 |
| Teaching and compressing for low VC-dimension S Moran, A Shpilka, A Wigderson, A Yehudayoff A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, 633-656, 2017 | 36* | 2017 |
| Labeled compression schemes for extremal classes S Moran, MK Warmuth Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari …, 2016 | 31 | 2016 |
| Private center points and learning of halfspaces A Beimel, S Moran, K Nissim, U Stemmer Conference on Learning Theory, 269-282, 2019 | 30 | 2019 |
| An adaptive nearest neighbor rule for classification A Balsubramani, S Dasgupta, S Moran Advances in Neural Information Processing Systems 32, 2019 | 30 | 2019 |
| Towards a unified information-theoretic framework for generalization M Haghifam, GK Dziugaite, S Moran, D Roy Advances in Neural Information Processing Systems 34, 26370-26381, 2021 | 29 | 2021 |
| A theory of PAC learnability of partial concept classes N Alon, S Hanneke, R Holzman, S Moran 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 28 | 2022 |
Amir YehudayoffDepartment of Mathematics, Techniontechnion.ac.il의 이메일 확인됨
