AdaBound's published O(sqrt(T)) regret guarantee is shown to be incorrect via a counterexample, a corrected guarantee is proved, and dampened SGDM is shown to match AdaBound on CIFAR.
Domain-independent Dominance of Adaptive Methods
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
From a simplified analysis of adaptive methods, we derive AvaGrad, a new optimizer which outperforms SGD on vision tasks when its adaptability is properly tuned. We observe that the power of our method is partially explained by a decoupling of learning rate and adaptability, greatly simplifying hyperparameter search. In light of this observation, we demonstrate that, against conventional wisdom, Adam can also outperform SGD on vision tasks, as long as the coupling between its learning rate and adaptability is taken into account. In practice, AvaGrad matches the best results, as measured by generalization accuracy, delivered by any existing optimizer (SGD or adaptive) across image classification (CIFAR, ImageNet) and character-level language modelling (Penn Treebank) tasks.
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Convergence of AdaBound and its Connection to SGD
AdaBound's published O(sqrt(T)) regret guarantee is shown to be incorrect via a counterexample, a corrected guarantee is proved, and dampened SGDM is shown to match AdaBound on CIFAR.