Title: AN ACTOR-CRITIC ALGORITHM FOR LEARNING RATE LEARNING

Abstract: Stochastic gradient descent (SGD), which updates the model parameters by adding a local gradient times a learning rate at each step, is widely used in model training of machine learning algorithms such as neural networks. It is observed that the models trained by SGD are sensitive to learning rates and good learning rates are problem specific. To avoid manually searching of learning rates, which is tedious and inefficient, we propose an algorithm to automatically learn learning rates using actor-critic methods from reinforcement learning (RL). In particular, we train a policy network called actor to decide the learning rate at each step during training, and a value network called critic to give feedback about quality of the decision (e.g., the goodness of the learning rate outputted by the actor) that the actor made. Experiments show that our method leads to good convergence of SGD and can prevent overfitting to a certain extent, resulting in better performance than human-designed competitors.

1. INTRODUCTION:

While facing large scale of training data, stochastic learning such as stochastic gradient descent (SGD) is usually much faster than batch learning and often results in better models. An observation for SGD methods is that their performances are highly sensitive to the choice of learning rate LeCun et al. (2012) . Clearly, setting a static learning rate for the whole training process is insufficient, since intuitively the learning rate should decrease when the model becomes more and more close to a (local) optimum as the training goes on over time Maclaurin et al. (2015) . Although there are some empirical suggestions to guide how to adjust the learning rate over time in training, it is still a difficult task to find a good policy to adjust the learning rate, given that good policies are problem specific and depend on implementation details of a machine learning algorithm. One usually needs to try many times and adjust the learning rate manually to accumulate knowledge about the problem. However, human involvement often needs domain knowledge about the target problems, which is inefficient and difficult to scale up to different problems. Thus, a natural question arises: can we automatically adjust the learning rate? This is exactly the focus of this work and we aim to automatically learn the learning rates for SGD based machine learning (ML) algorithms without human-designed rules or hand-crafted features.

By examining the current practice of learning rate control/adjustment, we have two observations. First, learning rate control is a sequential decision process. At the beginning, we set an initial learning rate. Then at each step, we decide whether to change the learning rate and how to change it, based on the current model and loss, training data at hand, and maybe history of the training process. As suggested in Orr & Müller (2003) , one well-principled method for estimating the ideal learning rate that is to decrease the learning rate when the weight vector oscillates, and increase it when the weight vector follows a relatively steady direction. Second, although at each step some immediate reward (e.g., the loss decrement) can be obtained by taking actions, we care more about the performance of the final model found by the ML algorithm. Consider two different learning rate control policies: the first one leads to fast loss decrease at the beginning but gets saturated and stuck in a local minimum quickly, while the second one starts with slower loss decrease but results in much smaller final loss. Obviously, the second policy is better. That is, we prefer long-term rewards over short-term rewards.

Combining the two observations, it is easy to see that the problem of finding a good policy to control/adjust learning rate falls into the scope of reinforcement learning (RL) Sutton & Barto (1998), if one is familiar with RL. Inspired by the recent success of RL for sequential decision problems, in this work, we leverage RL techniques and try to learn the learning rate for SGD based methods.

We propose an algorithm to learn the learning rate within the actor-critic framework Sutton (1984) ; Sutton et al. (1999) ; Barto et al. (1983) ; Silver et al. (2014) from RL. In particular, an actor network is trained to take an action that decides the learning rate for current step, and a critic network is trained to give feedbacks to the actor network about long-term performance and help the actor network to adjust itself so as to perform better in the future steps. The main contributions of this paper include:

• We propose an actor-critic algorithm to automatically learn the learning rate for ML algorithms.

• Long-term rewards are exploited by the critic network in our algorithm to choose a better learning rate at each step.

• We propose to feed different training examples to the actor network and the critic network, which improve the generalization performance of the learnt ML model.

• A series of experiments validate the effectiveness of our proposed algorithm for learning rate control.

2. RELATED WORK:



2.1. IMPROVED GRADIENT METHODS:

Our focus is to improve gradient based ML algorithm through automatic learning of learning rate. Different approaches have been proposed to improve gradient methods, especially for deep neural networks.

Since SGD solely rely on a given example (or a mini-batch of examples) to compare gradient, its model update at each step tends to be unstable and it takes many steps to converge. To solve this problem, momentum SGD Jacobs (1988) is proposed to accelerate SGD by using recent gradients. RMSprop Tieleman & Hinton (2012) utilizes the magnitude of recent gradients to normalize the gradients. It always keeps a moving average over the root mean squared gradients, by which it divides the current gradient. Adagrad Duchi et al. (2011) adapts component-wise learning rates, and performs larger updates for infrequent and smaller updates for frequent parameters. Adadelta Zeiler (2012) extends Adagrad by reducing its aggressive, monotonically decreasing learning rate. Instead of accumulating all past squared gradients, Adadelta restricts the window of accumulated past gradients to some fixed size. Adam Kingma & Ba (2014) computes component-wise learning rates using the estimates of first and second moments of the gradients, which combines the advantages of AdaGrad and RMSProp. Senior et al. (2013) ; Sutton (1992); Darken & Moody (1990) focus on predefining update rules to adjust learning rates during training. A limitation of these methods is that they have additional free parameters which need to be set manually. Another recent work Daniel et al. (2016) studies how to automatically select step sizes, but it still requires hand-tuned features. Schaul et al. (2013) proposes a method to choose good learning rate for SGD, which relies on the square norm of the expectation of the gradient, and the expectation of the square norm of the gradient. The method is much more constrained than ours and several assumption should be met.

2.2. REINFORCEMENT LEARNING:

Since our proposed algorithm is based on RL techniques, here we give a very brief introduction to RL, which will ease the description of our algorithm in next section. 

3. METHOD:

In this section, we present an actor-critic algorithm that can automate the learning rate control for SGD based machine learning algorithms. (1)

A standard approach for the loss function minimization is gradient descent, which sequentially updates the parameters using gradients step by step:

ω t+1 = ω t -a t ∇f t ,

(2) where a t is the learning rate at step t, and ∇f t is the local gradient of f at ω t . Here one step can be the whole batch of all the training data, a mini batch of tens/hundreds of examples, or a random sample.

It is observed that the performance of SGD based methods is quite sensitive to the choice of a t for non-convex loss function f . Unfortunately, f is usually non-convex with respect to the parameters w in many ML algorithms, especially for deep neural networks. We aim to learn a learning rate controller using RL techniques that can automatically control a t .

Figure 1 illustrates our automatic learning rate controller, which adopts the actor-critic framework in RL. The basic idea is that at each step, given the current model ω t and training sample x, an actor network is used to take an action (the learning rate a t , and it will be used to update the model ω t ), and a critic network is used to estimate the goodness of the action. The actor network will be updated using the estimated goodness of a t , and the critic network will be updated by minimizing temporal difference (TD) Sutton & Barto (1990) error. We describe the details of our algorithm in the following subsections.

3.1. ACTOR NETWORK:

The actor network, which is called policy network in RL, plays the key role in our algorithm: it determines the learning rate control policy for the primary ML algorithm1 based on the current model, training data, and maybe historical information during the training process.

Note that ω t could be of huge dimensions, e.g., one widely used image recognition model VGGNet Simonyan & Zisserman (2014) has more than 140 million parameters. If the actor network takes all of those parameters as the inputs, its computational complexity would dominate the complexity of the primary algorithm, which is unfordable. Therefore, we propose to use a function χ(•) to process and yield a compact vector s t as the input of the actor network. Following the practice in RL, we call χ(•) the state function, which takes ω t and the training data x as inputs:

s t = χ(ω t , X).

(3)

Then the actor network π θ (•) parameterized by θ yields an action a t :

EQUATION

where the action a t ∈ R is a continuous value. When a t is determined, we update the model of the primary algorithm by Equation 2.

Note that the actor network has its own parameters and we need to learn them to output a good action. To learn the actor network, we need to know how to evaluate the goodness of an actor network. The critic network exactly plays this role.

3.2. CRITIC NETWORK:

Recall that our goal is to find a good policy for learning rate control to ensure that a good model can be learnt eventually by the primary ML algorithm. For this purpose, the actor network needs to output a good action a t at state s t so that finally a low training loss f (•) can be achieved. In RL, the Q function Q π (s, a) is often used to denote the long term reward of the state-action pair s, a while following the policy π to take future actions. In our problem, Q π (s t , a t ) indicates the accumulative decrement of training loss starting from step t. We define the immediate reward at step t as the one step loss decrement:

EQUATION

)

The accumulative value R t π of policy π at step t is the total discounted reward from step t:

R t π = Σ T k=t γ k-t r(s k , a k ),

where γ ∈ (0, 1] is the discount factor.

Considering that both the states and actions are uncountable in our problem, the critic network uses a parametric function Q ϕ (s, a) with parameters ϕ to approximate the Q value function Q π (s, a).

3.3. TRAINING OF ACTOR AND CRITIC NETWORKS:

The critic network has its own parameters ϕ, which is updated at each step using TD learning. More precisely, the critic is trained by minimizing the square error between the estimation Q ϕ (s t , a t ) and the target y t : y t = r t + γQ ϕ (s t+1 , a t+1 ).

(6) The TD error is defined as:

EQUATION

The weight update rule follows the on-policy deterministic actor-critic algorithm. The gradients of critic network are:

EQUATION

The policy parameters θ of the actor network is updated by ensuring that it can output the action with the largest Q value at state s t , i.e., a * = arg max a Q ϕ (s t , a). Mathematically,

EQUATION

Algorithm 1 Actor-Critic Algorithm for Learning Rate Learning

Require: Training steps T ; training set X; loss function f ; state function χ; discount factor: γ ; Ensure: Model parameters w, policy parameters θ of the actor network, and value parameters ϕ of the critic network; 1: Initial parameters ω 0 , θ 0 , ϕ 0 ; 2: for t = 0, ..., T do

3: Sample x i ∈ X, i ∈ 1, ..., N . 4:

Extract state vector: s t i = χ(ω t , x i ).

5::

//Actor network selects an action.

6::

Computes learning rate a t i = π θ (s t i ).

7::

//Update model parameters ω.

8::

Compute ∇f t (x i ).

9::

Update ω: ω t+1 = ω t -a t i ∇f t (x i ).

10:

//Update critic network by minimizing square error between estimation and label.

11:

r t = f t (x i ) -f t+1 (x i ) 12:

Extract state vector:

s t+1 i = χ(ω t+1 , x i ) 13: Compute Q ϕ (s t+1 i , π θ (s t+1 i )), Q ϕ (s t i , a t i ) 14:

Compute δ t according to Equation 7:

δ t = r t + γQ ϕ (s t+1 i , π θ (s t+1 i )) -Q ϕ (s t i , a t i )

15:

Update ϕ using the following gradients according to Equation 8:

∇ϕ = δ t ∇ ϕ Q ϕ (s t i , a t i ) 16:

// Update actor network 17:

Sample x j ∈ X, j ∈ 1, ..., N , j = i.

18::

Extract state vector: s t+1 j = χ(ω t+1 , x j ).

19:

Compute a t+1 j = π θ (s t+1 j ).

20::

Update θ from Equation 9:

∇θ = ∇ θ π θ (s t+1 j )∇ a Q ϕ (s t+1 j , a t+1 j )

| a=π θ (s) 21: end for 22: return ω, θ, ϕ;

3.4. THE ALGORITHM:

