Title: ADVERSARIAL AUTOAUGMENT

Abstract: Data augmentation (DA) has been widely utilized to improve generalization in training deep neural networks. Recently, human-designed data augmentation has been gradually replaced by automatically learned augmentation policy. Through finding the best policy in well-designed search space of data augmentation, Au-toAugment (Cubuk et al., 2019) can significantly improve validation accuracy on image classification tasks. However, this approach is not computationally practical for large-scale problems. In this paper, we develop an adversarial method to arrive at a computationally-affordable solution called Adversarial AutoAugment, which can simultaneously optimize target related object and augmentation policy search loss. The augmentation policy network attempts to increase the training loss of a target network through generating adversarial augmentation policies, while the target network can learn more robust features from harder examples to improve the generalization. In contrast to prior work, we reuse the computation in target network training for policy evaluation, and dispense with the retraining of the target network. Compared to AutoAugment, this leads to about 12× reduction in computing cost and 11× shortening in time overhead on ImageNet. We show experimental results of our approach on CIFAR-10/CIFAR-100, ImageNet, and demonstrate significant performance improvements over state-of-the-art. On CIFAR-10, we achieve a top-1 test error of 1.36%, which is the currently best performing single model. On ImageNet, we achieve a leading performance of top-1 accuracy 79.40% on ResNet-50 and 80.00% on ResNet-50-D without extra data.

1. INTRODUCTION:

Massive amount of data have promoted the great success of deep learning in academia and industry. The performance of deep neural networks (DNNs) would be improved substantially when more supervised data is available or better data augmentation method is adapted. Data augmentation such as rotation, flipping, cropping, etc., is a powerful technique to increase the amount and diversity of data. Experiments show that the generalization of a neural network can be efficiently improved through manually designing data augmentation policies. However, this needs lots of knowledge of human expert, and sometimes shows the weak transferability across different tasks and datasets in practical applications. Inspired by neural architecture search (NAS) (Zoph & Le, 2016; Zoph et al., 2017; Zhong et al., 2018a; b; Guo et al., 2018) , a reinforcement learning (RL) (Williams, 1992) method called AutoAugment is proposed by Cubuk et al. (2019) , which can automatically learn the augmentation policy from data and provide an exciting performance improvement on image classification tasks. However, the computing cost is huge for training and evaluating thousands of sampled policies in the search process. Although proxy tasks, i.e., smaller models and reduced datasets, are taken to accelerate the searching process, tens of thousands of GPU-hours of consumption are still required. In addition, these data augmentation policies optimized on proxy tasks are not guaranteed to be optimal on the target task, and the fixed augmentation policy is also sub-optimal for the whole training process. The overview of our proposed method. We formulate it as a Min-Max game. The data of each batch is augmented by multiple pre-processing components with sampled policies {τ 1 , τ 2 , • • • , τ M }, respectively. Then, a target network is trained to minimize the loss of a large batch, which is formed by multiple augmented instances of the input batch. We extract the training losses of a target network corresponding to different augmentation policies as the reward signal. Finally, the augmentation policy network is trained with the guideline of the processed reward signal, and aims to maximize the training loss of the target network through generating adversarial policies.

In this paper, we propose an efficient data augmentation method to address the problems mentioned above, which can directly search the best augmentation policy on the full dataset during training a target network, as shown in Figure 1 . We first organize the network training and augmentation policy search in an adversarial and online manner. The augmentation policy is dynamically changed along with the training state of the target network, rather than fixed throughout the whole training process like normal AutoAugment (Cubuk et al., 2019) . Due to reusing the computation in policy evaluation and dispensing with the retraining of the target network, the computing cost and time overhead are extremely reduced. Then, the augmentation policy network is taken as an adversary to explore the weakness of the target network. We augment the data of each min-batch with various adversarial policies in parallel, rather than the same data augmentation taken in batch augmentation (BA) (Hoffer et al., 2019) . Then, several augmented instances of each mini-batch are formed into a large batch for target network learning. As an indicator of the hardness of augmentation policies, the training losses of the target network are used to guide the policy network to generate more aggressive and efficient policies based on REINFORCE algorithm (Williams, 1992) . Through adversarial learning, we can train the target network more efficiently and robustly.

