























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.
| Comments: | 29 pages |
| Subjects: | Machine Learning (cs.LG) |
| MSC classes: | Primary: 68Q32 |
| Cite as: | arXiv:2605.12465 [cs.LG] |
| (or arXiv:2605.12465v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.12465 arXiv-issued DOI via DataCite (pending registration) |
From: Leonardo Coregliano [view email]
[v1]
Tue, 12 May 2026 17:50:14 UTC (27 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。