atlas

Research map / Learning theory and algorithms / Sample complexity

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

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Embed an intersection-closed class in a shortest-path-closed, intersection-closed extremal classIntersection-closed concept classes · Concept classes of VC dimension dunlabelled compression scheme size: at most 11dHelped
Require an extremal class to contain a maximum subclass of VC dimension d-1Extremal classes · Extremal classes of VC dimension dunlabelled compression scheme size: dHelped
Choose a proper extremal subclass preserving an edge of every colourExtremal classes · Extremal classes of VC dimension 2unlabelled compression scheme size: 2Helped
Add ordered shortest paths between comparable pairs while retaining intersection closureIntersection-closed classes · Concept classes of VC dimension dVC dimension of the closure: d to at most 11dMixed
Use a proper extremal subclass satisfying the cubical colour conditionExtremal classes · Extremal classes with a suitable subclass chainunlabelled compression scheme sizeHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy