Shay Moran

Citée par

	Toutes	Depuis 2019
Citations	2167	1940
indice h	26	25
indice i10	51	48

560

280

140

420

201520162017201820192020202120222023202425 46 48 84 133 222 257 354 413 557

Accès public

Tout afficher

53 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Amir YehudayoffDIKU, University of Copenhagen, and Department of Mathematics, TechnionAdresse e-mail validée de technion.ac.il
Noga AlonPrinceton University and Tel Aviv UniversityAdresse e-mail validée de tau.ac.il
Steve HannekePurdue UniversityAdresse e-mail validée de ttic.edu
Roi LivniTel Aviv UniversityAdresse e-mail validée de tauex.tau.ac.il
Olivier BousquetGoogleAdresse e-mail validée de m4x.org
Yishay MansourTel Aviv UniversityAdresse e-mail validée de tauex.tau.ac.il
Daniel KaneUniversity of California, San DiegoAdresse e-mail validée de ucsd.edu
Raef BassilyAssociate Professor, Computer Science & Engineering, The Ohio State UniversityAdresse e-mail validée de osu.edu
Uri StemmerTel Aviv UniversityAdresse e-mail validée de tau.ac.il
Shai Ben-DavidUniverity of Waterloo, CanadaAdresse e-mail validée de uwaterloo.ca
Jonathan ShaferMITAdresse e-mail validée de mit.edu
Yuval FilmusAssociate Professor, TechnionAdresse e-mail validée de cs.technion.ac.il
Yuval DaganMITAdresse e-mail validée de mit.edu
Gillat KolPrinceton UniversityAdresse e-mail validée de princeton.edu
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoAdresse e-mail validée de eng.ucsd.edu
Elad HazanProfessor at Princeton University and Director Google AI PrincetonAdresse e-mail validée de princeton.edu
Mark BunAssistant Professor, Boston UniversityAdresse e-mail validée de bu.edu
Moshe BabaioffHebrew University of JerusalemAdresse e-mail validée de mail.huji.ac.il
Yannai A. GonczarowskiHarvard UniversityAdresse e-mail validée de fas.harvard.edu
Ofir DavidAdresse e-mail validée de technion.ac.il

Suivre

Shay Moran

(Math, CS, & DDS, Technion) & (Google Research)

Adresse e-mail validée de google.com - Page d'accueil

Computer Science Mathematics


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Learnability can be undecidable S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff Nature Machine Intelligence 1 (1), 44-48, 2019	132*	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	126	2019
Learners that use little information R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff Algorithmic Learning Theory, 25-55, 2018	113	2018
Sample compression schemes for VC classes S Moran, A Yehudayoff Journal of the ACM (JACM) 63 (3), 1-10, 2016	106	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	85	2020
Sign rank versus Vapnik-Chervonenkis dimension N Alon, S Moran, A Yehudayoff Sbornik: Mathematics 208 (12), 1724, 2017	79*	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	77	2017
On statistical learning via the lens of compression O David, S Moran, A Yehudayoff arXiv preprint arXiv:1610.03592, 2016	71*	2016
Limits of private learning with access to public data N Alon, R Bassily, S Moran Advances in neural information processing systems 32, 2019	65	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	60	2020
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	58	2021
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	56	2021
Proper learning, Helly number, and an optimal SVM bound O Bousquet, S Hanneke, S Moran, N Zhivotovskiy Conference on Learning Theory, 582-609, 2020	52	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	49	2019
A characterization of multiclass learnability N Brukhim, D Carmon, I Dinur, S Moran, A Yehudayoff 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	44	2022
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	44	2022
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	39	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	38*	2017
Private center points and learning of halfspaces A Beimel, S Moran, K Nissim, U Stemmer Conference on Learning Theory, 269-282, 2019	35	2019
Labeled compression schemes for extremal classes S Moran, MK Warmuth Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari …, 2016	35	2016

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs