arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.07346stat.MLcs.LG
收藏

在潜在的重尾反馈下具有更好的可扩展性

Better scalability under potentially heavy-tailed feedback

Osaka University(大阪大学)

Matthew J. Holland

摘要:

我们研究了鲁棒梯度下降(RGD)技术的可扩展替代方案,当损失和/或梯度可以是重尾时,可以使用这些技术,尽管这对学习者来说是未知的。核心技术很简单:代替试图在每一步鲁棒地聚集梯度(这是昂贵的并且导致风险界限中的次优维度依赖),我们将计算努力集中在基于可以并行运行的廉价随机子过程的集合鲁棒地选择(或新构造)强候选者上。确切的选择过程取决于底层目标的凸性,但在所有情况下,我们的选择技术都是一种增强弱学习者信心的强大形式。除了正式的保证,我们还提供了实验条件下的扰动鲁棒性的实证分析,在亚高斯和重尾数据,以及各种基准数据集的应用。整体外卖是一个可扩展的过程,是简单的实现,琐碎的并行化,这保持了形式的优点,但规模更好地大型学习问题的RGD方法。

英文摘要:

We study scalable alternatives to robust gradient descent (RGD) techniques that can be used when the losses and/or gradients can be heavy-tailed, though this will be unknown to the learner. The core technique is simple: instead of trying to robustly aggregate gradients at each step, which is costly and leads to sub-optimal dimension dependence in risk bounds, we instead focus computational effort on robustly choosing (or newly constructing) a strong candidate based on a collection of cheap stochastic sub-processes which can be run in parallel. The exact selection process depends on the convexity of the underlying objective, but in all cases, our selection technique amounts to a robust form of boosting the confidence of weak learners. In addition to formal guarantees, we also provide empirical analysis of robustness to perturbations to experimental conditions, under both sub-Gaussian and heavy-tailed data, along with applications to a variety of benchmark datasets. The overall take-away is an extensible procedure that is simple to implement, trivial to parallelize, which keeps the formal merits of RGD methods but scales much better to large learning problems.

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

↑