Unlabeled compression schemes for maximum classes
From MaRDI portal
(Redirected from Publication:3174151)
Recommendations
Cited in
(28)- Learning the set covering machine by bound minimization and margin-sparsity trade-off
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- On partial cubes, well-graded families and their duals with some applications in graphs
- Shattering-extremal set systems from Sperner families
- Unlabeled compression schemes exceeding the VC-dimension
- On density of subgraphs of halved cubes
- Some new maximum VC classes
- Shifting: one-inclusion mistake bounds and sample compression
- Bounding embeddings of VC classes into maximum classes
- Labeled compression schemes for extremal classes
- On version space compression
- Order compression schemes
- Generalizing labeled and unlabeled sample compression to multi-label concept classes
- Teaching and Compressing for Low VC-Dimension
- Sign rank versus Vapnik-Chervonenkis dimension
- Algebraic methods proving Sauer's bound for teaching complexity
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- A geometric approach to sample compression
- Learning Theory
- Order compression schemes
- Compression schemes for concept classes induced by three types of discrete undirected graphical models
- Unlabeled sample compression schemes for oriented matroids
- Labeled sample compression schemes for complexes of oriented matroids
- Applications of littlestone dimension to query learning and to compression
- Optimal collusion-free teaching
- Sample compression for real-valued learners
- Applications of Littlestone dimension to query learning and to compression
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
This page was built for publication: Unlabeled compression schemes for maximum classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174151)
