Wide-minima Density Hypothesis and the Explore-Exploit Learning Rate Schedule

Code

• github.com/nikhil-iyer-97/wide-minima-density-hypothesis
  OfficialIn paperpytorch★ 10
• github.com/HA-Transformer/HA-Transformer
  In paperpytorch★ 33
• github.com/MindCode-4/code-9/tree/main/wide-minima-density-hypothesis
  mindspore★ 0
• github.com/MindCode-4/code-13/tree/main/wide-minima-density-hypothesis
  mindspore★ 0
• github.com/pwc-1/Paper-9/tree/main/4/wide-minima-density-hypothesis
  mindspore★ 0

Abstract

Several papers argue that wide minima generalize better than narrow minima. In this paper, through detailed experiments that not only corroborate the generalization properties of wide minima, we also provide empirical evidence for a new hypothesis that the density of wide minima is likely lower than the density of narrow minima. Further, motivated by this hypothesis, we design a novel explore-exploit learning rate schedule. On a variety of image and natural language datasets, compared to their original hand-tuned learning rate baselines, we show that our explore-exploit schedule can result in either up to 0.84% higher absolute accuracy using the original training budget or up to 57% reduced training time while achieving the original reported accuracy. For example, we achieve state-of-the-art (SOTA) accuracy for IWSLT'14 (DE-EN) dataset by just modifying the learning rate schedule of a high performing model.

Tasks

Benchmark Results

Reproductions