研究人员开发了一种新颖的球覆盖定理，该定理源自Borsuk-Ulam定理，用于确定学习理论中列表可复现性的严格界限。该新定理通过将列表大小与准确性参数和假设类复杂度相关联，有助于形式化可复现性。研究结果为VC类提供了精确的界限，并证明了用于大间隔半空间的最佳列表大小，在特定间隔条件下实现了最小列表大小。 AI
影响 为机器学习中的可复现性建立了新的理论界限，可能指导算法开发。
排序理由 该集群包含一篇详细介绍机器学习新理论结果的学术论文。
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
arXiv:2606.06148v1 Announce Type: new Abstract: In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory. A central question is how the required list size relates to the accuracy parameter and natural complexity measures of…
In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory. A central question is how the required list size relates to the accuracy parameter and natural complexity measures of the hypothesis class. To achieve sharp bounds o…