NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (29)

cs.LG2016

On statistical learning via the lens of compression

Ofir David, Shay Moran, Amir Yehudayoff

math.CO2015

Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces

Shay Moran, Rom Pinchasi

cs.DM2017

Twenty (simple) questions

Yuval Dagan, Yuval Filmus, Ariel Gabizon +1

cs.LG2016

Labeled compression schemes for extremal classes

Shay Moran, Manfred K. Warmuth

cs.GT2018

Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximization

Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour +1

cs.DS2012

Shattering, Graph Orientations, and Connectivity

Laszlo Kozma, Shay Moran

cs.CG2018

Generalized comparison trees for point-location problems

Daniel M Kane, Shachar Lovett, Shay Moran

cs.LG2018

On Communication Complexity of Classification Problems

Daniel M. Kane, Roi Livni, Shay Moran +1

cs.LG2017

Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues

Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski +3

cs.DM2015

Node-balancing by edge-increments

Friedrich Eisenbrand, Shay Moran, Rom Pinchasi +1

cs.LG2015

Sample compression schemes for VC classes

Shay Moran, Amir Yehudayoff

cs.LG2019

Private PAC learning implies finite Littlestone dimension

Noga Alon, Roi Livni, Maryanthe Malliaris +1

math.CO2016

Sign rank versus VC dimension

Noga Alon, Shay Moran, Amir Yehudayoff

cs.DS2015

Simple and Optimal Randomized Fault-Tolerant Rumor Spreading

Benjamin Doerr, Carola Doerr, Shay Moran +1

cs.LG2019

An adaptive nearest neighbor rule for classification

Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund +1

cs.LG2019

Learning to Screen

Alon Cohen, Avinatan Hassidim, Haim Kaplan +2

cs.CG2017

Near-optimal linear decision trees for k-SUM and related problems

Daniel M. Kane, Shachar Lovett, Shay Moran

math.CO2018

A Sauer-Shelah-Perles Lemma for Sumsets

Zeev Dvir, Shay Moran

cs.LG2019

Private Center Points and Learning of Halfspaces

Amos Beimel, Shay Moran, Kobbi Nissim +1

cs.LG2018

Learners that Use Little Information

Raef Bassily, Shay Moran, Ido Nachum +2

cs.DS2018

The entropy of lies: playing twenty questions with a liar

Yuval Dagan, Yuval Filmus, Daniel Kane +1

cs.LG2019

Private Learning Implies Online Learning: An Efficient Reduction

Alon Gonen, Elad Hazan, Shay Moran

math.CO2012

Shattering-Extremal Systems

Shay Moran

cs.LG2018

On the Perceptron's Compression

Shay Moran, Ido Nachum, Itai Panasoff +1

cs.LG2016

Teaching and compressing for low VC-dimension

Shay Moran, Amir Shpilka, Avi Wigderson +1

cs.DS2016

Hitting Set for hypergraphs of low VC-dimension

Karl Bringmann, László Kozma, Shay Moran +1

cs.LG2017

Active classification with comparison queries

Daniel M. Kane, Shachar Lovett, Shay Moran +1

cs.LG2017

A learning problem that is independent of the set theory ZFC axioms

Shai Ben-David, Pavel Hrubes, Shay Moran +2

math.CO2019

On weak $ε$-nets and the Radon number

Shay Moran, Amir Yehudayoff