arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.06005cs.LGmath.STstat.MLstat.TH
收藏

平均Hölder光滑性下的近最优学习

Near-optimal learning with average Hölder smoothness

Purdue University(普渡大学)

Steve Hanneke, Aryeh Kontorovich, Guy Kornowski

AI总结:

本文将平均Lipschitz光滑性推广为平均Hölder光滑性,在可实现与不可知回归设置下给出上下界风险界并建立极小极大速率,同时提出无需显式函数类表示即可达到近最优速率的算法。

摘要:

我们将Ashlagi等人(COLT 2021)提出的平均Lipschitz光滑性概念推广到Hölder光滑性。这种对函数“有效光滑性”的度量对底层分布敏感,并且可以远小于其经典的“最坏情况”Hölder常数。我们同时考虑可实现回归和不可知(含噪)回归两种设置,以平均Hölder光滑性为度量证明了上界和下界风险界;即使在平均Lipschitz光滑性的特殊情形下,这些速率也优于先前已知的速率。此外,我们的下界在可实现设置中在相差对数因子的意义下是紧的,从而我们建立了极小极大速率。从算法角度看,由于我们的平均光滑性概念是相对于未知的底层分布定义的,学习者没有函数类的显式表示,因此无法执行经验风险最小化(ERM)。尽管如此,我们提供了不同的学习算法,能够同时达到(近)最优学习速率。我们的结果适用于任何全有界度量空间,并以其内在几何表述。总体而言,我们的结果表明,经典的Hölder光滑性最坏情况概念本质上可以被其平均概念所取代,从而产生显著更锐利的保证。

英文摘要:

We generalize the notion of average Lipschitz smoothness proposed by Ashlagi et al. (COLT 2021) by extending it to Hölder smoothness. This measure of the "effective smoothness" of a function is sensitive to the underlying distribution and can be dramatically smaller than its classic "worst-case" Hölder constant. We consider both the realizable and the agnostic (noisy) regression settings, proving upper and lower risk bounds in terms of the average Hölder smoothness; these rates improve upon both previously known rates even in the special case of average Lipschitz smoothness. Moreover, our lower bound is tight in the realizable setting up to log factors, thus we establish the minimax rate. From an algorithmic perspective, since our notion of average smoothness is defined with respect to the unknown underlying distribution, the learner does not have an explicit representation of the function class, hence is unable to execute ERM. Nevertheless, we provide distinct learning algorithms that achieve both (nearly) optimal learning rates. Our results hold in any totally bounded metric space, and are stated in terms of its intrinsic geometry. Overall, our results show that the classic worst-case notion of Hölder smoothness can be essentially replaced by its average, yielding considerably sharper guarantees.

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

↑