Unlabeled sample compression schemes for oriented matroids
Tilen Marc

TL;DR
This paper constructs proper unlabeled sample compression schemes for classes of topes in oriented matroids, leveraging their combinatorial structure and solutions of oriented matroid programs, advancing understanding of VC-dimension bounds.
Contribution
It introduces proper unlabeled sample compression schemes for topes of oriented matroids, extending to affine OMs and complexes with corner peelings, based on oriented matroid program solutions.
Findings
Constructed proper unlabeled compression schemes for OMs
Extended results to affine OMs and complexes with corner peelings
Linked compression schemes to oriented matroid program solutions
Abstract
A long-standing sample compression conjecture asks to linearly bound the size of the optimal sample compression schemes by the Vapnik-Chervonenkis (VC) dimension of an arbitrary class. In this paper, we explore the rich metric and combinatorial structure of oriented matroids (OMs) to construct proper unlabeled sample compression schemes for the classes of topes of OMs bounded by their VC-dimension. The result extends to the topes of affine OMs, as well as to the topes of the complexes of OMs that possess a corner peeling. The main tool that we use are the solutions of certain oriented matroid programs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Rough Sets and Fuzzy Logic · Topological and Geometric Data Analysis