The contributions can be summarized as follows:

• Our method can directly learn augmentation policies on target tasks, i.e., target networks and full datasets, with a quite low computing cost and time overhead. The direct policy search avoids the performance degradation caused by the policy transfer from proxy tasks to target tasks.

• We propose an adversarial framework to jointly optimize target network training and augmentation policy search. The harder samples augmented by adversarial policies are constantly fed into the target network to promote robust feature learning. Hence, the generalization of the target network can be significantly improved.

• The experiment results show that our proposed method outperforms previous augmentation methods. For instance, we achieve a top-1 test error of 1.36% with PyramidNet+ShakeDrop (Yamada et al., 2018) on CIFAR-10, which is the state-of-the-art performance. On Ima-geNet, we improve the top-1 accuracy of ResNet-50 (He et al., 2016) from 76.3% to 79.4% without extra data, which is even 1.77% better than AutoAugment (Cubuk et al., 2019) .

2. RELATED WORK:

Common data augmentation, which can generate extra samples by some label-preserved transformations, is usually used to increase the size of datasets and improve the generalization of networks, such as on MINST, CIFAR-10 and ImageNet (Krizhevsky et al., 2012; Wan et al., 2013; Szegedy et al., 2015) . However, human-designed augmentation policies are specified for different datasets.

For example, flipping, the widely used transformation on CIFAR-10/CIFAR-100 and ImageNet, is not suitable for MINST, which will destroy the property of original samples.

Hence, several works (Lemley et al., 2017; Cubuk et al., 2019; Lin et al., 2019; Ho et al., 2019) have attempted to automatically learn data augmentation policies. Lemley et al. (2017) propose a method called Smart Augmentation, which merges two or more samples of a class to improve the generalization of a target network. The result also indicates that an augmentation network can be learned when a target network is being training. Through well designing the search space of data augmentation policies, AutoAugment (Cubuk et al., 2019) takes a recurrent neural network (RNN) as a sample controller to find the best data augmentation policy for a selected dataset. To reduce the computing cost, the augmentation policy search is performed on proxy tasks. Population based augmentation (PBA) (Ho et al., 2019) replaces the fixed augmentation policy with a dynamic schedule of augmentation policy along with the training process, which is mostly related to our work. Inspired by population based training (PBT) (Jaderberg et al., 2017) , the augmentation policy search problem in PBA is modeled as a process of hyperparameter schedule learning. However, the augmentation schedule learning is still performed on proxy tasks. The learned policy schedule should be manually adjusted when the training process of a target network is non-matched with proxy tasks.

Another related topic is Generative Adversarial Networks (GANs) (Goodfellow et al., 2014) , which has recently attracted lots of research attention due to its fascinating performance, and also been used to enlarge datasets through directly synthesizing new images (Tran et al., 2017; Perez & Wang, 2017; Antoniou et al., 2017; Gurumurthy et al., 2017; Frid-Adar et al., 2018) . Although we formulate our proposed method as a Min-Max game, there exists an obvious difference with traditional GANs. We want to find the best augmentation policy to perform image transformation along with the training process, rather than synthesize new images. Peng et al. (2018) also take such an idea to optimize the training process of a target network in human pose estimation.

3. METHOD:

In this section, we present the implementation of Adversarial AutoAugment. First, the motivation for the adversarial relation between network learning and augmentation policy is discussed. Then, we introduce the search space with the dynamic augmentation policy. Finally, the joint framework for network training and augmentation policy search is presented in detail.

3.1. MOTIVATIONS:

Although some human-designed data augmentations have been used in the training of DNNs, such as randomly cropping and horizontally flipping on CIFAR-10/CIFAR-100 and ImageNet, limited randomness will make it very difficult to generate effective samples at the tail end of the training.

To struggle with the problem, more randomness about image transformation is introduced into the search space of AutoAugment (Cubuk et al., 2019) (described in Section 3.2). However, the learned policy is fixed for the entire training process. All of possible instances of each example will be send to the target network repeatedly, which still results in an inevitable overfitting in a long-epoch training. This phenomenon indicates that the learned policy is not adaptive to the training process of a target network, especially found on proxy tasks. Hence, the dynamic and adversarial augmentation policy with the training process is considered as the crucial feature in our search space.

