Shay Moran
Shay Moran
Department of Mathematics, Department of Computer Science, Technion
Verified email at - Homepage
Cited by
Cited by
Learnability can be undecidable
S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff
Nature Machine Intelligence 1 (1), 44-48, 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
Learners that use little information
R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff
Algorithmic Learning Theory, 25-55, 2018
Sample compression schemes for VC classes
S Moran, A Yehudayoff
Journal of the ACM (JACM) 63 (3), 1-10, 2016
Sign rank versus Vapnik-Chervonenkis dimension
N Alon, S Moran, A Yehudayoff
Sbornik: Mathematics 208 (12), 1724, 2017
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
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
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
On statistical learning via the lens of compression
O David, S Moran, A Yehudayoff
arXiv preprint arXiv:1610.03592, 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
Limits of private learning with access to public data
N Alon, R Bassily, S Moran
Advances in neural information processing systems 32, 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
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
Proper learning, Helly number, and an optimal SVM bound
O Bousquet, S Hanneke, S Moran, N Zhivotovskiy
Conference on Learning Theory, 582-609, 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
Labeled compression schemes for extremal classes
S Moran, MK Warmuth
Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari …, 2016
Private center points and learning of halfspaces
A Beimel, S Moran, K Nissim, U Stemmer
Conference on Learning Theory, 269-282, 2019
Are two (samples) really better than one?
M Babaioff, YA Gonczarowski, Y Mansour, S Moran
Proceedings of the 2018 ACM Conference on Economics and Computation, 175-175, 2018
Internal compression of protocols to entropy
B Bauer, S Moran, A Yehudayoff
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
J Chalopin, V Chepoi, S Moran, MK Warmuth
Journal of Computer and System Sciences 127, 1-28, 2022
The system can't perform the operation now. Try again later.
Articles 1–20