user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: How Does Learning Rate Decay Help Modern Neural Networks?

Paper content:
Learning rate decay (lrDecay) is a \emph{de facto} technique for training modern neural networks.
It starts with a large learning rate and then decays it multiple times.
It is empirically observed to help both optimization and generalization.
Common beliefs in how lrDecay works come from the optimization analysis of (Stochastic) Gradient Descent:
1) an initially large learning rate accelerates training or helps the network escape spurious local minima;
2) decaying the learning rate helps the network converge to a local minimum and avoid oscillation.
Despite the popularity of these common beliefs, experiments suggest that they are insufficient in explaining the general effectiveness of lrDecay in training modern neural networks that are deep, wide, and nonconvex.
We provide another novel explanation: an initially large learning rate suppresses the network from memorizing noisy data while decaying the learning rate improves the learning of complex patterns.
The proposed explanation is validated on a carefully-constructed dataset with tractable pattern complexity.
And its implication, that additional patterns learned in later stages of lrDecay are more complex and thus less transferable, is justified in real-world datasets.
We believe that this alternative explanation will shed light into the design of better training strategies for modern neural networks.
Modern neural networks are deep, wide, and nonconvex.
They are powerful tools for representation learning and serve as core components of deep learning systems.
They are top-performing models in language translation (Sutskever et al., 2014 ), visual recognition (He et al., 2016 , and decision making (Silver et al., 2018) .
However, the understanding of modern neural networks is way behind their broad applications.
A series of pioneering works (Zhang et al., 2017; Belkin et al., 2019; Locatello et al., 2019) reveal the difficulty of applying conventional machine learning wisdom to deep learning.
A better understanding of deep learning is a major mission in the AI field.
One obstacle in the way of understanding deep learning is the existence of magic modules in modern neural networks and magic tricks to train them.
Take batch normalization module (Ioffe & Szegedy, 2015) for example, its pervasiveness in both academia and industry is undoubted.
The exact reason why it expedites training and helps generalization, however, remains mysterious and is actively studied in recent years (Bjorck et al., 2018; Santurkar et al., 2018; Kohler et al., 2019) .
Only when we clearly understand these magical practices can we promote the theoretical understanding of modern neural networks.
Learning rate is "the single most important hyper-parameter" (Bengio, 2012) in training neural networks.
Learning rate decay (lrDecay) is a de facto technique for training modern neural networks, where we adopt an initially large learning rate and then decay it by a certain factor after pre-defined epochs.
Popular deep networks such as ResNet (He et al., 2016) , DenseNet (Huang et al., 2017b) are all trained by Stochastic Gradient Descent (SGD) with lrDecay.
Figure 1
(a) is an example of lrDecay, with the learning rate decayed by 10 every 30 epochs.
The training is divided into several stages by the moments of decay.
These stages can be easily identified in learning curves (such as Figure 1(b
) ), where the performance boosts sharply shortly after the learning rate is decayed. The
lrDecay enjoys great popularity due to its simplicity and general effectiveness.
Common beliefs in how lrDecay works are derived from the optimization analysis in (Stochastic) Gradient Descent (LeCun et al., 1991; Kleinberg et al., 2018) .
They attribute the effect of an initially Kleinberg et al. (2018) optimization escapes bad local minima converges to local minimum Proposed pattern complexity avoids fitting noisy data learns more complex patterns Table 1 : Comparison of explanations on why lrDecay helps training neural networks.
The column "supported" means whether the explanation is supported by the empirical experiments in this paper.
large learning rate to escaping spurious local minima or accelerating training and attribute the effect of decaying the learning rate to avoiding oscillation around local minima.
However, these common beliefs are insufficient to explain our empirical observations from a series of carefully-designed experiments in Section 4.
In this paper, we provide an alternative view: the magnitude of the learning rate is closely related to the complexity of learnable patterns.
From this perspective, we propose a novel explanation for the efficacy of lrDecay: an initially large learning rate suppresses the memorization of noisy data while decaying the learning rate improves the learning of complex patterns.
This is validated on a carefully-constructed dataset with tractable pattern complexity.
The pattern complexity in realworld datasets is often intractable.
We thus validate the explanation by testing its implication on real-world datasets.
The implication that additional patterns learned in later stages of lrDecay are more complex and thus less transferable across different datasets, is also justified empirically.
A comparison between the proposed explanation and the common beliefs is summarized in Table 1 .
Our explanation is supported by carefully-designed experiments and provides a new perspective on analyzing learning rate decay.
The contribution of this paper is two-fold:
• We demonstrate by experiments that existing explanations of how lrDecay works are insufficient in explaining the training behaviors in modern neural networks.
• We propose a novel explanation based on pattern complexity, which is validated on a dataset with tractable pattern complexity, and its implication is validated on real-world datasets.
The explanation also suggests that complex patterns are only learnable after learning rate decay.
Thus, when the model learns all simple patterns, but the epoch to decay has not reached, immediately decaying the learning rate will not hurt the performance.
This implication is validated in Section A.1.
In this paper, we dive into how learning rate decay (lrDecay) helps modern neural networks.
We uncover the insufficiency of common beliefs and propose a novel explanation: the effect of decaying learning rate is to improve the learning of complex patterns, and the effect of an initially large learning rate is to avoid memorization of noisy data.
It is supported by experiments on a dataset with tractable pattern complexity as well as on real-world datasets.
It would be interesting to further bridge the proposed explanation and the formal analysis of optimization procedure.

assistant: text: We provide another novel explanation of learning rate decay: an initially large learning rate suppresses the network from memorizing noisy data while decaying the learning rate improves the learning of complex patterns.