Unlabeled sample compression schemes and corner peelings for ample and maximum classes

[1]  K. Southwood.  Shattering , 2015, Encyclopedic Dictionary of Archaeology.

[2]  Shay Moran,et al.  Proper Learning, Helly Number, and an Optimal SVM Bound , 2020, COLT 2020.

[3]  Gábor Tardos,et al.  Unlabeled Compression Schemes Exceeding the VC-dimension , 2018, Discret. Appl. Math..

[4]  Bruno Benedetti,et al.  Collapsibility of CAT(0) spaces , 2011, Geometriae Dedicata.

[5]  Hans-Jürgen Bandelt,et al.  COMs: Complexes of oriented matroids , 2015, J. Comb. Theory, Ser. A.

[6]  Shay Moran,et al.  Labeled Compression Schemes for Extremal Classes , 2015, ALT.

[7]  Shay Moran,et al.  Sample compression schemes for VC classes , 2015, 2016 Information Theory and Applications Workshop (ITA).

[8]  Martin Tancer.  Recognition of Collapsible Complexes is NP-Complete , 2016, Discret. Comput. Geom..

[9]  Shay Moran,et al.  Teaching and compressing for low VC-dimension , 2015, Electron. Colloquium Comput. Complex..

[10]  Michah Sageev,et al.  CAT(0) cube complexes and groups , 2014 .

[11]  Boting Yang,et al.  Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes , 2014, ALT.

[12]  Lajos Rónyai,et al.  Shattering-Extremal Set Systems of VC Dimension at most 2 , 2014, Electron. J. Comb..

[13]  Shai Ben-David,et al.  Understanding Machine Learning: From Theory to Algorithms , 2014 .

[14]  Peter L. Bartlett,et al.  Bounding Embeddings of VC Classes into Maximum Classes , 2014, ArXiv.

[15]  Hunter R. Johnson,et al.  Some new maximum VC classes , 2013, Inf. Process. Lett..

[16]  Ćemal B. Dolićanin,et al.  The Geometric Approach , 2014 .

[17]  Hans Ulrich Simon,et al.  Recursive teaching dimension, VC-dimension and sample compression , 2014, J. Mach. Learn. Res..

[18]  Shay Moran,et al.  Shattering, Graph Orientations, and Connectivity , 2012, Electron. J. Comb..

[19]  Alex M. Andrew,et al.  Boosting: Foundations and Algorithms , 2012 .

[20]  Shay Moran,et al.  Shattering-Extremal Systems , 2012, ArXiv.

[21]  Yoav Freund,et al.  Boosting: Foundations and Algorithms , 2012 .

[22]  Benjamin I. P. Rubinstein,et al.  A Geometric Approach to Sample Compression , 2009, J. Mach. Learn. Res..

[23]  Bruno Benedetti,et al.  Metric Geometry, Convexity and Collapsibility , 2011 .

[24]  Jane Zundel.  MATCHING THEORY , 2011 .

[25]  Martin Tancer,et al.  d-collapsibility is NP-complete for d greater or equal to 4 , 2008, Chic. J. Theor. Comput. Sci..

[26]  Ron Aharoni,et al.  Independent systems of representatives in weighted graphs , 2007, Comb..

[27]  Hans-Jürgen Bandelt,et al.  Combinatorics of lopsided sets , 2006, Eur. J. Comb..

[28]  Jirí Matousek.  The Number Of Unique-Sink Orientations of the Hypercube* , 2006, Comb..

[29]  A. O. Houcine.  On hyperbolic groups , 2006 .

[30]  H. Bandelt,et al.  Metric graph theory and geometry: a survey , 2006 .

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

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

[33]  H. Tracy Hall.  Counterexamples in Discrete Geometry , 2004 .

[34]  Ingo Andreas Schurr,et al.  Unique sink orientations of cubes , 2004 .

[35]  Claes Johnson,et al.  Mathematics and Computation , 2023, Springer Proceedings in Mathematics & Statistics.

[36]  Sally Floyd,et al.  Sample compression, learnability, and the Vapnik-Chervonenkis dimension , 2004, Machine Learning.

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

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

[39]  Lajos Rónyai,et al.  Shattering News , 2002, Graphs Comb..

[40]  Tibor Szabó,et al.  Unique sink orientations of cubes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[42]  R. Forman.  Morse Theory for Cell Complexes , 1998 .

[43]  Andreas W. M. Dress,et al.  Towards a theory of holistic clustering , 1996, Mathematical Hierarchies and Biology.

[44]  Béla Bollobás,et al.  Defect Sauer Results , 1995, J. Comb. Theory, Ser. A.

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

[46]  G. Ziegler.  Lectures on Polytopes , 1994 .

[47]  Katarína Cechlárová.  The uniquely solvable bipartite matching problem , 1991, Oper. Res. Lett..

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

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

[50]  Paul H. Edelman,et al.  The theory of convex geometries , 1985 .

[51]  J. Lawrence.  Lopsided sets and orthant-intersection by convex sets , 1983 .

[52]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[53]  Glynn Winskel,et al.  Events in computation , 1980 .

[54]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[55]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

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

[57]  S. Shelah.  A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .

[58]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[59]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .