通过局部熵和样本压缩的最优学习
Optimal learning via local entropies and sample compression
摘要:
本文的目的是提供几个新的上界的过度风险与分类问题的主要重点。我们提出了两种方法,并通过类的分布相关局部熵或特定样本压缩方案的大小来表示所获得的界。我们表明,在某些情况下,我们的保证是最佳的常数因子和优于以前已知的结果。作为我们结果的应用,我们为硬利润支持向量机提供了一个新的紧PAC界限、对对数凹分布下某些经验风险最小化器的扩展分析、在线到批量转换的新变体以及分布相关的局部界限聚集框架。我们还开发了技术,允许取代经验覆盖数或覆盖数与括号的覆盖相对于数据的分布。基于矩量法结合投票算法的分析,对样本压缩方案进行了证明。
英文摘要:
The aim of this paper is to provide several novel upper bounds on the excess risk with a primal focus on classification problems. We suggest two approaches and the obtained bounds are represented via the distribution dependent local entropies of the classes or the sizes of specific sample com- pression schemes. We show that in some cases, our guarantees are optimal up to constant factors and outperform previously known results. As an application of our results, we provide a new tight PAC bound for the hard-margin SVM, an extended analysis of certain empirical risk minimizers under log-concave distributions, a new variant of an online to batch conversion, and distribution dependent localized bounds in the aggregation framework. We also develop techniques that allow to replace empirical covering number or covering numbers with bracketing by the coverings with respect to the distribution of the data. The proofs for the sample compression schemes are based on the moment method combined with the analysis of voting algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。