Shay Moran
Shay Moran
Department of Mathematics, 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
Sample compression schemes for VC classes
S Moran, A Yehudayoff
Journal of the ACM (JACM) 63 (3), 1-10, 2016
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
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
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
Teaching and compressing for low VC-dimension
S Moran, A Shpilka, A Wigderson, A Yehudayoff
A Journey Through Discrete Mathematics, 633-656, 2017
On statistical learning via the lens of compression
O David, S Moran, A Yehudayoff
arXiv preprint arXiv:1610.03592, 2016
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
Internal compression of protocols to entropy
B Bauer, S Moran, A Yehudayoff
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
Labeled compression schemes for extremal classes
S Moran, MK Warmuth
International Conference on Algorithmic Learning Theory, 34-49, 2016
Private center points and learning of halfspaces
A Beimel, S Moran, K Nissim, U Stemmer
Conference on Learning Theory, 269-282, 2019
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
The optimal approximation factor in density estimation
O Bousquet, D Kane, S Moran
Conference on Learning Theory, 318-341, 2019
Shattering, graph orientations, and connectivity
L Kozma, S Moran
arXiv preprint arXiv:1211.1319, 2012
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
J Chalopin, V Chepoi, S Moran, MK Warmuth
arXiv preprint arXiv:1812.02099, 2018
Hitting set for hypergraphs of low VC-dimension
K Bringmann, L Kozma, S Moran, NS Narayanaswamy
arXiv preprint arXiv:1512.00481, 2015
Shattering-extremal systems
S Moran
arXiv preprint arXiv:1211.2980, 2012
Limits of private learning with access to public data
N Alon, R Bassily, S Moran
arXiv preprint arXiv:1910.11519, 2019
The system can't perform the operation now. Try again later.
Articles 1–20