The overall algorithm is shown in Algorithm 1. In each step, we sample an example (Line 3), extract the current state vector (Line 4), compute the learning rate using the actor network (Line 6), update the model (Lines 8-9), compute TD error (Lines 11-14), update the critic network (Line 15), and sample another example (Line 17) to update the actor network (Line 18-20). We would like to make some discussions about the algorithm.

First, in the current algorithm, for simplicity, we consider using only one example for model update. It is easy to generalize to a mini batch of random examples.

Second, one may notice that we use one example (e.g., x i ) for model and the critic network update, but a different example (e.g., x j ) for the actor network update. Doing so we can avoid that the algorithm will overfit on some (too) hard examples and can improve the generalization performance of the algorithm on the test set. Consider a hard example2 in a classification task. Since such an example is difficult to be classified correctly, intuitively its gradient will be large and the learning rate given by the actor network at this step will also be large. In other words, this hard example will greatly change the model, while itself is not a good representative of its category and the learning algorithm should not pay much attention to it. If we feed the same example to both the actor network and the critic network, both of them will encourage the model to change a lot to fit the example, consequently resulting in oscillation of the training, as shown in our experiments. By feeding different examples to the actor and critic networks, it is very likely the critic network will find that the gradient direction of the example fed into the actor network is inconsistent with its own training example and thus criticize the large learning rate suggested by the actor network. More precisely, the update of ω is based on x i and the learning rate suggested by the actor network, while the training target of the actor network is to maximize the output of the critic network on x j . If there is big gradient disagreement between x i and x j , the update of ω, which is affected by actor's decision, would cause the critic's output on x j to be small. To compensate this effect, the actor network is forced to predict a small learning rate for a too hard x i in this situation.

4. EXPERIMENTS:

We conducted a set of experiments to test the performance of our learning rate learning algorithm and compared with several baseline methods. We report the experimental results in this section. We specified our actor-critic algorithm in experiments as follows. Given that stochastic mini-batch training is a common practice in deep learning, the actor-critic algorithm also operated on minibatches, i.e., each step is a mini batch in our experiments. We defined the state s t = χ(ω t , X i ) as the average loss of learning model ω t on the input min-batch X i . We specified the actor network as a two-layer long short-term memory (LSTM) network with 20 units in each layer, considering that a good learning rate for step t depends on and correlates with the learning rates at previous steps while LSTM is well suited to model sequences with long-distance dependence. We used the absolute value activation function for the output layer of the LSTM to ensure a positive learning rate. The LSTM was unrolled for 20 steps during training. We specified the critic network as a simple neural network with one hidden layer and 10 hidden units. We use Adam with the default setting in TensorFlow optimizer toolbox Abadi et al. (2015) to train the actor and critic networks in all the experiments. We compared our method with several mainstream SGD algorithms, including SGD, Adam Kingma & Ba (2014 ), Adagrad Duchi et al. (2011) and RMSprop Tieleman & Hinton (2012) . For each of these algorithms and each dataset, we tried the following learning rates 10 -4 , 10 -3 , ..., 10 0 . We report the best performance of these algorithms over those learning rates. If an algorithm needs some other parameters to set, such as decay coefficients for Adam, we used the default setting in TensorFlow optimizer toolbox. For each benchmark and our proposed method, five independent runs are averaged and reported in all of the following experiments.

4.2. RESULTS ON MNIST:

