9 citations · 15 across the 6 of their papers we have counts for
9 papers
A learning problem that is independent of the set theory ZFC axioms
Shai Ben-David, Pavel Hrubes, Shay Moran +2
We consider the following statistical estimation problem: given a family F of real valued functions over some domain X and an i.i.d. sample drawn from an unknown distribution P ove…
Active classification with comparison queries
Daniel M. Kane, Shachar Lovett, Shay Moran +1
We study an extension of active learning in which the learning algorithm may ask the annotator to compare the distances of two examples from the boundary of their label-class. For…
Near-optimal linear decision trees for k-SUM and related problems
Daniel M. Kane, Shachar Lovett, Shay Moran
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant , we construct linear de…
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues
Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski +3
In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of t…
Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces
Shay Moran, Rom Pinchasi
Let be any collection of linearly separable sets of a set of points either in , or in . We show that for every natural number …
Sample compression schemes for VC classes
Shay Moran, Amir Yehudayoff
Sample compression schemes were defined by Littlestone and Warmuth (1986) as an abstraction of the structure underlying many learning algorithms. Roughly speaking, a sample compres…