arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 0909.1468math.STstat.TH
收藏

通过聚集的统计推断的快速学习率

Fast learning rates in statistical inference through aggregation

Jean-Yves Audibert

摘要:

我们开发的最小最大的一般学习任务,包括在预测以及最好的功能,在一个参考集$\mathcal{G}$最小可能的附加项,称为收敛速度的最佳风险界限。当参考集是有限的,当$n$表示的训练数据的大小,我们提供的形式$C(\frac{\log|\mathcal{G}|}{n})^v$的极小极大收敛速度与严格的评价的正常数$C$和精确的$0<v\le1$,后者的值取决于凸的损失函数和输出分布的噪声水平。风险上限是基于顺序随机算法,在每一步集中在功能具有低风险和低方差相对于前一步预测功能。我们的分析提出了概率和最坏情况的观点之间的联系,并允许获得风险界限无法实现的标准统计学习方法。这项工作的关键思想之一是使用概率不等式相对于适当的(吉布斯)分布的预测函数空间,而不是使用它们相对于生成数据的分布。风险下限是基于阿苏阿德引理的细化,特别是考虑到损失函数的属性。我们的关键例子来说明的上限和下限是考虑$L_q$ -回归设置,给出了一个详尽的分析的收敛速度,而$q$范围在$[1;+\infty[$。

英文摘要:

We develop minimax optimal risk bounds for the general learning task consisting in predicting as well as the best function in a reference set $\mathcal{G}$ up to the smallest possible additive term, called the convergence rate. When the reference set is finite and when $n$ denotes the size of the training data, we provide minimax convergence rates of the form $C(\frac{\log|\mathcal{G}|}{n})^v$ with tight evaluation of the positive constant $C$ and with exact $0<v\le1$, the latter value depending on the convexity of the loss function and on the level of noise in the output distribution. The risk upper bounds are based on a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction function. Our analysis puts forward the links between the probabilistic and worst-case viewpoints, and allows to obtain risk bounds unachievable with the standard statistical learning approach. One of the key ideas of this work is to use probabilistic inequalities with respect to appropriate (Gibbs) distributions on the prediction function space instead of using them with respect to the distribution generating the data. The risk lower bounds are based on refinements of the Assouad lemma taking particularly into account the properties of the loss function. Our key example to illustrate the upper and lower bounds is to consider the $L_q$-regression setting for which an exhaustive analysis of the convergence rates is given while $q$ ranges in $[1;+\infty[$.

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

↑