Shay Moran
I am an Associate Professor affiliated with the Faculty of Mathematics, Faculty of Computer Science, and Faculty of Data and Decision Sciences at the Technion – Israel Institute of Technology, and with Google Research in Tel Aviv.
Research
Mathematical foundations of learning
I study the mathematical foundations of learning, with a focus on generalization and regret bounds. I am also interested in the foundations of responsible and aligned learning.
People
Research group
Current members
- Bogdan ChornomazPostdoc
- Chao YanPostdoc
- Yair AshlagiPhD · co-advised with Roi Livni
- Vanessa KosoyPhD
- Liza NesterovaPhD · co-advised with Yuval Filmus
- Hilla ScheflerPhD
- Alexander ShlimovichPhD
- Tom WakninePhD
Former members
- Iska TsubariMaster, 2025
- Idan MehalelPhD · co-advised with Yuval Filmus, 2024
- Zachary ChasePostdoc, 2024
- Simone FioravantiIntern, 2023
- Jonathan ShaferIntern, 2022 and 2023
Publications
Recent work
Newest first · Read down the left column, then the right
-
Sorting from Counterexamples
Manuscript, 2026
-
Optimal Reconstruction from Linear Queries
COLT 2026
Best Paper Award -
Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
Manuscript, 2026
-
Strategic PAC Learnability via Geometric Definability
Manuscript, 2026
-
An Optimal Sauer Lemma Over k-ary Alphabets
Manuscript, 2026
-
Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
FOCS 2026
-
We Should Separate Memorization from Copyright
Manuscript, 2026
-
Optimal Mistake Bounds for Transductive Online Learning
NeurIPS 2025
Best Paper Runner-Up AwardOral Presentation -
Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
STOC 2026
Selected work
Newest first · Read down the left column, then the right
-
Credit Attribution and Stable Compression
NeurIPS 2024
-
A Characterization of Multiclass Learnability
FOCS 2022
Invited to FOCS special issue of SICOMP · Invited talk at TCS+ 2022
-
A Theory of Universal Learning
STOC 2021
Invited talk at TCS+ 2021 · Invited to HALG 2022
-
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games
COLT 2021
Best Paper Runner-Up Award -
An Equivalence Between Private Classification and Online Prediction
FOCS 2020
Best Paper AwardInvited to JACM · Invited talk at TCS+ 2020 · Plenary talk at TPDP 2020 · Invited to HALG 2021
-
Proper Learning, Helly Number, and an Optimal SVM Bound
COLT 2020
Best Paper AwardInvited to Journal of Mathematical Statistics and Learning · Invited to HALG 2021
-
Learnability can be undecidable
Nature Machine Intelligence, 2019
STOC 2021 (invited paper)
-
Sign rank, VC dimension and spectral gaps
In a special issue for the 150th anniversary of Sbornik: Mathematics, 2017
-
Sample compression schemes for VC classes
Journal of the ACM, 2016
Final Award for Outstanding Paper in the Field of Machine Learning
Beyond research papers
Expository & recreational mathematics
-
Diagonalization Games
American Mathematical Monthly (AMM) 2024
Studies an elementary combinatorial game inspired by Cantor's diagonalization argument.
-
Elementary Derivations of the Euclidean Hurwitz Algebras
American Mathematical Monthly (AMM) 2021
A family project completing the last work of my late uncle Gadi Moran, initiated by Gadi's son Arik, with the technical development carried out by Tomer Moran, Shlomo Moran, and me.