Name
Abstract | ||
|---|---|---|
Normalization techniques such as Batch Normalization have been applied very successfully for training deep neural networks. Yet, despite its apparent empirical benefits, the reasons behind the success of Batch Normalization are mostly hypothetical. We thus aim to provide a more thorough theoretical understanding from an optimization perspective. Our main contribution towards this goal is the identification of various problem instances in the realm of machine learning where, under certain assumptions, Batch Normalization can provably accelerate optimization with gradient-based methods. We thereby turn Batch Normalization from an effective practical heuristic into a provably converging algorithm for these settings. Furthermore, we substantiate our analysis with empirical evidence that suggests the validity of our theoretical results in a broader context. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Machine Learning | Normalization (statistics),Computer science,Biochemical engineering |
DocType | Volume | Citations |
Journal | abs/1805.10694 | 6 |
PageRank | References | Authors |
0.41 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonas Moritz Kohler | 1 | 23 | 1.72 |
| Hadi Daneshmand | 2 | 10 | 1.16 |
| Aurelien Lucchi | 3 | 2419 | 89.45 |
| Ming Zhou | 4 | 4262 | 251.74 |
| Klaus Neymeyr | 5 | 11 | 0.98 |
| Thomas Hofmann | 6 | 10064 | 1001.83 |