Another consideration is how to improve the efficiency of the policy search. In AutoAugment (Cubuk et al., 2019) , to evaluate the performance of augmentation policies, a lot of child models should be trained from scratch nearly to convergence. The computation in training and evaluating the performance of different sampled policies can not be reused, which leads to huge waste of computation resources. In this paper, we propose a computing-efficient policy search framework through reusing prior computation in policy evaluation. Only one target network is used to evaluate the performance of different policies with the help of the training losses of corresponding augmented 

3.2. SEARCH SPACE:

In this paper, the basic structure of the search space of AutoAugment (Cubuk et al., 2019) is reserved. An augmentation policy is defined as that it is composed by 5 sub-policies, each sub-policy contains two image operations to be applied orderly, each operation has two corresponding parameters, i.e., the probability and magnitude of the operation. Finally, the 5 best policies are concatenated to form a single policy with 25 sub-policies. For each image in a mini-batch, only one sub-policy will be randomly selected to be applied. To compare with AutoAugment (Cubuk et al., 2019) conveniently, we just slightly modify the search space with removing the probability of each operation. This is because that we think the stochasticity of an operation with a probability requires a certain epochs to take effect, which will detain the feedback of the intermediate state of the target network.

There are totally 16 image operations in our search space, including ShearX/Y, TranslateX/Y, Rotate, AutoContrast, Invert, Equalize, Solarize, Posterize, Contrast, Color, Brightness, Sharpness, Cutout (Devries & Taylor, 2017) and Sample Pairing (Inoue, 2018) . The range of the magnitude is also discretized uniformly into 10 values. To guarantee the convergence during adversarial learning, the magnitude of all the operations are set in a moderate range.1 Besides, the randomness during the training process is introduced into our search space. Hence, the search space of the policy in each epoch has |S| = (16×10) 10 ≈ 1.1×10 22 possibilities. Considering the dynamic policy, the number of possible policies with the whole training process can be expressed as |S| #epochs . An example of dynamically learning the augmentation policy along with the training process is shown in Figure 2 . We observe that the magnitude (an indication of difficulty) gradually increases with the training process.

3.3. ADVERSARIAL LEARNING:

In this section, the adversarial framework of jointly optimizing network training and augmentation policy search is presented in detail. We use the augmentation policy network A(•, θ) as an adversary, which attempts to increase the training loss of the target network F(•, w) through adversarial learning. The target network is trained by a large batch formed by multiple augmented instances of each batch to promote invariant learning (Salazar et al., 2018) , and the losses of different augmentation policies applied on the same data are used to train the augmentation policy network by RL algorithm.

Considering the target network F(•, w) with a loss function L[F(x, w), y], where each example is transformed by some random data augmentation o(•), the learning process of the target network can be defined as the following minimization problem

EQUATION

where Ω is the training set, x and y are the input image and the corresponding label, respectively.

The problem is usually solved by vanilla SGD with a learning rate η and batch size N , and the training procedure for each batch can be expressed as

EQUATION

To improve the convergence performance of DNNs, more random and efficient data augmentation is performed under the help of the augmentation policy network. Hence, the minimization problem should be slightly modified as

EQUATION

where τ (•) represents the augmentation policy generated by the network A(•, θ). Accordingly, the training rule can be rewritten as

EQUATION

where we introduce M different instances of each input example augmented by adversarial policies

{τ 1 , τ 2 , • • • , τ M }.

For convenience, we denote the training loss of a mini-batch corresponding to the augmentation policy τ m as

EQUATION

Hence, we have an equivalent form of Equation 4

EQUATION

Note that the training procedure can be regarded as a larger N • M batch training or an average over M instances of gradient computation without changing the learning rate, which will lead to a reduction of gradient variance and a faster convergence of the target network Hoffer et al. (2019) . However, overfitting will also come. To overcome the problem, the augmentation policy network is designed to increase the training loss of the target network with harder augmentation policies. Therefore, we can mathematically express the object as the following maximization problem

θ * = arg max θ J(θ),

where

EQUATION

Similar to AutoAugment (Cubuk et al., 2019) , the augmentation policy network is also implemented as a RNN shown in Figure 3 . At each time step of the RNN controller, the softmax layer will Figure 3 : The basic architecture of the controller for generating a sub-policy, which consists of two operations with corresponding parameters, the type and magnitude of each operation. When a policy contains Q sub-policies, the basic architecture will be repeated Q times. Following the setting of AutoAugment (Cubuk et al., 2019) , the number of sub-policies Q is set to 5 in this paper.

predict an action corresponding to a discrete parameter of a sub-policy, and then an embedding of the predicted action will be fed into the next time step. In our experiments, the RNN controller will predict 20 discrete parameters to form a whole policy.

However, there has a severe problem in jointly optimizing target network training and augmentation policy search. This is because that non-differentiable augmentation operations break gradient flow from the target network F to the augmentation policy network A (Wang et al., 2017; Peng et al., 2018) . As an alternative approach, REINFORCE algorithm (Williams, 1992 ) is applied to optimize the augmentation policy network as

EQUATION

where p m represents the probability of the policy τ m . To reduce the variance of gradient ∇ θ J(θ), we replace the training loss of a mini-batch L m with L m a moving average over a certain minibatches2 , and then normalize it among M instances as L m . Hence, the training procedure of the augmentation policy network can be expressed as

EQUATION

The adversarial learning of target network training and augmentation policy search is summarized as Algorithm 1.

4. EXPERIMENTS AND ANALYSIS:

In this section, we first reveal the details of experiment settings. Then, we evaluate our proposed method on CIFAR-10/CIFAR-100, ImageNet, and compare it with previous methods. Results in Figure 4 show our method achieves the state-of-the-art performance with higher computing and time efficiency3 . Initialize L m = 0, ∀m ∈ {1, 2, • • • , M };

3:

Generate M policies with the probabilities {p 1 , p 2 , • • • , p M };

4:

for 1 ≤ t ≤ T do 5:

Augment each batch data with M generated policies, respectively;

6:

Update w e,t+1 according to Equation 4; 7:

Update L m through moving average, ∀m ∈ {1, 2, • • • , M };

8: Collect { L 1 , L 2 , • • • , L M }; 9: Normalize L m among M instances as L m , ∀m ∈ {1, 2, • • • , M }; 10:

Update θ e+1 via Equation 9; 11: Output w * , θ *

4.1. EXPERIMENT SETTINGS:

The RNN controller is implemented as a one-layer LSTM (Hochreiter & Schmidhuber, 1997) . We set the hidden size to 100, and the embedding size to 32. We use Adam optimizer (Kingma & Ba, 2015) with a initial learning rate 0.00035 to train the controller. To avoid unexpected rapid convergence, an entropy penalty of a weight of 0.00001 is applied. All the reported results are the mean of five runs with different initializations.

4.2. EXPERIMENTS ON CIFAR-10 AND CIFAR-100:

CIFAR-10 dataset (Krizhevsky & Hinton, 2009) has totally 60000 images. The training and test sets have 50000 and 10000 images, respectively. Each image in size of 32 × 32 belongs to one of 10 classes. We evaluate our proposed method with the following models: Wide-ResNet-28-10 (Zagoruyko & Komodakis, 2016), Shake-Shake (26 2x32d) (Gastaldi, 2017) , Shake-Shake (26 2x96d) (Gastaldi, 2017) , Shake-Shake (26 2x112d) (Gastaldi, 2017) , PyramidNet+ShakeDrop (Han et al., 2017; Yamada et al., 2018) . All the models are trained on the full training set.

Training details: The Baseline is trained with the standard data augmentation, namely, randomly cropping a part of 32 × 32 from the padded image and horizontally flipping it with a probability of 0.5. The Cutout (Devries & Taylor, 2017) randomly select a 16 × 16 patch of each image, and then set the pixels of the selected patch to zeros. For our method, the searched policy is applied in addition to standard data augmentation and Cutout. For each image in the training process, standard data augmentation, the searched policy and Cutout are applied in sequence. For Wide-ResNet-28-10, the step learning rate (LR) schedule is adopted. The cosine LR schedule is adopted for the other models. More details about model hyperparameters are supplied in A.1.

Choice of M : To choose the optimal M , we select Wide-ResNet-28-10 as a target network, and evaluate the performance of our proposed method verse different M , where M ∈ {2, 4, 8, 16, 32}.

From Figure 5 , we can observe that the test accuracy of the model improves rapidly with the increase of M up to 8. The further increase of M does not bring a significant improvement. Therefore, to balance the performance and the computing cost, M is set to 8 in all the following experiments.

CIFAR-10 results::

In Table 1 , we report the test error of these models on CIFAR-10. For all of these models, our proposed method can achieve better performance compared to previous methods. We achieve 0.78% and 0.68% improvement on Wide-ResNet-28-10 compared to AutoAugment and PBA, respectively. We achieve a top-1 test error of 1.36% with PyramidNet+ShakeDrop, which is 0.1% better than the current state-of-the-art reported in Ho et al. (2019) . As shown in Figure 6 (a) and 6(b),we further visualize the probability distribution of the parameters of the augmentation policies learned with PyramidNet+ShakeDrop on CIFAR-10 over time. From Figure 6 (a), we can find that the percentages of some operations, such as TranslateY, Rotate, Posterize, and SampleParing, gradually increase along with the training process. Meanwhile, more geometric transformations, such as TranslateX, TranslateY, and Rotate, are picked in the sampled augmentation policies, which is different from color-focused AutoAugment (Cubuk et al., 2019) on CIFAR-10. that large magnitudes gain higher percentages during training. However, at the tail of training, low magnitudes remain considerable percentages. This indicates that our method does not simply learn the transformations with the extremes of the allowed magnitudes to spoil the target network.

CIFAR-100 results::

We also evaluate our proposed method on CIFAR-100, as shown in Table 2 . As we can observe from the table, we also achieve the state-of-the-art performance on this dataset. As a great challenge in image recognition, ImageNet dataset (Deng et al., 2009) has about 1.2 million training images and 50000 validation images with 1000 classes. In this section, we directly search the augmentation policy on the full training set and train ResNet-50 (He et al., 2016) , ResNet-50-D (He et al., 2018) and ResNet-200 (He et al., 2016) from scratch. Training details: For the baseline augmentation, we randomly resize and crop each input image to a size of 224 × 224, and then horizontally flip it with a probability of 0.5. For AutoAugment (Cubuk et al., 2019) and our method, the baseline augmentation and the augmentation policy are both used for each image. The cosine LR schedule is adopted in the training process. The model hyperparameters on ImageNet is also detailed in A.1.

ImageNet results: The performance of our proposed method on ImageNet is presented in Table 3 

4.4. ABLATION STUDY:

To check the effect of each component in our proposed method, we report the test error of ResNet-50 on ImageNet the following augmentation methods in Table 4 .

• Baseline: Training regularly with the standard data augmentation and step LR schedule.

• Fixed: Augmenting all the instances of each batch with the standard data augmentation fixed throughout the entire training process. • Random: Augmenting all the instances of each batch with randomly and dynamically generated policies. • Ours: Augmenting all the instances of each batch with adversarial policies sampled by the policy network along with the training process.

From the table, we can find that Fixed can achieve 0.99% error reduction compared to Baseline. This shows that a large-batch training with multiple augmented instances of each mini-batch can indeed improve the generalization of the model, which is consistent with the conclusion presented in Hoffer et al. (2019) . In addition, the test error of Random is 1.02% better than Fixed. This indicates that augmenting batch with randomly generated policies can reduce overfitting in a certain extent. Furthermore, our method achieves the best test error of 20.60% through augmenting samples with adversarial policies. From the result, we can conclude that these policies generated by the policy network are more adaptive to the training process, and make the target network have to learn more robust features.

4.5. COMPUTING COST AND TIME OVERHEAD:

Computing Cost: The computation in target network training is reused for policy evaluation. This makes the computing cost in policy search become negligible. Although there exists an increase of computing cost in target network training, the total computing cost in training one target network with augmentation policies is quite small compared to prior work. process of offline policy search and the retraining of a target network, which leads to a extreme time overhead reduction.

In Table 5 , we take the training of ResNet-50 on ImageNet as an example to compare the computing cost and time overhead of our method and AutoAugment. From the table, we can find that our method is 12× less computing cost and 11× shorter time overhead than AutoAugment. To further show the higher efficiency of our method, the transferability of the learned augmentation policies is evaluated in this section. We first take a snapshot of the adversarial training process of ResNet-50 on ImageNet, and then directly use the learned dynamic augmentation policies to regularly train the following models: Wide-ResNet-28-10 on CIFAR-10/100, ResNet-50-D on ImageNet and ResNet200 on ImageNet. Table 6 presents the experimental results of the transferability. From the table, we can find that a competitive performance can be still achieved through direct policy transfer. This indicates that the learned augmentation policies transfer well across datasets and architectures. However, compared to the proposed method, the policy transfer results in an obvious performance degradation, especially the transfer across datasets. 

5. CONCLUSION:

In this paper, we introduce the idea of adversarial learning into automatic data augmentation. The policy network tries to combat the overfitting of the target network through generating adversarial policies with the training process. To oppose this, robust features are learned in the target network, which leads to a significant performance improvement. Meanwhile, the augmentation policy search is performed along with the training of a target network, and the computation in network training is reused for policy evaluation, which can extremely reduce the search cost and make our method more computing-efficient.

:

The more details about the parameter setting please refer to AutoAugment(Cubuk et al.,

2019).

The length of the moving average is fixed to an epoch in our experiments.

To clearly present the advantage of our proposed method, we normalize the performance of our method in the Figure

4, and the performance of AutoAugment is plotted accordingly.

Figures and Tables:

Figure1: The overview of our proposed method. We formulate it as a Min-Max game. The data of each batch is augmented by multiple pre-processing components with sampled policies {τ 1 , τ 2 , • • • , τ M }, respectively. Then, a target network is trained to minimize the loss of a large batch, which is formed by multiple augmented instances of the input batch. We extract the training losses of a target network corresponding to different augmentation policies as the reward signal. Finally, the augmentation policy network is trained with the guideline of the processed reward signal, and aims to maximize the training loss of the target network through generating adversarial policies.

Figure 2: An example of dynamic augmentation policies learned with ResNet-50 on ImageNet. With the training process of the target network, harder augmentation policies are sampled to combat overfitting. Intuitively, more geometric transformations, such as TranslateX, ShearY and Rotate, are picked in our sampled policies, which is obviously different from AutoAugment (Cubuk et al., 2019) concentrating on color-based transformations. instances. The augmentation policy network is learned from the intermediate state of the target network, which makes generated augmentation policies more aggressive and adaptive. On the contrary, to combat harder examples augmented by adversarial policies, the target network has to learn more robust features, which makes the training more efficiently.

Figure4: The Comparison of normalized performance between AutoAugment and our method. Please refer to the following tables for more details.

Algorithm 1 Joint Training of Target Network and Augmentation Policy Network Initialization: target network F(•, w), augmentation policy network A(•, θ) Input: input examples x, corresponding labels y 1: for 1 ≤ e ≤ epochs do

Table content: <table><tr><td>2:</td></tr></table>

Top-1 test error (%) on CIFAR-10. We replicate the results of Baseline, Cutout and Au-toAugment methods from Cubuk et al. (2019), and the results of PBA from Ho et al. (2019) in all of our experiments.

Table content: <table><tr><td>Model</td><td colspan="5">Baseline Cutout AutoAugment PBA Our Method</td></tr><tr><td>Wide-ResNet-28-10</td><td>3.87</td><td>3.08</td><td>2.68</td><td>2.58</td><td>1.90±0.15</td></tr><tr><td>Shake-Shake (26 2x32d)</td><td>3.55</td><td>3.02</td><td>2.47</td><td>2.54</td><td>2.36±0.10</td></tr><tr><td>Shake-Shake (26 2x96d)</td><td>2.86</td><td>2.56</td><td>1.99</td><td>2.03</td><td>1.85±0.12</td></tr><tr><td>Shake-Shake (26 2x112d)</td><td>2.82</td><td>2.57</td><td>1.89</td><td>2.03</td><td>1.78±0.05</td></tr><tr><td>PyramidNet+ShakeDrop</td><td>2.67</td><td>2.31</td><td>1.48</td><td>1.46</td><td>1.36±0.06</td></tr><tr><td colspan="2">4.3 EXPERIMENTS ON IMAGENET</td><td/><td/><td/><td/></tr></table>

Top-1 test error (%) on CIFAR-100.

Table content: <table><tr><td>Model</td><td colspan="4">Baseline Cutout AutoAugment PBA Our Method</td></tr><tr><td>Wide-ResNet-28-10</td><td>18.80</td><td>18.41</td><td>17.09</td><td>16.73 15.49±0.18</td></tr><tr><td>Shake-Shake (26 2x96d)</td><td>17.05</td><td>16.00</td><td>14.28</td><td>15.31 14.10±0.15</td></tr><tr><td>PyramidNet+ShakeDrop</td><td>13.99</td><td>12.19</td><td>10.67</td><td>10.94 10.42±0.20</td></tr></table>

. It can be observed that we achieve a top-1 accuracy 79.40% on ResNet-50 without extra data. To the best of our knowledge, this is the highest top-1 accuracy for ResNet-50 learned on ImageNet. Besides, we only replace the ResNet-50 architecture with ResNet-50-D, and achieve a consistent improvement with a top-1 accuracy of 80.00%.

Table content: <table/>

Top-1 / Top-5 test error (%) on ImageNet. Note that the result of ResNet-50-D is achieved only through substituting the architecture.

Table content: <table><tr><td>Model</td><td>Baseline</td><td colspan="2">AutoAugment PBA</td><td>Our Method</td></tr><tr><td>ResNet-50</td><td>23.69 / 6.92</td><td>22.37 / 6.18</td><td>-</td><td>20.60±0.15 / 5.53±0.05</td></tr><tr><td colspan="2">ResNet-50-D 22.84 / 6.48</td><td>-</td><td>-</td><td>20.00±0.12 / 5.25±0.03</td></tr><tr><td>ResNet-200</td><td>21.52 / 5.85</td><td>20.00 / 4.90</td><td>-</td><td>18.68±0.18 / 4.70±0.05</td></tr></table>

Top-1 test error (%) of ResNet-50 with different augmentation methods on ImageNet.

Table content: <table><tr><td>Method</td><td colspan="4">Aug. Policy Enlarge Batch LR Schedule Test Error</td></tr><tr><td>Baseline</td><td>standard</td><td>M = 1</td><td>step</td><td>23.69</td></tr><tr><td>Fixed</td><td>standard</td><td>M = 8</td><td>cosine</td><td>22.70</td></tr><tr><td>Random</td><td>random</td><td>M = 8</td><td>cosine</td><td>21.68</td></tr><tr><td>Ours</td><td>adversarial</td><td>M = 8</td><td>cosine</td><td>20.60</td></tr></table>

The comparison of computing cost (GPU hours) and time overhead (days) in training ResNet-50 on ImageNet between AutoAugment and our method. The computing cost and time overhead are estimated on 64 NVIDIA Tesla V100s.

Table content: <table><tr><td>Method</td><td colspan="2">Computing Cost</td><td/><td colspan="2">Time Overhead</td><td/></tr><tr><td/><td colspan="6">Searching Training Total Searching Training Total</td></tr><tr><td>AutoAugment</td><td>15000</td><td>160</td><td>15160</td><td>10</td><td>1</td><td>11</td></tr><tr><td>Our Method</td><td>∼0</td><td>1280</td><td>1280</td><td>∼0</td><td>1</td><td>1</td></tr><tr><td colspan="5">4.6 TRANSFERABILITY ACROSS DATASETS AND ARCHITECTURES</td><td/><td/></tr></table>

Top-1 test error (%) of the transfer of the augmentation policies learned with ResNet-50 on ImageNet.

Table content: <table><tr><td>Method</td><td>Dataset</td><td colspan="3">AutoAugment Our Method Policy Transfer</td></tr><tr><td colspan="2">Wide-ResNet-28-10 CIFAR-10</td><td>2.68</td><td>1.90</td><td>2.45±0.13</td></tr><tr><td colspan="2">Wide-ResNet-28-10 CIFAR-100</td><td>17.09</td><td>15.49</td><td>16.48±0.15</td></tr><tr><td>ResNet-50-D</td><td>ImageNet</td><td>-</td><td>20.00</td><td>20.20±0.05</td></tr><tr><td>ResNet-200</td><td>ImageNet</td><td>20.00</td><td>18.68</td><td>19.05±0.10</td></tr></table>

Peer review (iclr2020):
This paper proposes a technique called Adversarial AutoAugment which dynamically learns good data augmentation policies during training. An adversarial approach is used: a target network tries to achieve good classification performance on a training set, while a policy network attempts to foil the target network by developing data augmentation policies that will produce images that are difficult to classify. To train the policy network, each mini-batch is augmented multiple times with different policies sampled from the policy network. Each augmented mini-batch is passed through the target network to produce a corresponding training loss, which is used as the training signal for the policy network. Experimental results are shown for CIFAR-10, CIFAR-100, and ImageNet datasets, where Adversarial AutoAugment outperforms competing methods (AutoAugment and Population Based Augmentation) on a variety of model architectures. In its current state, I would tend towards rejecting this paper. The overall structure, the figures, and the experimental results are very nice, but there are two major issues that are holding it back. First, I am skeptical that the policy network is actually learning useful policies. Secondly, there are many grammatical errors in the paper which hamper readability. Upon reading the first paragraph of the paper, my initial impression was already quite negative, simply due to the number of grammatical errors. Fixing these would strengthen the paper considerably, and I would increase my score accordingly if properly addressed. Primary Concerns: 1) One of my main concerns with this paper is this line here: *To guarantee the convergence during adversarial learning, the magnitude of all the operations are set in a moderate range*. Since the policy network has no incentive to select transformations that the target network can still learn from, I assume that the ranges are required so that the policy network cannot choose to apply extreme transformations which always fool the target network, such as setting brightness to 0 to make the entire image black. How are acceptable ranges determined? If cross validation is required, then this becomes very much like the original hand-tuning of data augmentations that we wanted to avoid in the first place. Additionally, I think it would be useful to to see a plot of the magnitude of each transformation versus training epoch, similar to Figure 4a in [1]. If the policy network simply learns to use the most extreme augmentations available in order to fool the target network, then this may indicate that the gain in performance is from tuning the magnitude ranges, and not from the policy network selecting good policies. 2) The paper could benefit greatly from some revision of the grammar. I would recommend either having a friend or colleague read it over, or even using an automated grammar checking program, such as Grammarly. For example, in the first paragraph alone there are several sentences that could be improved: *Massive amount of data promotes the great success* -> *Massive amounts of data have promoted the great success* *when more supervised data available* -> *when more supervised data is available* *or better data augmentation method adapted* -> *or a better data augmentation method is adopted* *which can automated learn* -> *which can automatically learn* *there still requires tens of thousands of GPU-hours consumption.* -> *tens of thousands of GPU-hours of computation are still required* Things to improve the paper that did not impact the score: 3) In the first paragraph it is claimed that data augmentation policies have weak transferability across different tasks and datasets. I do not fully agree with this claim, since papers such as AutoAugment [2] have shown that learned policies are highly transferable to new datasets, and augmentation strategies such as CutMix have been shown to be highly effective for a variety of tasks. 4) No citation for the original GAN paper, despite multiple mentions of adversarial learning, and GANs themselves. 5) There is no computation time comparison with PBA, which is about 1000x faster than Autoaugment, and therefore roughly 100x faster than Adversarial AutoAugment. 6) CIFAR-10 results are not necessarily state-of-the-art. The 1.36% error rate claimed by the paper is surpassed by work in [3], which achieved 1.33% using a combination of AutoAugment and mixup. 7) Citation for the CIFAR-10 dataset incorrectly refers to the Adam optimizer paper [4]. References: [1] Daniel Ho, Eric Liang, Ion Stoica, Pieter Abbeel, and Xi Chen. Population based augmentation: Efficient learning of augmentation policy schedules. ICML, 2019. [2] Cubuk, Ekin D., Barret Zoph, Dandelion Mane, Vijay Vasudevan, and Quoc V. Le. *Autoaugment: Learning augmentation policies from data.* CVPR (2019). [3] Wistuba, Martin, Ambrish Rawat, and Tejaswini Pedapati. *A Survey on Neural Architecture Search.* arXiv preprint arXiv:1905.01392 (2019). [4] Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. ICLR, 2015 EDIT: The authors have addressed the majority of my concerns, and as such I have increased my score from a 3 to a 6.