Hedge algorithm and dual averaging schemes
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Prediction, Learning, and Games
- Primal-dual subgradient methods for convex problems
- The multiplicative weights update method: a meta-algorithm and applications
This page was built for publication: Hedge algorithm and dual averaging schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392814)