Hedge algorithm and Dual Averaging schemes

被引:2
作者
Baes, Michel [1 ]
Buergisser, Michael [1 ]
机构
[1] ETH, Inst Operat Res, CH-8092 Zurich, Switzerland
关键词
First-order methods; Hedge algorithm; Dual Averaging methods; Convex optimization;
D O I
10.1007/s00186-012-0418-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We show that the Hedge algorithm, a method that is widely used in Machine Learning, can be interpreted as a particular instance of Dual Averaging schemes, which have recently been introduced by Nesterov for regret minimization. Based on this interpretation, we establish three alternative methods of the Hedge algorithm: one in the form of the original method, but with optimal parameters, one that requires less a priori information, and one that is better adapted to the context of the Hedge algorithm. All our modified methods have convergence results that are better or at least as good as the performance guarantees of the vanilla method. In numerical experiments, our methods significantly outperform the original scheme.
引用
收藏
页码:279 / 289
页数:11
相关论文
共 5 条
[1]  
Arora S., 2005, TECHNICAL REPORT
[2]  
Cesa-Bianchi N., 2006, PREDICTION LEARNING
[3]   A decision-theoretic generalization of on-line learning and an application to boosting [J].
Freund, Y ;
Schapire, RE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) :119-139
[4]  
Nemirovski A. S., 1983, PROBLEM COMPLEXITY M
[5]   Primal-dual subgradient methods for convex problems [J].
Nesterov, Yurii .
MATHEMATICAL PROGRAMMING, 2009, 120 (01) :221-259