|
+
PDF
Chat
|
Intuitive norms are Euclidean
|
2025
|
Shay Moran
Alexander Shlimovich
Amir Yehudayoff
|
|
+
PDF
Chat
|
Of Dice and Games: A Theory of Generalized Boosting
|
2024
|
Marco Bressan
Nataly Brukhim
Nicolò Cesa‐Bianchi
Emmanuel Esposito
Yishay Mansour
Shay Moran
Maximilian Thiessen
|
|
+
PDF
Chat
|
On the ERM Principle in Meta-Learning
|
2024
|
Y. Alon
Steve Hanneke
Shay Moran
Uri Shalit
|
|
+
PDF
Chat
|
Probably Approximately Precision and Recall Learning
|
2024
|
Lee M. Cohen
Yishay Mansour
Shay Moran
S. Han
|
|
+
PDF
Chat
|
On Reductions and Representations of Learning Problems in Euclidean
Spaces
|
2024
|
Bogdan Chornomaz
Shay Moran
Tom Waknine
|
|
+
PDF
Chat
|
On Differentially Private Linear Algebra
|
2024
|
Haim Kaplan
Yishay Mansour
Shay Moran
Uri Stemmer
Nitzan Tur
|
|
+
|
Ramsey Theorems for Trees and a General ‘Private Learning Implies Online Learning’ Theorem
|
2024
|
Simone Fioravanti
Steve Hanneke
Shay Moran
Hilla Schefler
Iska Tsubari
|
|
+
PDF
Chat
|
Ramsey Theorems for Trees and a General 'Private Learning Implies Online
Learning' Theorem
|
2024
|
Simone Fioravanti
Steve Hanneke
Shay Moran
Hilla Schefler
Iska Tsubari
|
|
+
PDF
Chat
|
Credit Attribution and Stable Compression
|
2024
|
Roi Livni
Shay Moran
Kobbi Nissim
Chirag Pabbaraju
|
|
+
PDF
Chat
|
Fast Rates for Bandit PAC Multiclass Classification
|
2024
|
Liad Erez
Alon Cohen
Tomer Koren
Yishay Mansour
Shay Moran
|
|
+
PDF
Chat
|
A Theory of Interpretable Approximations
|
2024
|
Marco Bressan
Nicolò Cesa‐Bianchi
Emmanuel Esposito
Yishay Mansour
Shay Moran
Maximilian Thiessen
|
|
+
|
Local Borsuk-Ulam, Stability, and Replicability
|
2024
|
Zachary Chase
Bogdan Chornomaz
Shay Moran
Amir Yehudayoff
|
|
+
PDF
Chat
|
Dual VC Dimension Obstructs Sample Compression by Embeddings
|
2024
|
Zachary Chase
Bogdan Chornomaz
Steve Hanneke
Shay Moran
Amir Yehudayoff
|
|
+
PDF
Chat
|
Data Reconstruction: When You See It and When You Don't
|
2024
|
Edith Cohen
Haim Kaplan
Yishay Mansour
Shay Moran
Kobbi Nissim
Uri Stemmer
Eliad Tsfadia
|
|
+
PDF
Chat
|
The Real Price of Bandit Information in Multiclass Classification
|
2024
|
Liad Erez
Alon Cohen
Tomer Koren
Yishay Mansour
Shay Moran
|
|
+
PDF
Chat
|
List Sample Compression and Uniform Convergence
|
2024
|
Steve Hanneke
Shay Moran
Tom Waknine
|
|
+
PDF
Chat
|
Learning-Augmented Algorithms with Explicit Predictors
|
2024
|
Marek Eliáš
Haim Kaplan
Yishay Mansour
Shay Moran
|
|
+
PDF
Chat
|
Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
|
2024
|
Yuval Filmus
Steve Hanneke
Idan Mehalel
Shay Moran
|
|
+
PDF
Chat
|
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
|
2023
|
Noga Alon
Omri Ben‐Eliezer
Yuval Dagan
Shay Moran
Moni Naor
Eylon Yogev
|
|
+
PDF
Chat
|
Boosting Simple Learners
|
2023
|
Noga Alon
Alon Gonen
Elad Hazan
Shay Moran
|
|
+
|
Diagonalization Games
|
2023
|
Noga Alon
Olivier Bousquet
Kasper Green Larsen
Shay Moran
Shlomo Moran
|
|
+
|
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
|
2023
|
Yuval Filmus
Steve Hanneke
Idan Mehalel
Shay Moran
|
|
+
|
On Differentially Private Online Predictions
|
2023
|
Haim Kaplan
Yishay Mansour
Shay Moran
Kobbi Nissim
Uri Stemmer
|
|
+
|
List Online Classification
|
2023
|
Shay Moran
Ohad Sharon
Iska Tsubari
|
|
+
|
Replicability and stability in learning
|
2023
|
Zachary Chase
Shay Moran
Amir Yehudayoff
|
|
+
|
A Unified Characterization of Private Learnability via Graph Theory
|
2023
|
Noga Alon
Shay Moran
Hilla Schefler
Amir Yehudayoff
|
|
+
|
Can Copyright be Reduced to Privacy?
|
2023
|
Niva Elkin-Koren
Uri Hacohen
Roi Livni
Shay Moran
|
|
+
|
Statistical Indistinguishability of Learning Algorithms
|
2023
|
Alkis Kalavasis
Amin Karbasi
Shay Moran
Grigoris Velegkas
|
|
+
|
Adversarial Resilience in Sequential Prediction via Abstention
|
2023
|
Surbhi Goel
Steve Hanneke
Shay Moran
Abhishek Shetty
|
|
+
|
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
|
2023
|
Nataly Brukhim
Amit Daniely
Yishay Mansour
Shay Moran
|
|
+
|
Universal Rates for Multiclass Learning
|
2023
|
Steve Hanneke
Shay Moran
Qian Zhang
|
|
+
|
The Bayesian Stability Zoo
|
2023
|
Shay Moran
Hilla Schefler
Jonathan Shafer
|
|
+
|
Local Borsuk-Ulam, Stability, and Replicability
|
2023
|
Zachary Chase
Bogdan Chornomaz
Shay Moran
Amir Yehudayoff
|
|
+
|
A Trichotomy for Transductive Online Learning
|
2023
|
Steve Hanneke
Shay Moran
Jonathan Shafer
|
|
+
PDF
Chat
|
A Characterization of Multiclass Learnability
|
2022
|
Nataly Brukhim
Daniel Carmon
Irit Dinur
Shay Moran
Amir Yehudayoff
|
|
+
PDF
Chat
|
Understanding Generalization via Leave-One-Out Conditional Mutual Information
|
2022
|
Mahdi Haghifam
Shay Moran
Daniel M. Roy
Gintare Karolina Dziugiate
|
|
+
|
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
|
2022
|
Jérémie Chalopin
Victor Chepoi
Shay Moran
Manfred K. Warmuth
|
|
+
PDF
Chat
|
A Theory of PAC Learnability of Partial Concept Classes
|
2022
|
Noga Alon
Steve Hanneke
Ron Holzman
Shay Moran
|
|
+
PDF
Chat
|
Statistically Near-Optimal Hypothesis Selection
|
2022
|
Olivier Bousquet
Mark Braverman
Gillat Kol
Klim Efremenko
Shay Moran
|
|
+
|
Active Learning with Label Comparisons
|
2022
|
Gal Yona
Shay Moran
Gal Elidan
Amir Globerson
|
|
+
|
A Characterization of Multiclass Learnability
|
2022
|
Nataly Brukhim
Daniel Carmon
Irit Dinur
Shay Moran
Amir Yehudayoff
|
|
+
|
How Expressive Are Friendly School Partitions?
|
2022
|
Josef Minařík
Shay Moran
Michael Skotnica
|
|
+
|
Understanding Generalization via Leave-One-Out Conditional Mutual Information
|
2022
|
Mahdi Haghifam
Shay Moran
Daniel M. Roy
Gintare Karolina Dziugaite
|
|
+
|
Integral Probability Metrics PAC-Bayes Bounds
|
2022
|
Ron Amit
Baruch Epstein
Shay Moran
Ron Meir
|
|
+
|
Monotone Learning
|
2022
|
Olivier Bousquet
Amit Daniely
Haim Kaplan
Yishay Mansour
Shay Moran
Uri Stemmer
|
|
+
|
Fine-Grained Distribution-Dependent Learning Curves
|
2022
|
Olivier Bousquet
Steve Hanneke
Shay Moran
Jonathan Shafer
Ilya Tolstikhin
|
|
+
|
On Optimal Learning Under Targeted Data Poisoning
|
2022
|
Steve Hanneke
Amin Karbasi
Mohammad Mahmoody
Idan Mehalel
Shay Moran
|
|
+
|
Differentially-Private Bayes Consistency
|
2022
|
Olivier Bousquet
Haim Kaplan
Aryeh Kontorovich
Yishay Mansour
Shay Moran
Menachem Sadigurschi
Uri Stemmer
|
|
+
|
The unstable formula theorem revisited via algorithms
|
2022
|
M. Malliaris
Shay Moran
|
|
+
|
A Resilient Distributed Boosting Algorithm
|
2022
|
Yuval Filmus
Idan Mehalel
Shay Moran
|
|
+
|
Multiclass Boosting and the Cost of Weak Learning
|
2021
|
Nataly Brukhim
Elad Hazan
Shay Moran
Indraneel Mukherjee
Robert E. Schapire
|
|
+
|
Uniform Brackets, Containers, and Combinatorial Macbeath Regions.
|
2021
|
Kunal Dutta
Arijit Ghosh
Shay Moran
|
|
+
PDF
Chat
|
Uniform Brackets, Containers, and Combinatorial Macbeath Regions
|
2021
|
Kunal Dutta
Arijit Ghosh
Shay Moran
|
|
+
|
Towards a Unified Information-Theoretic Framework for Generalization
|
2021
|
Mahdi Haghifam
Gintare Karolina Dziugaite
Shay Moran
Daniel M. Roy
|
|
+
|
Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper
|
2021
|
Tomer Moran
Shay Moran
Shlomo Moran
|
|
+
|
Statistically Near-Optimal Hypothesis Selection
|
2021
|
Olivier Bousquet
Mark Braverman
Klim Efremenko
Gillat Kol
Shay Moran
|
|
+
|
A Theory of PAC Learnability of Partial Concept Classes.
|
2021
|
Noga Alon
Steve Hanneke
Ron Holzman
Shay Moran
|
|
+
PDF
Chat
|
Boosting simple learners
|
2021
|
Noga Alon
Alon Gonen
Elad Hazan
Shay Moran
|
|
+
|
A theory of universal learning
|
2021
|
Olivier Bousquet
Steve Hanneke
Shay Moran
Ramon van Handel
Amir Yehudayoff
|
|
+
PDF
Chat
|
Adversarial laws of large numbers and optimal regret in online classification
|
2021
|
Noga Alon
Omri Ben‐Eliezer
Yuval Dagan
Shay Moran
Moni Naor
Eylon Yogev
|
|
+
|
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games
|
2021
|
Steve Hanneke
Roi Livni
Shay Moran
|
|
+
|
Agnostic Online Learning and Excellent Sets
|
2021
|
M. Malliaris
Shay Moran
|
|
+
|
Towards a Unified Information-Theoretic Framework for Generalization
|
2021
|
Mahdi Haghifam
Gintare Karolina Dziugaite
Shay Moran
Daniel M. Roy
|
|
+
|
Statistically Near-Optimal Hypothesis Selection
|
2021
|
Olivier Bousquet
Mark Braverman
Klim Efremenko
Gillat Kol
Shay Moran
|
|
+
|
A Theory of PAC Learnability of Partial Concept Classes
|
2021
|
Noga Alon
Steve Hanneke
Ron Holzman
Shay Moran
|
|
+
|
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
|
2021
|
Noga Alon
Omri Ben‐Eliezer
Yuval Dagan
Shay Moran
Moni Naor
Eylon Yogev
|
|
+
|
Uniform Brackets, Containers, and Combinatorial Macbeath Regions
|
2021
|
Kunal Dutta
Arijit Ghosh
Shay Moran
|
|
+
|
A Theory of Universal Learning.
|
2020
|
Olivier Bousquet
Steve Hanneke
Shay Moran
Ramon van Handel
Amir Yehudayoff
|
|
+
PDF
Chat
|
An Equivalence Between Private Classification and Online Prediction
|
2020
|
Mark Bun
Roi Livni
Shay Moran
|
|
+
PDF
Chat
|
A Sauer–Shelah–Perles Lemma for Lattices
|
2020
|
Stijn Cambie
Bogdan Chornomaz
Zeev Dvir
Yuval Filmus
Shay Moran
|
|
+
|
Learning from Mixtures of Private and Public Populations
|
2020
|
Raef Bassily
Shay Moran
Anupama Nandi
|
|
+
PDF
Chat
|
On Weak $$\epsilon $$-Nets and the Radon Number
|
2020
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Proper Learning, Helly Number, and an Optimal SVM Bound
|
2020
|
Olivier Bousquet
Steve Hanneke
Shay Moran
Nikita Zhivotovskiy
|
|
+
|
Private Query Release Assisted by Public Data
|
2020
|
Raef Bassily
Albert Cheu
Shay Moran
Aleksandar Nikolov
Jonathan Ullman
Zhiwei Steven Wu
|
|
+
|
Closure Properties for Private Classification and Online Prediction
|
2020
|
Noga Alon
Amos Beimel
Shay Moran
Uri Stemmer
|
|
+
PDF
Chat
|
An Equivalence Between Private Classification and Online Prediction
|
2020
|
Mark Bun
Roi Livni
Shay Moran
|
|
+
|
Boosting Simple Learners
|
2020
|
Noga Alon
Alon Gonen
Elad Hazan
Shay Moran
|
|
+
|
Elementary Derivations of the Real Composition Algebras
|
2020
|
Tomer Moran
Shay Moran
Shlomo Moran
|
|
+
|
An Equivalence Between Private Classification and Online Prediction
|
2020
|
Mark Bun
Roi Livni
Shay Moran
|
|
+
|
Online Agnostic Boosting via Regret Minimization
|
2020
|
Nataly Brukhim
Xinyi Chen
Elad Hazan
Shay Moran
|
|
+
|
A Limitation of the PAC-Bayes Framework
|
2020
|
Roi Livni
Shay Moran
|
|
+
|
Proper Learning, Helly Number, and an Optimal SVM Bound
|
2020
|
Olivier Bousquet
Steve Hanneke
Shay Moran
Nikita Zhivotovskiy
|
|
+
|
Learning from Mixtures of Private and Public Populations
|
2020
|
Raef Bassily
Shay Moran
Anupama Nandi
|
|
+
|
On the Information Complexity of Proper Learners for VC Classes in the Realizable Case
|
2020
|
Mahdi Haghifam
Gintare Karolina Dziugaite
Shay Moran
Daniel M. Roy
|
|
+
|
A Theory of Universal Learning
|
2020
|
Olivier Bousquet
Steve Hanneke
Shay Moran
Ramon van Handel
Amir Yehudayoff
|
|
+
|
Private Query Release Assisted by Public Data
|
2020
|
Raef Bassily
Albert Cheu
Shay Moran
Aleksandar Nikolov
Jonathan Ullman
Zhiwei Steven Wu
|
|
+
|
Closure Properties for Private Classification and Online Prediction
|
2020
|
Noga Alon
Amos Beimel
Shay Moran
Uri Stemmer
|
|
+
|
Boosting Simple Learners
|
2020
|
Noga Alon
Alon Gonen
Elad Hazan
Shay Moran
|
|
+
PDF
Chat
|
Private PAC learning implies finite Littlestone dimension
|
2019
|
Noga Alon
Roi Livni
M. Malliaris
Shay Moran
|
|
+
|
Private Learning Implies Online Learning: An Efficient Reduction
|
2019
|
Alon Gonen
Elad Hazan
Shay Moran
|
|
+
PDF
Chat
|
Near-optimal Linear Decision Trees for k-SUM and Related Problems
|
2019
|
Daniel M. Kane
Shachar Lovett
Shay Moran
|
|
+
|
Private Center Points and Learning of Halfspaces
|
2019
|
Amos Beimel
Shay Moran
Kobbi Nissim
Uri Stemmer
|
|
+
|
Learning and Generalization for Matching Problems.
|
2019
|
Alon Cohen
Avinatan Hassidim
Haim Kaplan
Yishay Mansour
Shay Moran
|
|
+
|
Learning to Screen
|
2019
|
Alon Cohen
Avinatan Hassidim
Haim Kaplan
Yishay Mansour
Shay Moran
|
|
+
|
Passing Tests without Memorizing: Two Models for Fooling Discriminators.
|
2019
|
Olivier Bousquet
Roi Livni
Shay Moran
|
|
+
|
The Optimal Approximation Factor in Density Estimation
|
2019
|
Olivier Bousquet
Daniel M. Kane
Shay Moran
|
|
+
|
An adaptive nearest neighbor rule for classification
|
2019
|
Akshay Balsubramani
Sanjoy Dasgupta
Yoav Freund
Shay Moran
|
|
+
|
Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility
|
2019
|
Mark Braverman
Gillat Kol
Shay Moran
Raghuvansh R. Saxena
|
|
+
|
Limits of Private Learning with Access to Public Data
|
2019
|
Noga Alon
Raef Bassily
Shay Moran
|
|
+
|
On Weak epsilon-Nets and the Radon Number
|
2019
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Synthetic Data Generators: Sequential and Private
|
2019
|
Olivier Bousquet
Roi Livni
Shay Moran
|
|
+
|
Private Learning Implies Online Learning: An Efficient Reduction
|
2019
|
Alon Gonen
Elad Hazan
Shay Moran
|
|
+
|
Private Center Points and Learning of Halfspaces
|
2019
|
Amos Beimel
Shay Moran
Kobbi Nissim
Uri Stemmer
|
|
+
|
Learning to Screen
|
2019
|
Alon Cohen
Avinatan Hassidim
Haim Kaplan
Yishay Mansour
Shay Moran
|
|
+
PDF
Chat
|
A Sauer-Shelah-Perles Lemma for Sumsets
|
2018
|
Zeev Dvir
Shay Moran
|
|
+
|
The entropy of lies: playing twenty questions with a liar
|
2018
|
Yuval Dagan
Yuval Filmus
Daniel M. Kane
Shay Moran
|
|
+
|
A Sauer-Shelah-Perles Lemma for Lattices
|
2018
|
Stijn Cambie
Bogdan Chornomaz
Zeev Dvir
Yuval Filmus
Shay Moran
|
|
+
|
Near-optimal linear decision trees for k-SUM and related problems
|
2018
|
Daniel M. Kane
Shachar Lovett
Shay Moran
|
|
+
|
On the Perceptron's Compression
|
2018
|
Shay Moran
Ido Nachum
Itai Panasoff
Amir Yehudayoff
|
|
+
|
A Sauer-Shelah-Perles Lemma for Sumsets
|
2018
|
Zeev Dvir
Shay Moran
|
|
+
|
Private PAC learning implies finite Littlestone dimension
|
2018
|
Noga Alon
Roi Livni
M. Malliaris
Shay Moran
|
|
+
|
Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximization
|
2018
|
Moshe Babaioff
Yannai A. Gonczarowski
Yishay Mansour
Shay Moran
|
|
+
|
Generalized comparison trees for point-location problems
|
2018
|
Daniel M. Kane
Shachar Lovett
Shay Moran
|
|
+
|
The entropy of lies: playing twenty questions with a liar
|
2018
|
Yuval Dagan
Yuval Filmus
Daniel M. Kane
Shay Moran
|
|
+
|
A Sauer-Shelah-Perles Lemma for Lattices
|
2018
|
Stijn Cambie
Bogdan Chornomaz
Zeev Dvir
Yuval Filmus
Shay Moran
|
|
+
|
Private PAC learning implies finite Littlestone dimension
|
2018
|
Noga Alon
Roi Livni
M. Malliaris
Shay Moran
|
|
+
|
A Sauer-Shelah-Perles Lemma for Sumsets
|
2018
|
Zeev Dvir
Shay Moran
|
|
+
|
On the Perceptron's Compression
|
2018
|
Shay Moran
Ido Nachum
Itai Panasoff
Amir Yehudayoff
|
|
+
|
Learners that Leak Little Information.
|
2017
|
Raef Bassily
Shay Moran
Ido Nachum
Jonathan Shafer
Amir Yehudayoff
|
|
+
|
Learners that Use Little Information
|
2017
|
Raef Bassily
Shay Moran
Ido Nachum
Jonathan Shafer
Amir Yehudayoff
|
|
+
PDF
Chat
|
Active Classification with Comparison Queries
|
2017
|
Daniel M. Kane
Shachar Lovett
Shay Moran
Jiapeng Zhang
|
|
+
|
On weak $\epsilon$-nets and the Radon number
|
2017
|
Shay Moran
Amir Yehudayoff
|
|
+
|
On weak $ε$-nets and the Radon number
|
2017
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues
|
2017
|
Noga Alon
Moshe Babaioff
Yannai A. Gonczarowski
Yishay Mansour
Shay Moran
Amir Yehudayoff
|
|
+
|
Near-optimal linear decision trees for k-SUM and related problems
|
2017
|
Daniel M. Kane
Shachar Lovett
Shay Moran
|
|
+
|
Active classification with comparison queries
|
2017
|
Daniel M. Kane
Shachar Lovett
Shay Moran
Jiapeng Zhang
|
|
+
|
A learning problem that is independent of the set theory ZFC axioms
|
2017
|
Shai Ben-David
Pavel Hrubeš
Shay Moran
Amir Shpilka
Amir Yehudayoff
|
|
+
|
On Communication Complexity of Classification Problems
|
2017
|
Daniel M. Kane
Roi Livni
Shay Moran
Amir Yehudayoff
|
|
+
|
Learners that Use Little Information
|
2017
|
Raef Bassily
Shay Moran
Ido Nachum
Jonathan Shafer
Amir Yehudayoff
|
|
+
|
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues
|
2017
|
Noga Alon
Moshe Babaioff
Yannai A. Gonczarowski
Yishay Mansour
Shay Moran
Amir Yehudayoff
|
|
+
|
On weak $ε$-nets and the Radon number
|
2017
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Near-optimal linear decision trees for k-SUM and related problems
|
2017
|
Daniel M. Kane
Shachar Lovett
Shay Moran
|
|
+
PDF
Chat
|
Знаковый ранг и размерность Вапника-Червоненкиса
|
2017
|
Noga Alon
Shay Moran
Amir Yehudayoff
|
|
+
|
On statistical learning via the lens of compression
|
2016
|
Ofir David
Shay Moran
Amir Yehudayoff
|
|
+
PDF
Chat
|
Sample Compression Schemes for VC Classes
|
2016
|
Shay Moran
Amir Yehudayoff
|
|
+
PDF
Chat
|
Sample compression schemes for VC classes
|
2016
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Twenty (simple) questions
|
2016
|
Yuval Dagan
Yuval Filmus
Ariel Gabizon
Shay Moran
|
|
+
|
On statistical learning via the lens of compression
|
2016
|
Ofir David
Shay Moran
Amir Yehudayoff
|
|
+
|
Shattered Sets and the Hilbert Function
|
2016
|
Shay Moran
Cyrus Rashtchian
|
|
+
PDF
Chat
|
Labeled Compression Schemes for Extremal Classes
|
2016
|
Shay Moran
Manfred K. Warmuth
|
|
+
|
Node-balancing by edge-increments
|
2015
|
Friedrich Eisenbrand
Shay Moran
Rom Pinchasi
Martin Skutella
|
|
+
|
Sign rank versus VC dimension
|
2015
|
Noga Alon
Shay Moran
Amir Yehudayoff
|
|
+
|
Sample compression schemes for VC classes
|
2015
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Proper PAC learning is compressing
|
2015
|
Shay Moran
Amir Yehudayoff
|
|
+
PDF
Chat
|
Node-Balancing by Edge-Increments
|
2015
|
Friedrich Eisenbrand
Shay Moran
Rom Pinchasi
Martin Skutella
|
|
+
|
Hitting Set for hypergraphs of low VC-dimension
|
2015
|
Karl Bringmann
László Kozma
Shay Moran
N. S. Narayanaswamy
|
|
+
|
Shattered Sets and the Hilbert Function
|
2015
|
Shay Moran
Cyrus Rashtchian
|
|
+
|
Proper PAC learning is compressing.
|
2015
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Shattered Sets and the Hilbert Function.
|
2015
|
Shay Moran
Cyrus Rashtchian
|
|
+
|
Sample compression schemes for VC classes
|
2015
|
Shay Moran
Amir Yehudayoff
|
|
+
|
Node-balancing by edge-increments
|
2015
|
Friedrich Eisenbrand
Shay Moran
Rom Pinchasi
Martin Skutella
|
|
+
|
Labeled compression schemes for extremal classes
|
2015
|
Shay Moran
Manfred K. Warmuth
|
|
+
|
Sign rank versus VC dimension
|
2015
|
Noga Alon
Shay Moran
Amir Yehudayoff
|
|
+
|
Teaching and compressing for low VC-dimension
|
2015
|
Shay Moran
Amir Shpilka
Avi Wigderson
Amir Yehudayoff
|
|
+
|
Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces
|
2015
|
Shay Moran
Rom Pinchasi
|
|
+
PDF
Chat
|
Simple and optimal randomized fault-tolerant rumor spreading
|
2014
|
Benjamin Doerr
Carola Doerr
Shay Moran
Shlomo Moran
|
|
+
|
Sign Rank, VC Dimension and Spectral Gaps
|
2014
|
Noga Alon
Shay Moran
Amir Yehudayoff
|
|
+
|
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound
|
2014
|
Gillat Kol
Shay Moran
Amir Shpilka
Amir Yehudayoff
|
|
+
PDF
Chat
|
Shattering, Graph Orientations, and Connectivity
|
2013
|
László Kozma
Shay Moran
|
|
+
|
Shattering Extremal Systems
|
2012
|
Shay Moran
Kurt Mehlhorn
Ami Litman
|
|
+
|
Shattering, Graph Orientations, and Connectivity
|
2012
|
László Kozma
Shay Moran
|
|
+
|
Simple and Optimal Fault-Tolerant Rumor Spreading
|
2012
|
Benjamin Doerr
Carola Doerr
Shay Moran
Shlomo Moran
|
|
+
|
Shattering-Extremal Systems
|
2012
|
Shay Moran
|
|
+
|
Shattering, Graph Orientations, and Connectivity
|
2012
|
László Kozma
Shay Moran
|
|
+
PDF
Chat
|
Non-deterministic polynomial optimization problems and their approximation
|
1977
|
Ami Paz
Shay Moran
|
|
+
|
Properties of <i>N</i> -Multiplications and <i>N</i> <sup>*</sup> -Multiplications
|
1961
|
Shay Moran
|