首页> 外文期刊>Neural Networks and Learning Systems, IEEE Transactions on >A Deep Connection Between the Vapnik–Chervonenkis Entropy and the Rademacher Complexity
【24h】

A Deep Connection Between the Vapnik–Chervonenkis Entropy and the Rademacher Complexity

机译:Vapnik-Chervonenkis熵与Rademacher复杂度之间的深层联系

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we derive a deep connection between the Vapnik-Chervonenkis (VC) entropy and the Rademacher complexity. For this purpose, we first refine some previously known relationships between the two notions of complexity and then derive new results, which allow computing an admissible range for the Rademacher complexity, given a value of the VC-entropy, and vice versa. The approach adopted in this paper is new and relies on the careful analysis of the combinatorial nature of the problem. The obtained results improve the state of the art on this research topic.
机译:在本文中,我们得出了Vapnik-Chervonenkis(VC)熵和Rademacher复杂度之间的深层联系。为此,我们首先完善两个复杂度概念之间的一些先前已知的关系,然后得出新的结果,这些结果允许在给定VC熵值的情况下计算Rademacher复杂度的允许范围,反之亦然。本文采用的方法是新方法,它依赖于对问题组合性质的仔细分析。获得的结果改进了该研究主题的最新技术水平。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号