Year: 2026
Type: preprint
Abstract: Recently, a series of works have started studying variations of concepts from learning theory for product spaces, which can be collected under the name high-arity learning theory. In this work, we consider a high-arity variant of sample compression schemes and we prove that the existence of a high-arity sample compression scheme of non-trivial quality implies high-arity PAC learnability.
Source: arXiv (Cornell University)
Authors: Coregliano, Leonardo N., Opich, William
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7161002292
Cites:
Cited by:
Related to: