Shifting: One-inclusion mistake bounds and sample compression

[1]  Hans Ulrich Simon,et al.  One-inclusion hypergraph density revisited , 2010, Inf. Process. Lett..

[2]  Benjamin I. P. Rubinstein,et al.  Geometric & Topological Representations of Maximum Classes with Applications to Sample Compression , 2008, COLT.

[3]  Peter L. Bartlett,et al.  Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds , 2006, NIPS.

[4]  Manfred K. Warmuth,et al.  Unlabeled Compression Schemes for Maximum Classes, , 2007, COLT.

[5]  Manfred K. Warmuth,et al.  Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension , 1995, Machine Learning.

[6]  Manfred K. Warmuth,et al.  Relating Data Compression and Learnability , 2003 .

[7]  Manfred K. Warmuth Compressing to VC Dimension Many Points , 2003, COLT.

[8]  Yi Li,et al.  The one-inclusion graph algorithm is near-optimal for the prediction model of learning , 2001, IEEE Trans. Inf. Theory.

[9]  Shai Ben-David,et al.  Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes , 1998, Discret. Appl. Math..

[10]  David Haussler,et al.  Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension , 1995, J. Comb. Theory, Ser. A.

[11]  Philip M. Long,et al.  Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions , 1995, J. Comput. Syst. Sci..

[12]  Emo Welzl,et al.  Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements , 1994, Discret. Comput. Geom..

[13]  Sally Floyd,et al.  Space-bounded learning and the Vapnik-Chervonenkis dimension , 1989, COLT '89.

[14]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[15]  M. Livingston,et al.  Embeddings in hypercubes , 1988 .

[16]  David Haussler,et al.  Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.

[17]  Leslie G. Valiant,et al.  A general lower bound on the number of examples needed for learning , 1988, COLT '88.

[18]  Noga Alon,et al.  Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension , 1987, SCG '87.

[19]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory, Ser. A.

[20]  I. Havel,et al.  $B$-valuations of graphs , 1972 .

[21]  V. Firsov Isometric embedding of a graph in a Boolean cube , 1965 .

[22]  N. Aizenberg On the representation of a sum mod m in a class of normal forms of functions of m-valued logic , 1965, Cybernetics.

[23]  P. Hall On Representatives of Subsets , 1935 .