BriefGPT.xyz
Apr, 2012
从价值到算法:松弛和本地化
Relax and Localize: From Value to Algorithms
HTML
PDF
Alexander Rakhlin, Ohad Shamir, Karthik Sridharan
TL;DR
通过最小值极大分析推导出在线学习算法来应对困难的学习问题,利用本地顺序Rademacher复杂性与相关算法实现更快速的在线学习,并引入随机化方法以及其他的方法来完善算法性能。
Abstract
We show a principled way of deriving
online learning
algorithms from a
minimax analysis
. Various upper bounds on the minimax value, previously thought to be non-constructive, are shown to yield algorithms. This a
→