Fetching the paper…
Reading the bibliography…
This work continues the study of the relationship between sample compression schemes and statistical learning, which has been mostly investigated within the framework of binary classification.
Zur theorie der gesellschaftsspiele
J. von Neumann · 1928
Earlier work this paper cites.
A partition calculus in set theory
P. Erdös and R. Rado · 1956
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
V.N. Vapnik and A.Ya. Chervonenkis · 1971
Earlier work this paper cites.
Mean, median and mode in binomial distributions
R. Kaas and J.M. Buhrman · 1980
Earlier work this paper cites.
Relating data compression and learnability
Nick Littlestone and Manfred Warmuth · 1986
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth · 1989
Earlier work this paper cites.
Space-Bounded Learning and the Vapnik-Chervonenkis Dimension
S. Floyd · 1989
Earlier work this paper cites.
On learning sets and functions
B. K. Natarajan · 1989
Earlier work this paper cites.
Learning integer lattices
D. P. Helmbold, R. H. Sloan, and M. K. Warmuth · 1992
Earlier work this paper cites.
Characterizations of learnability for classes of {0,…,n}-valued functions
S. Ben-David, N. Cesa-Bianchi, D. Haussler, and P. M. Long · 1995
Earlier work this paper cites.
Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension
Sally Floyd and Manfred K. Warmuth · 1995
Earlier work this paper cites.
Boosting a weak learning algorithm by majority
Yoav Freund · 1995
Cited alongside, same era.
Combinatorial Variability of Vapnik-Chervonenkis Classes with Applications to Sample Compression Schemes
Shai Ben-David and Ami Litman · 1998
Cited alongside, same era.
Statistical learning theory
Vladimir Vapnik · 1998
Cited alongside, same era.
Compressing to VC dimension many points
Manfred K. Warmuth · 2003
Cited alongside, same era.
PAC-Bayesian Compression Bounds on the Prediction Error of Learning Algorithms for Classification
Thore Graepel, Ralf Herbrich, and John Shawe-Taylor · 2005
Cited alongside, same era.
Unlabeled compression schemes for maximum classes
Dima Kuzmin and Manfred K. Warmuth · 2007
Cited alongside, same era.
A sharp estimate of the binomial mean absolute deviation with applications
Daniel Berend and Aryeh Kontorovich · 2013
Later among the works it cites.
Concentration inequalities : a nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Later among the works it cites.
Externally definable sets and dependent pairs
A. Chernikov and P. Simon · 2013
Later among the works it cites.
Honest compressions and their application to compression schemes
Roi Livni and Pierre Simon · 2013
Later among the works it cites.
Optimal learners for multiclass problems
A. Daniely and S. Shalev-Shwartz · 2014
Later among the works it cites.
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Shifting: One-inclusion mistake bounds and sample compression
Benjamin I. P. Rubinstein, Peter L. Bartlett, and J. H. Rubinstein · 2009
Cited alongside, same era.
Combinatorial Set Theory: Partition Relations for Cardinals: Partition Relations for Cardinals
P. Erdös, A. Máté, A. Hajnal, and P. Rado · 2011
Cited alongside, same era.
Boosting: Foundations and Algorithms
Yoav Freund and Robert E. Schapire · 2012
Cited alongside, same era.
A geometric approach to sample compression
B. I. P. Rubinstein and J. H. Rubinstein · 2012
Cited alongside, same era.
Multiclass learnability and the ERM principle
Amit Daniely, Sivan Sabato, Shai Ben-David, and Shai Shalev-Shwartz · 2015
Later among the works it cites.
Nearly optimal classification for semimetrics
Lee-Ad Gottlieb, Aryeh Kontorovich, and Pinhas Nisnevitch · 2015
Later among the works it cites.
Adaptive learning with robust generalization guarantees
Rachel Cummings, Katrina Ligett, Kobbi Nissim, Aaron Roth, and Zhiwei Steven Wu · 2016
Closest in time.
Sample compression schemes for VC classes
Shay Moran and Amir Yehudayoff · 2016
Closest in time.