DARTS-: R OBUSTLY S TEPPING OUT OF P ERFORMANCE C OLLAPSE W ITHOUT I NDICATORS
A BSTRACT
Despite the fast development of differentiable architecture search (DARTS), it suffers from long-standing performance instability, which extremely limits its application.
Existing robustifying methods draw clues from the resulting deteriorated behavior instead of ﬁnding out its causing factor.
Various indicators such as Hessian eigenvalues are proposed as a signal to stop searching before the performance collapses.
However, these indicator-based methods tend to easily reject good architectures if the thresholds are inappropriately set, let alone the searching is intrinsically noisy.
In this paper, we undertake a more subtle and direct approach to resolve the collapse.
We ﬁrst demonstrate that skip connections have a clear advantage over other candidate operations, where it can easily recover from a disadvantageous state and become dominant.
We conjecture that this privilege is causing degenerated performance.
Therefore, we propose to factor out this beneﬁt with an auxiliary skip connection, ensuring a fairer competition for all operations.
We call this approach DARTS-.
Extensive experiments on various datasets verify that it can substantially improve robustness.
Our code is available at https://github.com/Meituan-AutoML/DARTS- .
I NTRODUCTION
Recent studies (Zela et al., 2020; Liang et al., 2019; Chu et al., 2020b) have shown that one critical issue for differentiable architecture search (Liu et al., 2019b) regarding the performance collapse due to superﬂuous skip connections.
Accordingly, some empirical indicators for detecting the occurrence of collapse have been produced.
R-DARTS (Zela et al., 2020) shows that the loss landscape has more curvatures (characterized by higher Hessian eigenvalues w.r.t.
architectural weights) when the derived architecture generalizes poorly.
By regularizing for a lower Hessian eigenvalue, Zela et al.
(2020); Chen & Hsieh (2020) attempt to stabilize the search process.
Meanwhile, by directly constraining the number of skip connections to a ﬁxed number (typically 2), the collapse issue becomes less pronounced (Chen et al., 2019b; Liang et al., 2019).
These indicator-based approaches have several main drawbacks.
Firstly, robustness relies heavily on the quality of the indicator.
An imprecise indicator either inevitably accepts poor models or mistakenly reject good ones.
Secondly, indicators impose strong priors by directly manipulating the inferred model, which is somewhat suspicious, akin to touching the test set.
Thirdly, extra computing cost (Zela et al., 2020) or careful tuning of hyper-parameters (Chen et al., 2019b; Liang et al., 2019) are required.
Therefore, it’s natural to ask the following questions:
• Can we resolve the collapse without handcrafted indicators and restrictions to interfere with the searching and/or discretization procedure?
• Is it possible to achieve robustness in DARTS without tuning extra hyper-parameters?
[Figure]
To answer the above questions, we propose an effective and efﬁcient approach to stabilize
DARTS.
Our contributions can be summarized as follows:
New Paradigm to Stabilize DARTS.
While empirically observing that current indicators (Zela et al., 2020; Chen & Hsieh, 2020) can avoid performance collapse at a cost of reduced exploration coverage in the search space, we propose a novel indicator-free approach to stabilize DARTS, referred to as DARTS- 1 , which involves an auxiliary skip connection (see Figure 1) to remove the unfair advantage (Chu et al., 2020b) in the searching phase.
Strong Robustness and Stabilization.
We conduct thorough experiments across seven search spaces and three datasets to demonstrate the effectiveness of our method.
Speciﬁcally, our approach robustly obtains state-of-the-art results on 4 search space with 3 × fewer search cost than R-DARTS
(Zela et al., 2020), which requires four independent runs to report the ﬁnal performance.
Seamless Plug-in Combination with DARTS Variants.
We conduct experiments to demonstrate that our approach can work together seamlessly with other orthogonal DARTS variants by removing their handcrafted indicators without extra overhead.
In particular, our approach is able to improve 0 .
8% accuracy for P-DARTS, and 0 .
25% accuracy for PC-DARTS on CIFAR-10 dataset.
R ELATED W ORK
Neural architecture search and DARTS variants.
Over the years, researchers have sought to automatically discover neural architectures for various deep learning tasks to relieve human from the tedious effort, ranging from image classiﬁcation (Zoph et al., 2018), objection detection (Ghiasi et al., 2019), image segmentation (Liu et al., 2019a) to machine translation (So et al., 2019) etc.
Among many proposed approaches, Differentiable Architecture Search (Liu et al., 2019b) features weight-sharing and resolves the searching problem via gradient descent, which is very efﬁcient and easy to generalize.
A short description of DARTS can be found in A.1.
Since then, many subsequent works have been dedicated to accelerating the process (Dong & Yang, 2019b), reducing memory cost (Xu et al., 2020), or fostering its ability such as hardware-awareness (Cai et al., 2019; Wu et al., 2019), ﬁner granularity (Mei et al., 2020) and so on.
However, regardless of these endeavors, a fundamental issue of DARTS over its searching performance collapse remains not properly solved, which extremely prohibits its application.
Robustifying DARTS.
As DARTS (Liu et al., 2019b) is known to be unstable as a result of performance collapse (Chu et al., 2020b), some recent works have devoted to resolving it by either designing indicators like Hessian eigenvalues for the collapse (Zela et al., 2020) or adding perturbations to regularize such an indicator (Chen & Hsieh, 2020).
Both methods rely heavily on the indicator’s accurateness, i.e., to what extent does the indicator correlate with the performance collapse?
Other methods like Progressive DARTS (Chen et al., 2019b) and DARTS+ (Liang et al., 2019) employ a strong human prior, i.e., limiting the number of skip-connections to be a ﬁxed value.
Fair DARTS
(Chu et al., 2020b) argues that the collapse results from the unfair advantage in an exclusive competitive environment, from which skip connections overly beneﬁt to cause an abundant aggregation.
To suppress such an advantage from overshooting, they convert the competition into collaboration where each operation is independent of others.
It is however an indirect approach.
SGAS (Li et al., 2020), instead, circumvents the problem with a greedy strategy where the unfair advantage can be prevented from taking effect.
Nevertheless, potentially good operations might be pruned out too early because of greedy underestimation.
DARTS3. M OTIVATION
We start from the detailed analysis of the role of skip connections.
Skip connections were proposed to construct a residual block in ResNet (He et al., 2016), which signiﬁcantly improves training stability.
It is even possible to deepen the network up to hundreds of layers without accuracy degradation by simply stacking them up.
In contrast, stacking the plain blocks of VGG has degenerated performance when the network gets deeper.
Besides, Ren et al. (2015); Wei et al.
; Tai et al.
(2017); Li et al.
(2018b) also empirically demonstrate that deep residual network can achieve better performance on various tasks.
From the gradient ﬂow’s perspective, skip connection is able to alleviate the gradient vanishing problem.
Given a stack of n residual blocks, the output of the ( i + 1) th residual block
X i +1 can be computed as X i +
=
f
i +
( X i , W i +1 )
+ X i , where f i +1 denotes the operations of the ( i + 1) th residual block with weights
W i +1 .
Suppose the loss function of the model is L , and the gradient of
X i can be obtained as follows ( 1 denotes a tensor whose items are all ones):
[Equation]
We observe that the gradient of shallow layers always includes the gradient of deep layers, which mitigates the gradient vanishing of W i .
Formally we have,
[Equation]
To analyze how skip connect affects the performance of residual networks, we introduce a trainable coefﬁcient β on all skip connections in ResNet.
Therefore, the gradient of X i is converted to:
[Equation]
Once β < 1 , gradients of deep layers gradually vanish during the back-propagation (BP) towards shallow layers.
Here β controls the memory of gradients in BP to stabilize the training procedure.
[Figure]
The residual structure is proved to learn a large β to ease training in all three cases.
All models are trained and tested on CIFAR-10.
We conduct a conﬁrmatory experiment on ResNet and show the result in Fig 2.
By initializing β with { 0 , 0 . 5 , 1 . 0 } , we can visualize the tendency of β along with training epochs.
We observe that β converges towards 1 after 40 epochs no matter the initialization, which demonstrates that the residual structure learns to push β to a rather large value to alleviate gradient vanishing.
Similarly, DARTS (Liu et al., 2019b) utilizes a trainable parameter β skip to denote the importance of skip connection.
However, In the search stage, β skip can generally increase and dominate the architecture parameters, and ﬁnally leads to performance collapse.
We analyze that a large β skip in DARTS could result from two aspects:
On the one hand, as the supernet automatically learns to alleviate gradient vanishing, it pushes β skip to a proper large value; On the other hand, the skip connection is indeed an important connection for the target network, which should be selected in the discretization stage.
As a consequence, the skip connection in DARTS plays two-fold roles: as an auxiliary connection to stabilize the supernet training , and as a candidate operation to build the ﬁnal network .
Inspired by the above observation and analysis, we propose to stabilize the search process by distinguishing the two roles of skip connection and handling the issue of gradient ﬂow.
3. S TEPPING OUT OF THE P ERFORMANCE C OLLAPSE
To distinguish the two roles, we introduce an auxiliary skip connection between every two nodes in a cell, see Fig.
1 (b).
On the one hand, the ﬁxed auxiliary skip connection carries the function of stabilizing the supernet training, even when β skip is rather small.
On the other hand, it also breaks the unfair advantage (Chu et al., 2020b) as the advantageous contribution from the residual block is factored out.
Consequently, the learned architectural parameter β skip can be freed from the role of controlling the memory of gradients, and is more precisely aimed to represent the relative importance of skip connection as a candidate operation.
In contrast to Eq.
7, the output feature map of edge e ( i,j ) can now be obtained by Eq. 4, where β i,jo =
[Equation]
denotes the normalized importance, and β is a coefﬁcient independent from the architecture parameters.
Moreover, to eliminate the impact of auxiliary connection on the discretization procedure, we propose to decrease β to 0 in the search phase, and our method can be degenerated to standard DARTS at the end of the search.
Note that our method is not insensitive to the type of decay strategy, so we choose linear decay by default for simplicity.
[Equation]
We then analyze how the auxiliary skip connection handles the issue of gradient ﬂow.
Referring to the theorem of a recent work by Zhou et al.
(2020), the convergence of network weight W in the supernet can heavily depend on β skip .
Speciﬁcally, suppose only three operations (none, skip connection, and convolution) are included in the search space and MSE loss is utilized as training loss, when architecture parameters β oi,j are ﬁxed to optimize W via gradient descent, training loss can decrease by ratio ( 1 − ηλ/ 4 ) at one step with probability at least 1 − δ , where η is the learning rate that should be bounded by δ , and λ follows Eq. [Equation]
[Equation]
where h is the number of layers of the supernet.
From Eq.
5, we observe that λ relies much on β skip than β conv , which indicates that the network weights W can converge faster with a large β skip .
However, by involving an auxiliary skip connection weighted as β , Eq. 5 can be reﬁned as follows:
[Equation] [Equation]
Algorithm
Require:
Network weights w ; Architecture parameters α ;
Number of search epochs E ;
Decay strategy for β e , e ∈ { 1 , 2 , ..., E } .
Ensure:
Searched architecture parameters α .
1: Construct a super-network by stacking cells in which there is an auxiliary skip connection between every two nodes of choice 2: for each e ∈ [1 , E ] do 3:
Update weights w by ∇ w L train ( w, α, β e ) 4:
Update parameters α by ∇ α L val ( w, α, β e ) 5: end for 6: Derive the ﬁnal architecture based on learned α from the best validation supernet.
where β (cid:29) β skip making λ insensitive to β skip , so that the convergence of network weights W depends more on β conv .
In the beginning of the search, the common value for β skip is 0.15 while β is 1.0.
From the view of convergence theorem (Zhou et al., 2020), the auxiliary skip connection alleviates the privilege of β skip and equalize the competition among architecture parameters.
Even when β gradually decays, the fair competition still holds since network weights W have been converged to an optimal point.
Consequently, DARTS- is able to stabilize the search stage of DARTS.
Extensive experiments are performed to demonstrate the efﬁciency of the proposed auxiliary skip connection, and we emphasize that our method is ﬂexible to combine with other methods to further improve the stabilization and searching performance.
The overall algorithm is given in Alg.
3. R ELATIONSHIP TO P RIOR W ORK
Our method is aimed to address the performance collapse in differentiable neural architecture search.
Most previous works (Zela et al., 2020; Chen & Hsieh, 2020; Liang et al., 2019) concentrate on developing various criteria or indicators characterizing the occurrence of collapse.
Whereas, we don’t study or rely on these indicators because they can mistakenly reject good models.
Inspired by Chu et al.
(2020b)
, our method focuses on calibrating the biased searching process.
The underlying philosophy is simple: if the biased process is rectiﬁed, the searching result will be better.
In summary, our method differs from others in two aspects: being process-oriented and indicator-free.
Distinct from Chu et al.
(2020b) that tweaks the competitive environment, our method can be viewed as one that breaks the unfair advantage.
Moreover, we don’t introduce any handcrafted indicators to represent performance collapse, thus greatly reducing the burden of shifting to different tasks.
E XPERIMENTS 4. S EARCH S PACES AND T RAINING S ETTINGS
For searching and evaluation in the standard DARTS space (we name it as S0 for simplicity), we keep the same settings as in DARTS (Liu et al., 2019b).
We follow R-DARTS (Zela et al., 2020) for their proposed reduced spaces S1- S4 (harder than S0).
However, the inferred models are trained with two different settings from R-DARTS (Zela et al., 2020) and SDARTS (Chen & Hsieh, 2020).
The difference lies in the number of layers and initial channels for evaluation on CIFAR-100.
RDARTS sets 8 layers and 16 initial channels.
Instead, SDARTS uses 20 and 36 respectively.
For the proxyless searching on ImageNet, we instead search in MobileNetV2-like search space (we name it
S5 ) proposed in FBNet (Wu et al., 2019).
We use the SGD optimizer for weight and Adam ( β 1 = 0 .and
β 2 = 0 .
999 , 0.001 learning rate) for architecture parameters with the batch-size of 768.
The initial learning rate is 0.045 and decayed to 0 within 30 epochs following the cosine schedule.
We also use L2 regularization with 1e-4.
It takes about 4.5 GPU days on Tesla V100.
More details are provided in the appendix.
We also use NAS-Bench-201 ( S6 ) since DARTS performs severely bad.
In total, we use 7 different search spaces to conduct the experiments, which involves three datasets.
4. S EARCHING R ESULTS
[Table]
CIFAR-10 and CIFAR-100.
Following the settings of R-DARTS (Zela et al., 2020), we obtain an average top-1 accuracy of 97 .
36% on CIFAR-10, as shown in Table 2.
Moreover, our method is very robust since out of six independent runs the searching results are quite stable.
The best cells found on
CIFAR-10 ( 97 . 5% ) are shown in Figure 9 (B).
Results on CIFAR-100 are presented in Table 10 (see
A.2.1).
Moreover, our method has a much lower searching cost ( 3 × less ) than R-DARTS
(Zela et al., 2020), where four independent searches with different regularization settings are needed to generate the best architecture.
In other words, its robustness comes from the cost of more CO 2 emissions
ImageNet.
To further verify the efﬁciency of DARTS-, we directly search on ImageNet in S and compare our results with the state-of-the-art models under the mobile setting in Table 2.
The visualization of the architecture is given in Fig 10.
DARTS-A obtains 76.2 % top-1 accuracy on the
ImageNet validation dataset.
By contrast, direct applying DARTS on this search space only obtains 66 .
4% (Chu et al., 2020b).
Moreover, it obtains 77.8 % top-1 accuracy after being equipped with auto-augmentation (Cubuk et al., 2019) and squeeze-and-excitation (Hu et al., 2018), which are also used in EfﬁcientNet.
NAS-Bench-201.
Apart from standard search spaces, benchmarking with known optimal in a limited setting is also recommended.
NAS-Bench-201 (Dong & Yang, 2020) consists of 15,625 architectures in a reduced DARTS-like search space, where it has 4 internal nodes and 5 operations per node.
We compare our method with prior work in Table 3.
We search on CIFAR-10 and look up the ground-truth performance with found genotypes on various test sets.
Remarkably, we achieve a new state of the art, the best of which almost touches the optimal.
[Table]
(Dong & Yang, 2020).
Our method robustly obtains
[Table]
Transfer results on objection detection We further evaluate the transfer-ability of our models on down-stream object detection task by replacing the backbone of RetinaNet (Lin et al., 2017) on
MMDetection toolbox platform (Chen et al., 2019a).
Speciﬁcally, with the same training setting as
Chu et al. (2020b), our model achieves 32.5% mAP on the COCO dataset, surpassing other similarsized models such as MobileNetV3, MixNet, and FairDARTS.
The detailed results are shown in
Appendix (Table 11).
4. O RTHOGONAL C OMBINATION WITH O THER V ARIANTS
Our method can be ﬂexibly adapted to combine with prior work for further improvements.
Here we investigate the joint outcome with two methods: P-DARTS and PC-DARTS.
[Table]
Progressive DARTS (P-DARTS).
P-DARTS
(Chen et al., 2019b) proposes a progressive approach to search gradually with deeper depths while pruning out the uncompetitive paths.
Additionally, it makes use of some handcrafted criteria to address the collapse (the progressive idea itself cannot deal with it), for instance, they impose two strong priors by regularizing the number of skip connections M as 2 as well as dropout.
To be fair, we remove such a carefully handcrafted trick and run P-DARTS for several [Table] times.
As a natural control group, we also combine DARTS- with P-DARTS.
We run both experiments for 3 times on CIFAR-10 dataset in Table 4.
Without the strong priors, P-DARTS severely suffers from the collapse, where the inferred models contain an excessive number of skip connections.
Speciﬁcally, it has a very high test error ( 3 .
42% on average), even worse than DARTS.
However, P-DARTS can beneﬁt greatly from the combination with DARTS-.
The improved version (we call P-DARTS-) obtains much higher top-1 accuracy ( +0.8% ) on CIFAR-10 than its baseline.
[Table]
Memory Friendly DARTS (PC-DARTS).
To alleviate the large memory overhead from the whole supernet, PC-DARTS (Xu et al., 2020) selects the partial channel for searching.
The proportion hyperparameter K needs careful calibration to achieve a good result for speciﬁc tasks.
As a byproduct, the search time is also reduced to 0.1 GPU days ( K =4).
We use their released code and run repeated experiments across different seeds under the same settings.
To accurately evaluate the role of our method, we choose K =2 (a bad conﬁguration in the original paper).
We make comparisons between the original PC-DARTS and its combination with ours (named PC-DARTS-) in Table 5.
PC-DARTS- can marginally boost the CIFAR-10 top-1 accuracy (+ 0 .
26% on average).
The result also conﬁrms that our method can make PC-DARTS less sensitive to its hyper-parameter K while keeping its advantage of less memory cost and run time.
4. A BLATION S TUDY
Robustness to Decay Strategy.
Our method is insensitive to the type of decay policy on β .
We design extra two strategies as comparisons: cosine and step decay.
They both have the similar performance.
Speciﬁcally, when β is scheduled to zero by the cosine strategy, the average accuracy of four searched CIFAR-10 models in S3 is 97.33% ± 0.09, the best is 97.47%.
The step decay at epoch 45 obtains 97 .
30% top-1 accuracy on average in the same search space.
[Table]
Robustness Comparison on C10 and C100 in S0-S4.
To verify the robustness, it is required to search several times to report the average performance of derived models (Yu et al., 2020; Antoine et al., 2020).
As shown in Table 1, Tableand Table 7, our method outperforms the recent SOTAs across several spaces and datasets.
Note that SDARTS-ADV utilizes adversarial training and requires 3 × more search times than ours.
Especially, we ﬁnd a good model in S 3 on CIFARwith the lowest top-1 test error 15 .
The architectures of these models can be found in the appendix.
Sensitivity Analysis of β
The power of the auxiliary skip connection branch can be discounted by setting a lower initial β .
We now evaluate how sensitive our approach is to the value of β .
It’s trivial to see that our approach degrades to DARTS when β = 0 .
We compare results when searching with β ∈ { 1 , 0 . 7 , 0 .
1 , 0 } in Table 6, which show that a bigger β 0 is advantageous to obtain better networks.
The choice of auxiliary branch Apart from the default skip connection serving as the auxiliary branch, we show that it is also effective to replace it with a learnable 1 × 1 convolution projection, which is initialized with an identity tensor.
The average accuracy of three searched CIFARmodels in S3 is 97.25% ± 0.09.
Akin to the ablation in He et al.
(2016), the projection convolution here works in a similar way as the proposed skip connection.
This proves the necessity of the auxiliary branch.
Performance with longer epochs.
It is claimed by Bi et al.
(2019) that much longer epochs lead to better convergence of the supernet, supposedly beneﬁcial for inferring the ﬁnal models.
However, many of DARTS variants fail since their ﬁnal models are full of skip connections.
We thus evaluate how our method behaves in such a situation.
Speciﬁcally, we extend the standard 50 epochs to 150,
and we search 3 independent times each for S0, S2 and S3.
Due to the longer epochs, we slightly change our decay strategy, we keep β = 1 all the way until for last 50 epochs we decay β to 0.
Other hyper-parameters are kept unchanged.
The results are shown in Table 8 and the found genotypes are listed in Figure 17, 18, 19, 20 and 21.
It indicates that DARTS- doesn’t suffer from longer epochs since it has reasonable values for # P compared with those ( # P = 0 ) investigated by Bi et al.
Notice S2 and S3 are harder cases where DARTS suffers more severely from the collapse than S0.
As a result, DARTS- can successfully survive longer epochs even in challenging search spaces.
Noticeably, it is still unclear whether longer epochs can truly boost searching performance.
Although we achieve a new state-of-the-art result in S2 where the best model has 2.50% error rate (previously 2.63%), it still has worse average performance (2.71 ± 0.11%) in S0 than the models searched with 50 epochs (2.59 ± 0.08%), and the best model in S3 (2.53%) is also weaker than before (2.42%).
[Table]
Besides, compared with ﬁrst-order DARTS with a cost of 0.4 GPU days in S0, Amended-DARTS (Bi et al., 2019), particularly designed to survive longer epochs, reports 1.7 GPU days even with pruned edges in S0.
Our approach has the same cost as ﬁrst-order DARTS, which is more efﬁcient.
A NALYSIS AND D ISCUSSIONS 5. F AILURE OF H ESSIAN E IGENVALUE
The maximal Hessian eigenvalue calculated from the validation loss w.r.t α is regarded as an indicator of performance collapse (Zela et al., 2020; Chen & Hsieh, 2020).
Surprisingly, our method develops a growing eigenvalue in the majority of conﬁgurations, which conﬂicts with the previous observations.
We visualize these statistics across different search space and datasets in Figure(A.2.2).
Although eigenvalues increase almost monotonously and reach a relatively large value in the end, the ﬁnal models still have good performance that matches with state-of-the-art ones (see Table 9).
These models can be mistakenly deemed as bad ones or never visited according to the eigenvalue criteria.
Our observations disclose one fatal drawback of these indicator-based approaches: they are prone to rejecting good models .
Further analysis can be found in A.2.2.
5. V ALIDATION A CCURACY L ANDSCAPE
Recent works, R-DARTS (Zela et al., 2020) and SDARTS (Chen & Hsieh, 2020) point that the architectural weights are expected to converge to an optimal point where accuracy is insensitive to perturbations to obtain a stable architecture after the discretization process,
i
[Figure]
e., the convergence point should have a smooth landscape.
SDARTS proposes a perturbation-based regularization [Figure] which further stabilizes the searching process of DARTS.
However, the perturbation regularization disturbs the training procedure and thus misleads the update of architectural weights.
Different from
SDARTS that explicitly smooths landscape by perturbation, DARTS- can implicitly do the same without directly perturbing architectural weights.
[Figure]
[Figure]
0 .(c)
DARTS 1. [Figure] [Figure] [Figure]
[Figure] [Figure] [Figure] [Figure]
[Figure]
) DARTS-
To analyze the efﬁcacy of DARTS-, we plot the validation accuracy landscape w.r.t architectural weights α , and ﬁnd that auxiliary connection smooths the landscape and thus stabilizes the searching stage.
Speciﬁcally, we choose two random directions and apply normalized perturbation on α (following Li et al. 2018a).
As shown in Figure 3, DARTS- is less sensitive to the perturbation than
DARTS, and the contour map of DARTS- descends more gently.
C ONCLUSION
We propose a simple and effective approach named DARTS- to address the performance collapse in differentiable architecture search.
Its core idea is to make use of an auxiliary skip connection branch to take over the gradient advantage role from the candidate skip connection operation.
This can create a fair competition where the bi-level optimization process can easily differentiate good operations from the bad.
As a result, the search process is more stable and the collapse seldom happens across various search spaces and different datasets.
Under strictly controlled settings, it steadily outperforms recent state-of-the-art RobustDARTS (Zela et al., 2020) with 3 × fewer search cost.
Moreover, our method disapproves of various handcrafted regularization tricks.
Last but not least, it can be used stand-alone or in cooperation with various orthogonal improvements if necessary.
This paper conveys two important messages for future research.
On the one hand, the Hessian eigenvalue indicator for performance collapse (Zela et al., 2020; Chen & Hsieh, 2020) is not ideal because it has a risk of rejecting good models.
On the other hand, handcraft regularization tricks (Chen et al., 2019b) seem more critical to search a good model instead of the proposed methods.
Then what’s the solution?
In principle, it’s difﬁcult to ﬁnd a perfect indicator of the collapse.
Our approach shows the potential to control the search process and doesn’t impose limitations or priors on the ﬁnal model.
We hope more attention be paid in this direction.
A CKNOWLEDGEMENT
This research was supported by Meituan.
A A PPENDIX A. P RELIMINARY ABOUT DARTS
In differentiable architecture search (Liu et al., 2019b), a cell-based search space in the form of Directed Acyclic Graph (DAG) is constructed.
The DAG has two input nodes from the previous layers, four intermediate nodes, and one output node.
There are several paralleling operators (denoted as
O ) between each two nodes (say i , j ), whose output ¯ o ( i,j ) given an input x is deﬁned as,
[Equation]
i
[Equation]
It is essentially applying softmax over all operators where each operator is assigned with an architectural weight α .
A supernet is built on two kinds of such cells, so-called normal cells and reduction cells (for down-sampling).
The architectural search is then characterized as a bi-level optimization:
[Equation] [Equation]
This indicates that the training of such a cell-based supernet should be interleaved, where at each step the network weights and architectural weights are updated iteratively.
The ﬁnal model is determined by simply choosing operations with the largest architectural weights.
A. E XPERIMENT A.2. T RAINING D ETAILS
CIFAR-10 and CIFAR-100.
Table 9 gives the averaged performance in reduced search spaces
S1-S4, as well with maximum eigenvalues.
Table 10 reports the CIFAR-100 results in S0.
S
S et al., 2020)
CIFAR- CIFAR-
We report the mean retrained from alongside with eigenvalue (EV) that corresponds to the best validation accuracy.
We follow the same settings as Zela et al.
[Table]
ImageNet classiﬁcation.
For training on ImageNet, we use the same setting as MnasNet (Tan et al., 2019).
To be comparable with EfﬁcientNet (Tan & Le, 2019), we also use squeeze-and-excitation (Hu et al., 2018).
Furthermore, we don’t include methods trained using large model distillation, because it can boost ﬁnal validation accuracy marginally.
To be fair, we don’t use the efﬁcient head in MobileNetV3 (Howard et al., 2019) although it can reduce FLOPs marginally.
COCO object detection.
All models are trained and evaluated on MS COCO dataset for 12 epochs with a batch size of 16.
The initial learning rate is 0.01 and reduced by 0.1 at epoch 8 and 11.
A.2. F URTHER D ISCUSSIONS ON F AILURE OF E IGEN V ALUE
To further explore the relationship between the searching performance and Hessian Eigenvalue, we plot the performance trajectory of the searched models in Figure 4 (b).
Speciﬁcally, we sample
[Table] [Table]
models every 10 epochs and train these models from scratch using the same setting as above (Figure 5).
The performance of the inferred models continues growing, where the accuracy is boosted from 96 .
5% to 97 .
This afﬁrms the validity of searching using our method.
In contrast, the early-stopping strategies based on eigenvalues (Zela et al., 2020) would fail in this setting.
We argue that the proposed auxiliary skip branch can regularize the overﬁtting of the supernet, leaving the architectural weights to represent the ability of candidate operations.
This experiment poses as a counterexample to R-DARTS, where good models can appear albeit Hessian eigenvalues change fast.
It again denies the need for a costly indicator.
[Figure]
[Figure]
[Figure]
A.2. M ORE A BLATION S TUDIES
To supplement the sensitivity analysis in Section 4.
[Figure]
Figure 6 shows the training loss curve when initializing β with different values.
[Figure]
A. L OSS L ANDSCAPE
To show the consistent smoothing capacity of DARTS-
[Figure]
we draw more loss landscapes in S0 and
S3 (on several seeds) w.r.t architectural parameters and their contours in Figure 7 and 8.
Generally,
DARTS-’s slopes are more inﬂated if we consider them as camping tents
[Figure]
which suggest better convergence of the over-parameterized network
. A. L IST OF E XPERIMENTS
We summarize all the conducted experiments with their related ﬁgures and tables in Table 12.
B F IGURES OF G ENOTYPES
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
870 0 .(d)
DARTS
[Figure] [Figure]
(f) DARTS1.00 0.75 0.50 0.25 0.00 0.25 0.50 0.75 1.00 1.00 0.
830 0 .0 .0 .0 .(g)
DARTS1.00 0.75 0.50 0.25 0.00 0.25 0.50 0.75 1.00 1.00 0.
860 0 .(h) DARTS-
[Figure]
DARTS
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure]
860 0 .(h) DARTS-
[Table]
Search Space
Dataset
Figures
Tables
Main text
Supp.
Main text
Supp.
[Table]
S
CIFAR-
[Table]
CIFAR-
[Table]
CIFAR4,5,9, 1,
[Table]
CIFAR4,6,
[Table]
[Table] [Table]
ImageNet 5,
[Table]
MS COCO
[Table]
CIFAR-
[Table]
CIFAR4,
[Table]
CIFAR4, 1,
[Table]
CIFAR-
[Table]
CIFAR-
[Table]
CIFAR-
[Table]
CIFAR-
[Figure] [Figure]
[Figure] [Figure]
ᵏ⁻
[Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure]
on CIFAR-10 dataset.
[Figure] [Figure]