Shay Moran

Citirano

	Sve	Od 2019.
Citati	2305	2074
H-indeks	27	25
i10-indeks	52	49

700

350

175

525

201520162017201820192020202120222023202425 46 48 84 132 222 257 355 418 684

Javni pristup

Prikaži sve

52 članka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Amir YehudayoffDIKU, University of Copenhagen, and Department of Mathematics, TechnionPotvrđena adresa e-pošte na technion.ac.il
Steve HannekePurdue UniversityPotvrđena adresa e-pošte na ttic.edu
Noga AlonPrinceton University and Tel Aviv UniversityPotvrđena adresa e-pošte na tau.ac.il
Roi LivniTel Aviv UniversityPotvrđena adresa e-pošte na tauex.tau.ac.il
Yishay MansourTel Aviv UniversityPotvrđena adresa e-pošte na tauex.tau.ac.il
Olivier BousquetGooglePotvrđena adresa e-pošte na m4x.org
Daniel KaneUniversity of California, San DiegoPotvrđena adresa e-pošte na ucsd.edu
Raef BassilyAssociate Professor, Computer Science & Engineering, The Ohio State UniversityPotvrđena adresa e-pošte na osu.edu
Uri StemmerTel Aviv UniversityPotvrđena adresa e-pošte na tau.ac.il
Shai Ben-DavidUniverity of Waterloo, CanadaPotvrđena adresa e-pošte na uwaterloo.ca
Jonathan ShaferMITPotvrđena adresa e-pošte na mit.edu
Yuval FilmusAssociate Professor, TechnionPotvrđena adresa e-pošte na cs.technion.ac.il
Yuval DaganMITPotvrđena adresa e-pošte na mit.edu
Gillat KolPrinceton UniversityPotvrđena adresa e-pošte na princeton.edu
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoPotvrđena adresa e-pošte na eng.ucsd.edu
Elad HazanProfessor at Princeton University and Director Google AI PrincetonPotvrđena adresa e-pošte na princeton.edu
Mark BunAssistant Professor, Boston UniversityPotvrđena adresa e-pošte na bu.edu
Moshe BabaioffHebrew University of JerusalemPotvrđena adresa e-pošte na mail.huji.ac.il
Yannai A. GonczarowskiHarvard UniversityPotvrđena adresa e-pošte na fas.harvard.edu
Ofir DavidPotvrđena adresa e-pošte na technion.ac.il

Prati

Shay Moran

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

Potvrđena adresa e-pošte na google.com - Početna stranica

Computer Science Mathematics


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Learnability can be undecidable S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff Nature Machine Intelligence 1 (1), 44-48, 2019	137*	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	130	2019
Learners that use little information R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff Algorithmic Learning Theory, 25-55, 2018	117	2018
Sample compression schemes for VC classes S Moran, A Yehudayoff Journal of the ACM (JACM) 63 (3), 1-10, 2016	108	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	88	2020
Sign rank versus Vapnik-Chervonenkis dimension N Alon, S Moran, A Yehudayoff Sbornik: Mathematics 208 (12), 1724, 2017	80*	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	79	2017
On statistical learning via the lens of compression O David, S Moran, A Yehudayoff arXiv preprint arXiv:1610.03592, 2016	74*	2016
Limits of private learning with access to public data N Alon, R Bassily, S Moran Advances in neural information processing systems 32, 2019	68	2019
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	66	2021
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	65	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	59	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	57	2020
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	53	2022
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	52	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	50	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	42	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	39*	2017
Private center points and learning of halfspaces A Beimel, S Moran, K Nissim, U Stemmer Conference on Learning Theory, 269-282, 2019	37	2019
Labeled compression schemes for extremal classes S Moran, MK Warmuth Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari …, 2016	35	2016

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori