A Geometric Approach to Sample Compression

The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of hyperplanes in Hyperbolic space, and Piecewise-Linear hyperplane arrangements, are shown to represent maximum classes, generalizing the corresponding Euclidean result. A main result is that PL arrangements can be swept by a moving hyperplane to unlabeled d-compress any finite maximum class, forming a peeling scheme as conjectured by Kuzmin & Warmuth. A corollary is that some d-maximal classes cannot be embedded into any maximum class of VC dimension d+k, for any constant k. The construction of the PL sweeping involves Pachner moves on the one-inclusion graph, corresponding to moves of a hyperplane across the intersection of d other hyperplanes. This extends the well known Pachner moves for triangulations to cubical complexes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2014

Bounding Embeddings of VC Classes into Maximum Classes

One of the earliest conjectures in computational learning theory-the Sam...
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/11/2022

Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes

The sample compressibility of concept classes plays an important role in...
research
08/12/2023

Multiclass Learnability Does Not Imply Sample Compression

A hypothesis class admits a sample compression scheme, if for every samp...
research
05/25/2012

Measurability Aspects of the Compactness Theorem for Sample Compression Schemes

It was proved in 1998 by Ben-David and Litman that a concept space has a...
research
12/15/2017

Results for the maximum weight planar subgraph problem

The problem of finding the maximum-weight, planar subgraph of a finite, ...
research
10/01/2020

Analysis of the weighted kappa and its maximum with Markov moves

In this paper the notion of Markov move from Algebraic Statistics is use...

Please sign up or login with your details

Forgot password? Click here to reset