I agree that this site is using cookies. You can find further informations here.
X
Moran, Shay
176  results:
Search for persons X
?
1

Local Borsuk-Ulam, Stability, and Replicability:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Chase, Zachary ; Chornomaz, Bogdan ; Moran, Shay. - p. 1769-1780 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Adversarial Laws of Large Numbers and Optimal Regret in Onl..:

Alon, Noga ; Ben-Eliezer, Omri ; Dagan, Yuval...
SIAM Journal on Computing.  , 2023
Link: https://doi.org/10.1137/..
 
?
3

Stability and Replicability in Learning:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Chase, Zachary ; Moran, Shay ; Yehudayoff, Amir - p. 2430-2439 , 2023
Link: https://doi.org/10.1109/..
 
?
4

A Characterization of Multiclass Learnability:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Brukhim, Nataly ; Carmon, Daniel ; Dinur, Irit.. - p. 943-955 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Understanding Generalization via Leave-One-Out Conditional ..:

, In: 2022 IEEE International Symposium on Information Theory (ISIT),
Haghifam, Mahdi ; Moran, Shay ; Roy, Daniel M.. - p. 2487-2492 , 2022
Link: https://doi.org/10.1109/..
 
?
6

Statistically Near-Optimal Hypothesis Selection:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Bousquet, Olivier ; Braverman, Mark ; Kol, Gillat.. - p. 909-919 , 2022
Link: https://doi.org/10.1109/..
 
?
7

A Theory of PAC Learnability of Partial Concept Classes:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Alon, Noga ; Hanneke, Steve ; Holzman, Ron. - p. 658-671 , 2022
Link: https://doi.org/10.1109/..
 
?
8

Private and Online Learnability Are Equivalent:

Alon, Noga ; Bun, Mark ; Livni, Roi..
Journal of the ACM.  69 (2022)  4 - p. 1-34 , 2022
Link: https://doi.org/10.1145/..
 
?
9

Unlabeled sample compression schemes and corner peelings fo..:

Chalopin, Jérémie ; Chepoi, Victor ; Moran, Shay.
Journal of Computer and System Sciences.  127 (2022)  - p. 1-28 , 2022
Link: https://doi.org/10.1016/..
 
?
10

Learnability can be independent of set theory (invited pape..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Ben-David, Shai ; Hrubes, Pavel ; Moran, Shay.. - p. 11 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Boosting simple learners:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Alon, Noga ; Gonen, Alon ; Hazan, Elad. - p. 481-489 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

A theory of universal learning:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bousquet, Olivier ; Hanneke, Steve ; Moran, Shay.. - p. 532-541 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Adversarial laws of large numbers and optimal regret in onl..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Alon, Noga ; Ben-Eliezer, Omri ; Dagan, Yuval... - p. 447-455 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

Elementary Derivations of the Euclidean Hurwitz Algebras Ad..:

Moran, Tomer ; Moran, Shay ; Moran, Shlomo
The American Mathematical Monthly.  128 (2021)  8 - p. 726-736 , 2021
Link: https://doi.org/10.1080/..
 
?
15

On the Perceptron's Compression:

, In: Lecture Notes in Computer Science; Beyond the Horizon of Computability,
Moran, Shay ; Nachum, Ido ; Panasoff, Itai. - p. 310-325 , 2020
Link: https://doi.org/10.1007/..
 
1-15