Unlabeled Compression Schemes Exceeding the VC-dimension

11/29/2018
by   Dömötör Pálvölgyi, et al.
0

In this note we disprove a conjecture of Kuzmin and Warmuth claiming that every family whose VC-dimension is at most d admits an unlabeled compression scheme to a sample of size at most d. We also study the unlabeled compression schemes of the joins of some families and conjecture that these give a larger gap between the VC-dimension and the size of the smallest unlabeled compression scheme for them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2022

Optimally compressing VC classes

Resolving a conjecture of Littlestone and Warmuth, we show that any conc...
research
06/27/2022

Sample compression schemes for balls in graphs

One of the open problems in machine learning is whether any set-family o...
research
12/05/2018

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

We examine connections between combinatorial notions that arise in machi...
research
10/03/2018

Agnostic Sample Compression for Linear Regression

We obtain the first positive results for bounded sample compression in t...
research
12/24/2022

A Labelled Sample Compression Scheme of Size at Most Quadratic in the VC Dimension

This paper presents a construction of a proper and stable labelled sampl...
research
08/05/2023

Set-alternating schemes: A new class of large Condorcet domains

In this paper, we introduce set-alternating schemes to construct Condorc...
research
10/28/2021

Labeled sample compression schemes for complexes of oriented matroids

We show that the topes of a complex of oriented matroids (abbreviated CO...

Please sign up or login with your details

Forgot password? Click here to reset