arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0702683math.STstat.TH
收藏

统计学习的风险界限

Risk bounds for statistical learning

Pascal Massart, Élodie Nédélec

摘要:

我们提出了一个一般定理,给出了经验风险最小化(ERM)的风险的上界。我们扩展Tsybakov的风险分析的风险保证金类型的条件下,使用方便加权经验过程的集中不等式。这使我们能够处理的方法来衡量“大小”的一类分类器以外的熵括号中的Tsybakov的工作。特别是,我们推导出新的风险界限的风险风险管理时,分类规则属于一些VC类的保证金条件下,并讨论这些界限的最优性在极大极小意义上。

英文摘要:

We propose a general theorem providing upper bounds for the risk of an empirical risk minimizer (ERM).We essentially focus on the binary classification framework. We extend Tsybakov's analysis of the risk of an ERM under margin type conditions by using concentration inequalities for conveniently weighted empirical processes. This allows us to deal with ways of measuring the ``size'' of a class of classifiers other than entropy with bracketing as in Tsybakov's work. In particular, we derive new risk bounds for the ERM when the classification rules belong to some VC-class under margin conditions and discuss the optimality of these bounds in a minimax sense.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