MNIST is a dataset for handwritten digit classification task. Each example in the dataset is a 28 × 28 black and white image containing a digit in {0, 1, ML algorithm is consist of two convolutional layers, each followed by a pooling layer, and finally a fully connected layer. The first convolutional layer filters each input image using 32 kernels of size 5 × 5. The max-pooling layer following the first convolutional layer is performed over 2 × 2 pixel windows, with stride 2. The second convolutional layer takes the outputs of the first max-pooling layer as inputs and filters them with 64 kernels of size 5 × 5. The max-pooling layer following the second convolutional layer is performed over 2 × 2 pixel windows, with stride 2. The outputs of second max pooling layer are fed to a fully connected layer with 512 neurons. Dropout was conducted on the fully connect layer with a dropout rate of 0.5. ReLU activation functions are used in the CNN model. There are 60,000 training images and 10,000 test images in this dataset. We scaled the pixel values to the [0,1] range before inputting to all the algorithms. Each mini batch contains 50 randomly sampled images.

Figure 2 shows the results of our actor-critic algorithm for learning rate learning and the baseline methods, including the curves of training loss, test loss, and test accuracy. The final accuracies of these methods are summarized in Table 1 . We have the following observations.

• In terms of training loss, our algorithm has similar convergence speed to the baseline methods. One may expect that our algorithm should have significantly faster convergence speed considering that our algorithm learns both the learning rate and the CNN model while the baselines only learn the CNN model and choose the learning rates per some predefined rules. However, this is not correct. As discussed in Section 3.4, we carefully design the algorithm and feed different samples to the actor network and critic network. Doing so we can focus more on generalization performance than training loss: as shown in Figure 4 , our algorithm achieves the best test accuracy. • Our algorithm achieves the lowest error rate on MNIST. Although the improvement looks small, we would like to point out that given that the accuracy of CNN is already close to 100%, it is a very difficult task to further improve accuracy, not to mention that we only changed learning rate policy without changing the CNN model.

4.3. RESULTS ON CIFAR-10:

CIFAR-10 is a dataset consisting of 60000 natural 32 × 32 RGB images in 10 classes: 50,000 imagesfor training and 10,000 for test. We used a CNN with 2 convolutional layers (each followed by max-pooling layer) and 2 fully connected layers for this task. There is a max pooling layer which performed over 2 × 2 pixel windows, with stride 2 after each convolutional layer. All convolutional layers filter the input with 64 kernels of size 5 × 5. The outputs of the second pooling layer are fed to a fully connected layer with 384 neurons. The last fully connected layer has 192 neurons. Before inputting an image to the CNN, we subtracted the per-pixel mean computed over the training set from each image.

Figure 3 shows the results of all the algorithms on CIFAR-10, including the curves of training loss, the test loss and test accuracy. Table 2 shows the final test accuracy. We get similar observations as MNIST: our algorithm achieves similar convergence speed in terms of training loss and slightly better test accuracy than baselines. Figure 5 shows the learning rate learned by our method on CIFAR-10. To further understand the generalization performance of our algorithm, we ran all the As can be seen from the figure, those baseline methods are easy to overfit and their test loss increases after 5000 steps (mini batches). In contrast, our algorithm is relatively robust and can prevent overfitting to some extent.

As we explained in Section 3.4, feeding different examples to the actor and critic networks is important to guarantee generalization ability. Here we conducted another experiment to verify our intuitive explanation. Figure 6 shows the results of two different implementations of our actor-critic algorithm on CIFAR-10. In the first implementation, we fed the sample examples to the two net- works, i.e., x i = x j in the algorithm, and in the second implementation, the input x j of the critic network is different from the input x i of the actor network. It is easy to see from the figure that setting x i = x j tends to oscillate during training and leads to poor test performance. Thus, we need to feed different training data to the actor network and the critic network to ensure the performance of the algorithm.

4.4. COMPARISON WITH OTHER ADAPTIVE LEARNING RATE METHOD:

We also compare our method with "vSGD" from previous by work Schaul et al. (2013) , which can automatically adjust learning rates to minimize the expected error. This method tries to compute learning rate at each update by optimizing the expected loss after the next update according to the square norm of the expectation of the gradient, and the expectation of the square norm of the gradient. Note that our method learns to predict a learning rate at each time step by utilizing the long term reward predicted by a critic network.

For a fair comparison, we followed the experiments settings of Schaul et al. (2013) , which designed three different network architectures for MNIST task to measure the performance. The first one is denoted by 'M0' which is simple softmax regression (i.e. a network with no hidden layer). The second one ('M1') is a fully connected multi-layer perceptron, with a single hidden layer. The third one (denoted 'M2') is a deep, fully connected multi-layer perceptron with two hidden layers. The vSGD has three variants in their paper. We referred to the results reported in their paper and compared our method with all of three variants of their algorithm (vSGD-l, vSGD-b, vSGD-g).

The learning rates of SGD are decreased according to a human designed schedule, and the hyperparameters of SGD, ADAM, Adagrad, RMSprop are carefully determined by their lowest test error among a set of hyper-parameters. All hyper-parameters can be found in Schaul et al. (2013) .

The experimental results are reported in Table 3 . It shows that our proposed method performs better than vSGD and other baseline methods, and is stable across different network architectures.

5. CONCLUSIONS AND FUTURE WORK:

In this work, we have studied how to automatically learn learning rates for gradient based machine learning methods and proposed an actor-critic algorithm, inspired by the recent success of reinforcement learning. The experiments on two image classification datasets have shown that our method (1) has comparable convergence speed with expert-designed optimizer while achieving better test accuracy, and (2) can successfully adjust learning rate for different datasets and CNN model structures.

For the future work, we will explore the following directions. In this work, we have applied our algorithm to control the learning rates of SGD. We will apply to other variants of SGD methods. We have focused on learning a learning rate for all the model parameters. We will study how to learn an individual learning rate for each parameter. We have considered learning learning rates using RL techniques. We will consider learning other hyperparameters such as step-dependent dropout rates for deep neural networks.

A APPENDIX:

A method of automatically controlling learning rate is proposed in the main body of the paper. The learning rate controller adjusts itself during training to control the learning rate. Here, we propose an improved version that can leverage experiences from several repeated training runs to learn a fixed learning rate controller. Empirically, this algorithm can achieve better performance than the previous one. Given that it requires more time for training the learning rate controller, this method is more suitable for training offline models.

In this algorithm, during every training run, we fix the actor network and compute the weighted sum of the gradients of its parameter θ. The parameter is updated after each run (modified from Equation 9): 

∇θ = Σ T t=1 h(t)∇ θ π θ (s t+1 )∇ a Q ϕ (

:

Here we have two learning algorithms. We call the one with learning rate to adjust as the primary M-L algorithm, and the other one which optimizes the learning rate of the primary one as the secondary ML algorithm.

For example, an example may has an incorrect label because of the limited quality of labelers.

Figures and Tables:

Figure 1: The framework of our proposed automatic learning rate controller.

EXPERIMENTAL SETUP We tested our method on two widely used image classification datasets: MNIST LeCun et al. (1998) and CIFAR-10 Krizhevsky & Hinton (2009). Convolutional neural networks (CNNs) are the standard model for image classification tasks in recent years, and thus the primary ML algorithm adopted the CNN model in all our experiments.

Figure 3: Results on CIFAR10. (a) Training loss. (b) Test loss. (c) Test accuracy. The x-axis is the number of mini batches.

Figure 4: Results on CIFAR-10 with 20% training data. (a) Training loss. (b) Test loss.

Figure 6: Results on CIFAR-10 with 20% training data. (a) Training loss. (b) Test loss. Our algorithm with x i = x j is shown with blue line, and Our algorithm with x i = x j is shown orange line.

Reinforcement learningSutton (1988) is concerned with how an agent acts in a stochastic environment by sequentially choosing actions over a sequence of time steps, in order to maximize a cumulative reward. In RL, a state s t encodes the agents observation about the environment at a time step t, and a policy function π(s t ) determines how the agent behaves (e.g., which action to take) at state s t . An action-value function (or, Q function) Q π (s t , a t ) is usually used to denote the cumulative reward of taking action a t at state s t and then following policy π afterwards. Recently, deep reinforcement learning, which uses deep neural networks to approximate/represent the policy function and/or the value function, have shown promise in various domains, including Atari games Mnih et al. (2015), Go Silver et al. (2016), machine translation Bahdanau et al. (2016), image recognition Xu et al. (2015), etc.

Table content: <table><tr><td>Many RL algorithms have been proposed Sutton &amp; Barto (1998); Watkins &amp; Dayan (1992), and</td></tr><tr><td>many RL algorithms Sutton (1984); Sutton et al. (1999); Barto et al. (1983); Silver et al. (2014) can</td></tr><tr><td>be described under the actor-critic framework. An actor-critic algorithm learns the policy function</td></tr><tr><td>and the value function simultaneously and interactively. The policy structure is known as the actor,</td></tr><tr><td>and is used to select actions; the estimated value function is known as the critic, and it criticizes the</td></tr><tr><td>actions made by the actor.</td></tr></table>

• • • , 9}. The CNN model used in the primary

Table content: <table><tr><td>0.1</td><td/><td/><td/><td/><td/><td colspan="2">0.075</td><td/><td/><td/><td/><td/><td/><td>0.995</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.08</td><td/><td/><td/><td/><td/><td colspan="2">0.065</td><td/><td/><td/><td/><td/><td/><td>0.9925</td><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>0.99</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.06</td><td/><td/><td/><td/><td/><td colspan="2">0.055</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>0.9875</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.04</td><td/><td/><td/><td/><td/><td colspan="2">0.045</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>0.985</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.02</td><td/><td/><td/><td/><td/><td colspan="2">0.035</td><td/><td/><td/><td/><td/><td/><td>0.9825</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0</td><td/><td/><td/><td/><td/><td colspan="2">0.025</td><td/><td/><td/><td/><td/><td/><td>0.98</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0</td><td>2000</td><td>4000</td><td>6000</td><td>8000</td><td>10000</td><td>12000</td><td>0</td><td>2000</td><td>4000</td><td>6000</td><td>8000</td><td>10000</td><td>12000</td><td>0</td><td>2000</td><td>4000</td><td>6000</td><td>8000</td><td>10000</td><td>12000</td></tr><tr><td>SGD</td><td/><td>ADAM</td><td>Adagrad</td><td>RMSprop</td><td colspan="2">Our method</td><td>SGD</td><td>ADAM</td><td/><td>Adagrad</td><td>RMSprop</td><td colspan="2">Our method</td><td>SGD</td><td/><td>ADAM</td><td>Adagrad</td><td>RMSprop</td><td colspan="2">Our method</td></tr><tr><td/><td/><td/><td>(a)</td><td/><td/><td/><td/><td/><td/><td>(b)</td><td/><td/><td/><td/><td/><td/><td>(c)</td><td/><td/><td/></tr><tr><td colspan="21">Figure 2: Results on MNIST. (a) Training loss. (b) Test loss. (c) Test accuracy. The x-axis is the</td></tr><tr><td colspan="6">number of mini batches.</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td>1.4</td><td/><td/><td/><td/><td/><td>1.1</td><td/><td/><td/><td/><td/><td/><td/><td>0.8</td><td/><td/><td/><td/><td/><td/></tr><tr><td>1.2</td><td/><td/><td/><td/><td/><td>1</td><td/><td/><td/><td/><td/><td/><td/><td>0.79</td><td/><td/><td/><td/><td/><td/></tr><tr><td>1</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td>0.9</td><td/><td/><td/><td/><td/><td/><td/><td>0.78</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.8</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td/><td/><td>0.8</td><td/><td/><td/><td/><td/><td/><td/><td>0.77</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.6</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td>0.4</td><td/><td/><td/><td/><td/><td>0.7</td><td/><td/><td/><td/><td/><td/><td/><td>0.76</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0.2</td><td/><td/><td/><td/><td/><td>0.6</td><td/><td/><td/><td/><td/><td/><td/><td>0.75</td><td/><td/><td/><td/><td/><td/></tr><tr><td>0</td><td>20000</td><td colspan="2">40000</td><td>60000</td><td>80000</td><td>100000</td><td>0</td><td>20000</td><td>40000</td><td>60000</td><td/><td>80000</td><td>100000</td><td>10000</td><td>25000</td><td>40000</td><td>55000</td><td>70000</td><td>85000</td><td>100000</td></tr><tr><td>SGD</td><td/><td>ADAM</td><td>Adagrad</td><td>RMSprop</td><td colspan="2">Our method</td><td>SGD</td><td>ADAM</td><td colspan="2">Adagrad</td><td>RMSprop</td><td colspan="2">Our method</td><td>SGD</td><td/><td>ADAM</td><td>Adagrad</td><td>RMSprop</td><td colspan="2">Our method</td></tr><tr><td/><td/><td/><td>(a)</td><td/><td/><td/><td/><td/><td/><td>(b)</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>

Error rate comparison on MNIST.

Table content: <table><tr><td>Optimizer</td><td>Error Rate (%)</td></tr><tr><td>SGD</td><td>0.75</td></tr><tr><td>ADAM</td><td>0.87</td></tr><tr><td>Adagrad</td><td>0.94</td></tr><tr><td>RMSprop</td><td>0.83</td></tr><tr><td>Our method</td><td>0.67</td></tr></table>

Classification Accuracy on CIFAR-10.

Table content: <table><tr><td>Optimizer</td><td>Accuracy</td></tr><tr><td>SGD</td><td>78.74</td></tr><tr><td>ADAM</td><td>77.46</td></tr><tr><td>Adagrad</td><td>78.46</td></tr><tr><td>RMSprop</td><td>62.3</td></tr><tr><td>Our method</td><td>79.34</td></tr></table>

Error rate of different methods on different network architectures.

Table content: <table><tr><td>Network</td><td colspan="8">Methods SGD ADAM Adagrad RMSprop vSGD-l vSGD-b vSGD-g Our method</td></tr><tr><td>M0</td><td>7.60</td><td>8.70</td><td>7.52</td><td>10.91</td><td>7.50</td><td>7.89</td><td>8.20</td><td>7.50</td></tr><tr><td>M1</td><td>2.34</td><td>4.12</td><td>2.70</td><td>6.17</td><td>2.42</td><td>2.44</td><td>4.14</td><td>2.04</td></tr><tr><td>M2</td><td>2.15</td><td>3.85</td><td>2.34</td><td>3.81</td><td>2.16</td><td>2.05</td><td>3.65</td><td>2.03</td></tr></table>

s t+1 , a t+1 )| a=π θ (s) . (10) h(t) is weighted function which is used to amplify the feedback signal from the initial training stage. It is defined as h(t) = 1/t in our experiments. An error rate of 0.48% was achieved with 5 repeated training runs in MNIST experiment (the same setting as Table1), and in CIFAR-10 experiment (the same setting as Table2), 80.23% accuracy was achieved with 10 training runs. This method showed better performance in both experiments.

Table content: <table/>

Peer review (iclr2017):
The authors present a method for adaptively setting the step size for SGD by treating the learning rate as an action in an MDP whose reward is the change in loss function. The method is presented against popular adaptive first-order methods for training deep networks (Adagrad, Adam, RMSProp, etc). The results are interesting but difficult to assess in a true apples-to-apples manner. Some specific comments: -What is the computational overhead of the actor-critic algorithm relative to other algorithms? No plots with the wall-time of optimization are presented, even though the success of methods like Adagrad was due to their wall-time performance, not the number of iterations. -Why was only a single learning rate learned? To accurately compare against other popular first order methods, why not train a separate RL model for each parameter, similar to how popular first-order methods adaptively change the learning rate for each parameter. -Since learning is a non-stationary process, while RL algorithms assume a stationary environment, why should we expect an RL algorithm to work for learning a learning rate? -In figure 6, how does the proposed method compare to something like early stopping? It may be that the actor-critic method is overfitting less simply because it is worse at optimization.