Obserwuj
Shay Moran
Shay Moran
Department of Mathematics, Department of Computer Science, Technion
Zweryfikowany adres z google.com - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Learnability can be undecidable
S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff
Nature Machine Intelligence 1 (1), 44-48, 2019
792019
Sample compression schemes for VC classes
S Moran, A Yehudayoff
Journal of the ACM (JACM) 63 (3), 1-10, 2016
762016
Learners that use little information
R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff
Algorithmic Learning Theory, 25-55, 2018
732018
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
652019
Sign rank versus Vapnik-Chervonenkis dimension
N Alon, S Moran, A Yehudayoff
Sbornik: Mathematics 208 (12), 1724, 2017
52*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
512017
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
372019
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
362020
On statistical learning via the lens of compression
O David, S Moran, A Yehudayoff
arXiv preprint arXiv:1610.03592, 2016
33*2016
Teaching and compressing for low VC-dimension
S Moran, A Shpilka, A Wigderson, A Yehudayoff
A Journey Through Discrete Mathematics, 633-656, 2017
32*2017
Labeled compression schemes for extremal classes
S Moran, MK Warmuth
International Conference on Algorithmic Learning Theory, 34-49, 2016
262016
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
232021
Internal compression of protocols to entropy
B Bauer, S Moran, A Yehudayoff
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
232015
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
212020
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
192022
Proper learning, Helly number, and an optimal SVM bound
O Bousquet, S Hanneke, S Moran, N Zhivotovskiy
Conference on Learning Theory, 582-609, 2020
192020
Approximate nonnegative rank is equivalent to the smooth rectangle bound
G Kol, S Moran, A Shpilka, A Yehudayoff
computational complexity 28 (1), 1-25, 2019
19*2019
Limits of private learning with access to public data
N Alon, R Bassily, S Moran
Advances in neural information processing systems 32, 2019
192019
Shattering, graph orientations, and connectivity
L Kozma, S Moran
arXiv preprint arXiv:1211.1319, 2012
192012
Private center points and learning of halfspaces
A Beimel, S Moran, K Nissim, U Stemmer
Conference on Learning Theory, 269-282, 2019
172019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20