T RIPLE -S EARCH : D IFFERENTIABLE J OINT -S EARCH OF N ETWORKS , P RECISION , AND A CCELERATORS
Anonymous authors
Paper under double-blind review
A BSTRACT
The record-breaking performance and prohibitive complexity of deep neural networks (DNNs) have ignited a substantial need for customized DNN accelerators which have the potential to boost DNN acceleration efﬁciency by orders-ofmagnitude.
While it has been recognized that maximizing DNNs’ acceleration efﬁciency requires a joint design/search for three different yet highly coupled aspects, including the networks, adopted precision, and their accelerators, the challenges associated with such a joint search have not yet been fully discussed and addressed.
First, to jointly search for a network and its precision via differentiable search, there exists a dilemma of whether to explode the memory consumption or achieve sub-optimal designs.
Second, a generic and differentiable joint search of the networks and their accelerators is non-trivial due to (1) the discrete nature of the accelerator space and (2) the difﬁculty of obtaining operation-wise hardware cost penalties because some accelerator parameters are determined by the whole network.
To this end, we propose a Triple-Search (TRIPS) framework to address the aforementioned challenges towards jointly searching for the network structure, precision, and accelerator in a differentiable manner, to efﬁciently and effectively explore the huge joint search space.
Our TRIPS addresses the ﬁrst challenge above via a heterogeneous sampling strategy to achieve unbiased search with constant memory consumption, and tackles the latter one using a novel co-search pipeline that integrates a generic differentiable accelerator search engine.
Extensive experiments and ablation studies validate that both TRIPS generated networks and accelerators consistently outperform state-of-the-art (SOTA) designs (including co-search/exploration techniques, hardware-aware NAS methods, and DNN accelerators), in terms of search time, task accuracy, and accelerator efﬁciency.
All codes will be released upon acceptance.
I NTRODUCTION
The powerful performance and prohibitive complexity of deep neural networks (DNNs) have fueled a tremendous demand for efﬁcient DNN accelerators which could boost DNN acceleration efﬁciency by orders-of-magnitude (Chen et al., 2016).
In response, extensive research efforts have been devoted to developing DNN accelerators.
Early works decouple the design of efﬁcient DNN algorithms and their accelerators.
On the algorithms level, pruning, quantization, or neural architecture search (NAS) are adopted to trim down the model complexity; On the hardware level, various FPGA-/ASIC-based accelerators have been developed to customize the micro-architectures (e.g., processing elements dimension, memory sizes, and network-on-chip design) and algorithm-to-hardware mapping methods (e.g., loop tiling strategies and loop orders) in order to optimize the acceleration efﬁciency for a given DNN.
Later, hardware-aware NAS (HA-NAS) has been developed to further improve DNNs’ acceleration efﬁciency for different applications (Tan et al., 2019).
More recently, it has been recognized that (1) optimal DNN accelerators require a joint consideration/search for all the following different yet coupled aspects, including DNNs’ network structure, the adopted precision, and their accelerators’ micro-architecture and mapping methods, and (2) merely exploring a subset of these aspects will lead to sub-optimal designs in terms of hardware efﬁciency or task accuracy.
For example, the optimal accelerators for networks with different structures (e.g., width, depth, and kernel size) can be very different; while the optimal networks and their bitwidths for different accelerators can differ a lot (Wu et al., 2019).
However, the direction of jointly designing or searching for all the three aspects has only been slightly touched on previously.
For example, (Chen et al., 2018; Gong et al., 2019; Wang et al., 2020) proposed to jointly search for the structure and precision of DNNs for a ﬁxed target hardware; (Abdelfattah et al., 2020; Yang et al., 2020;
Jiang et al., 2020a;b) made the ﬁrst attempt to jointly search for the networks and their accelerators, yet either their network or accelerator choices are limited due to the prohibitive time cost required by their adopted reinforcement learning (RL) based methods; and EDD (Li et al., 2020) contributed a pioneering effort towards this direction by formulating a differentiable joint search framework, which however only consider one single accelerator parameter (i.e., parallel factor) and more importantly, has not yet fully solved the challenges of such joint search.
Although differentiable search is one of the most promising ways in terms of search efﬁciency to explore the huge joint search space as discussed in Sec. 4.2, plethora of challenges exist to achieve an effective generic joint search for the aforementioned three aspects.
First, Challenge 1: to jointly search for a network and its precision via differentiable search, there exists a dilemma whether to activate all the paths during search.
On one hand, the required memory consumption can easily explode and thus constrain the search’s scalability to more complex tasks if all paths are activated; on the other hand, partially activating a subset of the paths can lead to a sequential training of different precision on the same weights, which might result in inaccurate accuracy ranking among different precision as discussed in (Jin et al., 2020).
Second, Challenge 2: the accelerators’ parameters are not differentiable, and it is non-trivial to derive the operation-wise hardware-cost penalty in order to perform differentiable search (in considering search efﬁciency).
This is because the optimal accelerator is often determined by the whole network instead of one speciﬁc operation/layer due to the fact that some accelerator parameters (e.g., the loop order) need to be optimized for the whole network.
In this paper, we aim to address the aforementioned challenges towards scalable generic joint search for the network, precision, and accelerator.
Speciﬁcally, we make the following contributions:
• We propose a Triple-Search (TRIPS) framework to jointly search for the network, precision, and accelerator in a differentiable manner to efﬁciently explore the huge joint search space which cannot be afforded by previous RL-based methods due to their required prohibitive search cost.
TRIPS identiﬁes and tackles the aforementioned challenges towards scalable generic joint search of the three for maximizing both the accuracy and acceleration efﬁciency.
• We develop a heterogeneous sampling strategy for simultaneous updating the weights and network structures to (1) avoid the need to sequentially train different precision and (2) achieve unbiased search with constant memory consumption,
i
e., solve the above Challenge 1.
In addition, we develop a novel co-search pipeline that integrates a differentiable hardware search engine to address the above Challenge 2.
• Extensive experiments and ablation studies validate the effectiveness of our proposed TRIPS framework in terms of the resulting search time, task accuracy, and accelerator efﬁciency, when benchmarked over state-of-the-art (SOTA) co-search/exploration techniques, HA-NAS methods, and DNN accelerators.
Furthermore, we visualize the searched accelerators by TRIPS to provide insights towards efﬁcient DNN accelerator design in Appendix.
R ELATED WORKS
Hardware-aware NAS.
Hardware-aware NAS has been proposed to automate the design of efﬁcient
DNNs.
Early works (Tan et al., 2019; Howard et al., 2019; Tan & Le, 2019) utilize RL-based NAS that requires a massive search time/cost, while recent works (Wu et al., 2019; Wan et al., 2020;
Cai et al., 2018; Stamoulis et al., 2019) explore the design space in a differentiable way (Liu et al., 2018) with much improved searching efﬁciency.
Along another direction, one-shot NAS methods (Cai et al., 2019; Guo et al., 2020; Yu et al., 2020) pretrain the supernet and directly evaluate the performances of the sub-networks in a weight sharing manner as a proxy of their independently trained performances at the cost of a longer pretrain time.
In addition, NAS has been adopted to search for quantization strategies (Wang et al., 2019; Wu et al., 2018; Cai & Vasconcelos, 2020;
Elthakeb et al., 2020) for trimming down the complexity of a given DNN.
However, these works leave unexplored the
[Figure]
hardware design space, which is a crucial enabler for DNN’s acceleration efﬁciency, thus can lead to sub
DNN accelerators.
Motivated by customized accelerators’ large potential gains, SOTA accelerators (Du et al., 2015; Chen et al., 2017) innovate micro-architectures and algorithm-to-hardware mapping methods to optimize the acceleration efﬁciency, given a DNN and the hardware speciﬁcations.
However, it is non-trivial to design an optimal accelerator as it requires cross-disciplinary knowledge in algorithm, micro-architecture, and circuit design.
SOTA accelerator design relies on either experts’ manual design, which is very time consuming or design ﬂow (Chen et al., 2005; 2009;
Rupnow et al., 2011) and DNN accelerator design automation (Wang et al., 2016; Zhang et al., 2018a;
Guan et al., 2017; Venkatesan et al., 2019;
Wang et al., 2018a; Gao et al., 2017).
As they merely explore the accelerator design space, they can result in sub-optimal solutions as compared to SOTA co-search/exploration methods and our TRIPS framework.
Co-exploration/search techniques.
Pioneering efforts have been made towards jointly searching of
DNNs and their accelerators to some extent.
For joint searching of DNNs and their precision, (Chen et al., 2018; Gong et al., 2019; Wang et al., 2020) adopt either differentiable or evolutionary algorithms yet without exploring their hardware accelerators.
For joint searching of DNNs and their accelerators, (Abdelfattah et al., 2020; Yang et al., 2020; Jiang et al., 2020a;b) conduct RL-based search for the networks and some accelerator parameters/templates, where they strictly constrain the search space of the network or accelerator to achieve a practical RL search time, limiting their scalability and achievable efﬁciency.
(Lin et al.) is another pioneering work which co-designs the newtork and accelerator in a sequential manner based on the fact that the accelerator’s design cycle is longer than the networks.
EDD (Li et al., 2020) extends differentiable NAS to search for layer-wise precision and the accelerators’ parallel factor, which is most relevant to our TRIPS.
EDD has not yet fully solved the joint search challenges.
First, it does not discuss or address the potentially explosive memory consumption issue of such joint search; second, EDD’s accelerator search space only includes the parallel factor, which can be strictly limited to their accelerator template and cannot generalize to include common accelerator parameters such as the tiling strategies.
Built upon prior art, our TRIPS targets a scalable generic joint search framework to optimally search for the network, its precision, and adopted accelerator in a differentiable manner for improving efﬁciency.
T HE P ROPOSED T ECHNIQUES
In this section, we describe our proposed techniques for enabling TRIPS, where Sec.
3.1 provides
TRIPS’s formulation, Sec. 3.2 and Sec.
3.3 introduce TRIPS’s enablers that address the key challenges of scalable generic joint search for networks, precision, and accelerators, and Sec.
3.4 uniﬁes the enablers to build a comprehensive co-search framework.
3. TRIPS: F ORMULATION
Fig.
1 shows an overview of TRIPS, which jointly searches for the networks (e.g., kernel size, channel expansion, and group number), precision (e.g., 4-/6-/8-/12-/16-bit), and the accelerators (e.g., PE array type, buffer size, and tiling strategies of each memory hierarchy) in a differentiable manner.
[Figure]
TRIPS targets a scalable yet generic joint search framework, which we formulate as a bi-level optimization problem:
[Equation]
Where α , β , and γ are the continuous variables parameterizing the probability of different choices for the network operators, precision bitwidths, and accelerator parameters as in (Liu et al., 2018), ω is the supernet weights, L train , L val , and L cost are the loss during training and validation and the hardware-cost loss, and net ( α ) , prec ( β ) , and hw ( γ ) denote the network, precision, and accelerator characterized by α , β , γ , respectively.
3. TRIPS E NABLER 1: H ETEROGENEOUS SAMPLING FOR PRECISION SEARCH
As discussed in Sec.1, there exists a dilemma (i.e., memory consumption explosion or biased search) whether to activate all the paths during precision search, for addressing which we have developed a heterogeneous sampling.
Next, we ﬁrst use real experiments to illustrate the joint search dilemma, and then introduce our heterogeneous sampling which effectively address those challenges/issues.
Activating all choices - memory explosion and entangled correlation among choices.
During precision search, activating all the precision choices as (Wu et al., 2018;
Gong et al., 2019) can easily explode the memory consumption especially when the precision is co-searched with the network structures.
While composite convolutions (Cai & Vasconcelos, 2020) for mixed precision search can mitigate this memory explosion issue during search by shrinking the required computation, yet this large memory consumption issue would still exist during training when updating the precision parameters, i.e., β in Eq.
For example, as shown in Fig.
2 (a), the measured GPU memory consumption of co-searching the network and precision on ImageNet grows linearly with the number of precision choices if activating all precision choices during search.
In addition, the entangled correlation (e.g., co-adaptation (Hong et al., 2020), correlation (Li et al., 2019), and cooperation (Tian et al., 2020)) among different precision choices leads to a large gap between the supernet during search and the ﬁnal derived network, thus failing the joint search.
[Table]
Activating only a subset of choices - Biased search.
For addressing the above issues of memory explosion and correlation among choices, one natural choice is to adopt hard
Gumbel Softmax by reducing the memory consumption, which however can lead to a biased search and thus poor performance.
Speciﬁcally, activating only a subset of the precision choices implies a sequential training of different precisions that can lead to inaccurate performance ranking.
This is because a sequential training means different precision choices are applied on top of the same weights and activations.
As a result, different precision choices can interfere with each other and different training order would lead to a different result.
For better understanding, we next show two concrete experiments.
Co-search network and precision using hard Gumbel Softmax: Fig.
2 (b) shows the resulting precision probability evolution when co-searching the network and precision on CIFAR-100 using hard
Gumbel Softmax (activating two precision choices) without imposing any hardware-cost constraints, indicating the desired precision choice would be the highest precision.
However, as shown in Fig.(b), the block co-searched using hard Gumbel Softmax collapse to the lowest precision (i.e., the highest probability towards the end of the search is the lowest precision choice 4-bit), indicating an ineffective search direction.
Note that the ﬂuctuation in the probability of different precision choices is caused by the intermittent activation of the block due to the hard Gumbel Softmax sampling.
Sequential training of a ﬁxed network with multiple precision choices: As observed in (Jin et al., 2020), when training a ﬁxed network with multiple precision choices, either ascending or descending the precision will incur an inferior convergence and thus chaotic accuracy ranking among different precision choices.
For example, as shown in Tab. 1, we compare the accuracy of a ﬁxed network (all blocks adopt the k3e1 (kernel size 3 and channel expansion 1) structure in (Wu et al., 2019)) under different precision choices, when being trained with different precision schedules, and ﬁnd that only jointly training all the precision choices can maintain the ranking consistent with that of independently trained ones, while sequential training leads to both inferior accuracy and ranking.
Proposed solution - Heterogeneous sampling.
To tackle both aspects of the aforementioned dilemma, we propose a heterogeneous sampling strategy as formulated in Eq.
(4) where ¯ W l / ¯
A l are the composite weights / activations of the l -th layer as in (Cai & Vasconcelos, 2020) which are the weighted sum of weights / activations under different precision choices, e.g., W lj is the weights quantized to the j -th precision among the total J options of the l -th layer.
In our heterogeneous sampling, for updating the weights in Eq.
(2), we jointly update the weights under all the precision choices weighted by their corresponding soft Gumbel Softmax GS ( β lj ) , where β lj parameterizes the probability of the j -th precision in the l -th layer, and the gradients can be estimated by STE (Zhou et al., 2016)
as ∂L train / ∂A l
≈ ∂L train /
∂ ¯ A l so that no extra intermediate feature maps are needed to be stored into the memory during backward.
For updating β , we adopt hard Gumbel Softmax (Jang et al., 2016) with one-hot outputs GS hard ( β lj ) to save memory and computation while reducing the correlation among precision choices.
In the same co-search setting as Fig.
2 (b), all the blocks searched using our proposed heterogeneous sampling converge to the highest precision choice towards the end of the search as shown in Fig.
2 (c).
[Equation]
3. TRIPS E NABLER 2: D IFFERENTIABLE A CCELERATOR S EARCH E NGINE
Motivation.
Although EDD (Li et al., 2020) also co-searches the accelerator with the network, their search space is limited to include only the parallel factor within their template which can be analytically fused into their theoretical computational cost, whereas this is not always applicable to other naturally non-differentiable accelerator design parameters such as tiling strategies.
A more general and efﬁcient search engine is needed towards generic differentiable accelerator search.
Search algorithm.
We propose a differentiable search engine to efﬁciently search for the optimal accelerator (including the micro-architectures and mapping methods) given a DNN model and its precision based on single-path sampling as discussed in Sec. 3.1.
We solve Eq.
(3) in a differentiable way:
[Equation]
where M is the number of accelerator design parameters.
Given the network net ({ O lfw }) and precision prec ({ B lfw }) , where O lfw and B lfw are the only operator and precision activated during forward as discussed in Sec. 3.4, our search engine utilizes hard Gumbel Softmax GS hard sampling on each design parameter γ m to build an accelerator hw ({ GS hard ( γ m )}) and penalize each sampled accelerator parameter with the overall hardware-cost L cost through relaxation in a gradient manner.
Hardware template.
We adopt a uniﬁed template for both the FPGA and ASIC accelerators, which is a parameterized chunk-based pipeline micro-architecture inspired by (Shen et al., 2017).
In particular, the hardware/micro-architecture template comprises multiple sub-accelerators (i.e., chunks) and executes DNNs in a pipeline fashion.
Each chunk is assigned with multiple but not necessarily consecutive layers which are executed sequentially within the chunk.
Similar to Eyeriss, each chunk consists of levels of buffers/memories (e.g., on-chip buffer and local register ﬁles) and processing elements (PEs) to facilitate data reuses and parallelism with searchable design knobs such as PE interconnections (i.e., Network-on-chip), allocated buffer sizes, MAC operations’ scheduling and tiling (i.e., dataﬂows), and so on (see more details in Appendix B).
Discussion about the general applicability.
Our search approach is general and can be applicable to different hardware architectures, since we do not hold any prior assumptions about the adopted hardware architecture.
Speciﬁcally, for any target hardware architecture, including TPU-like or
GEMM or other accelerators, our search approach can be directly applied once given (1) a simulator to estimate the hardware cost, and (2) a set of user-deﬁned searchable design knobs abstracted from the target hardware architecture.
3. TRIPS: T HE OVERALL C O - SEARCH F RAMEWORK
Objective and challenges.
TRIPS’s iterative search starts from updating both the supernet weights ω and accelerator parameters γ , given the current network net ( α ) quantized using precision prec ( β ) , and then updates α and β based on the derived optimal weights ω ∗ and accelerator hw ( γ ∗ ) resulting from the previous step.
Updating ω ∗ and γ ∗ have been discussed in Sec.
3.2 and Sec. 3.3, respectively.
The key objective of TRIPS is captured by Eq.
(1) which involves all the three major aspects towards efﬁcient DNN accelerators.
The key challenges in achieving TRIPS include (1) the prohibitively large joint search space (e.g., 2.3E+21 in this work) which if not addressed will limit the scalability of TRIPS to practical yet complex tasks; (2) the entangled co-adaptation (Hong et al., 2020), correlation (Li et al., 2019), and cooperation (Tian et al., 2020) issues among different network and precision choices can enlarge the gap between the supernet during search and the ﬁnal derived network, thus failing the joint search; and (3) the non-triviality of deriving hardware-cost for the layer/block-wise update during network search, as the hardware-cost is determined by the whole network.
[Equation]
TRIPS implementation.
To tackle the three aforementioned challenges, TRIPS integrates a novel co-search pipeline which can be illustrated using the co-search for α as follows and is similarly applicable to co-search for β .
Note that here we deﬁne path to be one of the parallelled candidate operators between the layer input and layer output within one searchable layer, which can be viewed as a coarse-grained (layer-wise) version of the path deﬁnition in (Wang et al., 2018b; Qiu et al., 2019).
Single-path forward:
For updating both α (see Eq.
(6)) and β during forward, TRIPS adopts hard
Gumbel Softmax sampling (Hu et al., 2020a), i.e., only the choice with the highest probability will be activated to narrow the gap between the search and evaluation thanks to the single-path property of hard Gumbel Softmax sampling.
In Eq.
(6), A l and A l + 1 denote the feature maps of the l -th and ( l + 1 ) -th layer, respectively, N is the total number of operator choices, O li is the i -th operator in the l -th layer parameterized by α li , and O lfw is the only operator activated during forward.
Multi-path backward:
For updating both α (see Eq.
(7)) and β during backward, TRIPS activates multiple paths to calculate the gradients of α and β through Gumbel Softmax relaxation in order to balance the search efﬁciency and stability motivated by (Cai et al., 2018;
Hu et al., 2020b).
For example, α li ’s gradients are calculated using Eq.
(7), where K is the number of activated choices with the top K Gumbel Softmax probability.
Similar to (Cai et al., 2018), K ∈ ( 1 , N ) in TRIPS to control the computational cost.
Hardware-cost penalty:
The network search in Eq.
(1) is performed in a layer/block-wise manner as in (Liu et al., 2018), thus requiring layer/block-wise hardware-cost penalty which is determined by the layer/block-to-accelerator mapping method and the corresponding layer/block execution cost on the optimal accelerator hw ( γ ∗ ) .
The optimal mapping method of an accelerator is yet determined by the whole network.
To handle this gap, we derive the layer/block-wise hardware-cost assuming that the single-path network derived from the current forward would be the ﬁnal derived network, as this single-path network has a higher if not the highest probability to be ﬁnally derived.
In Eq.
(8), 1 is an indicator denoting whether α li (i.e., the i -th operator in the l -th layer) is activated during forward.
E XPERIMENT R ESULTS 4. E XPERIMENT S ETUP
Software settings.
Search space and hyper-params.
We adopt the same search space in (Wu et al., 2019) for the ImageNet experiments and disable the ﬁrst two down sampling operations for the
CIFAR-10/100 experiments.
We use [4, 6, 8, 12, 16] as candidate precision choices and one block shares the same precision of weights and activations for more hardware friendly implementation.
We activate two paths during backward, i.e., K = 2 in Eq.
(7), for search efﬁciency.
For L cost in Eq.
( 3), we use latency for FPGA as the target metric is Frame-Per-Second (FPS), and Energy-Delay-Product (EDP) for ASIC.
Detailed search and training settings are elaborated in Appendix A.
Baselines.
We mainly benchmark over four kinds of SOTA baselines: (1) the most relevant baseline
EDD (Li et al., 2020) which co-searches networks, precision, and accelerators, (2) SOTA methods co-exploring networks and accelerators including HS-Co-Opt (Jiang et al., 2020b), NASAIC (Yang et al., 2020), and BSW (Abdelfattah et al., 2020), (3) SOTA methods co-searching the networks and precision including APQ (Wang et al., 2020) and MP-NAS (Gong et al., 2019), and (4) hardwareaware NAS with uniform precision, including FBNet (Wu et al., 2019), ProxylessNAS (Cai et al., 2018), Single-Path NAS (Stamoulis et al., 2019), and EfﬁcientNet-B0 (Tan & Le, 2019).
Hardware settings.
To evaluate the generated network and accelerator designs, for FPGA cases, we adopt the standard Vivado HLS (Xilinx Inc., a) design ﬂow, on the target Xilinx ZC706 development board (Xilinx Inc., b), which has a total 900 DSP48s (Digital Signal Processor) and 19 . 1 Mb BRAM (Block RAM).
For ASIC implementations, we use the SOTA energy estimation tool
Timeloop (Parashar et al., 2019) and Accelergy, (Wu et al., 2019), to validate our generated design’s performance, with CACTI7 (Balasubramonian et al., 2017) and Aladdin (Shao et al., 2014) at a 32nm
CMOS technology as unit energy and timing cost plugins.
Details about the accelerator search space are discussed in Appendix B.
4. B ENCHMARK SEARCH EFFICIENCY
To evaluate the superiority of TRIPS in terms of search efﬁciency, we compare the search space size and search time of TRIPS with both RL-based co-search works and one-shot NAS methods using the reported data from the baselines’ original papers as shown in Tab. 2.
We can see that TRIPS consistently require notably less search time while handling the largest joint search space on all the considered tasks.
In particular, compared with the one-shot NAS methods (Guo et al., 2020;
Cai
[Table]
et al., 2019) which can be potentially extended to co-search frameworks while suffering from a large pretraining cost, TRIPS achieves 3.6 × ∼ 30 × less search time on ImageNet, while being end-to-end, justifying our choice of differentiable co-search.
4. B ENCHMARK OVER SOTA METHODS
[Figure]
Co-exploration of networks, precision, and accelerators.
We benchmark our TRIPS framework with SOTA efﬁcient DNN solutions on ImageNet and FPGA-based accelerators under the 512 DSP limits in Fig.
3 following (Abdelfattah et al., 2020).
Speciﬁcally, we provide four searched results of our TRIPS framework; we use the reported results for EDD, and search for the optimal accelerator in our accelerator space for APQ, MP-NAS, and SOTA hardware-aware NAS methods; for EfﬁcientNet-B0, we apply the SOTA mixed precision strategy searched by (Habi et al., 2020) for a fair comparison and the ProxylessNAS8bit is reported by APQ (Wang et al., 2020); and the other baselines are all quantized to 8-bit for hardware measurement and the accuracies are from the original papers without considering the quantization effect.
We can observe from Fig.
3 that (1) the searched networks by our TRIPS framework consistently push forward the frontier of accuracy-FPS trade-offs, (2) compared with the most relevant baseline EDD, we achieve a +1.3% higher accuracy with a 1.59 ×
FPS.
The effectiveness of TRIPS over various SOTA methods that represent most of the existing co-design directions veriﬁes the necessity and effectiveness of co-searching all the three aspects towards efﬁcient DNN accelerators.
Co-exploration of networks and accelerators.
Software-Hardware co
-design is a signiﬁcant property of our TRIPS framework, so we further benchmark it with both searched precision and ﬁxedprecision over SOTA network/accelerator co-search works for a fair comparison.
[Figure] [Figure]
[Table]
Co-search on FPGA.
We benchmark with HSCo-Opt (Jiang et al., 2020b) and BSW (Abdelfattah et al., 2020) on ZC706 under the same DSP limits as the baselines on CIFAR10/100/ImageNet.
Note that all our baselines here adopt a 16-bit ﬁxed-point design, so we provide TRIPS with ﬁxed 16-bit in addition to the one with searched precision for a fair comparison.
From Fig.
4, we can see that (1) on both
CIFAR-10/100 dataset, TRIPS with ﬁxed 16-bit consistently achieves a better accuracy (up to 10.91% and 5.15%, respectively) and higher FPS (up to 2.21 × and 2.15 × , respectively) under the same
DSP constraint, and (2) when co-searching the precision, our method can more aggressively push forward the FPS improvement (up to 6.79 × and 6.54 × , respectively on CIFAR-10/100), implying the importance of the co-exploration of the precision dimension in addition to network and accelerator co-explorations.
Speciﬁcally, TRIPS with searched precision achieves a +5.96% higher accuracy and 4.4 × FPS on ImageNet over (Jiang et al., 2020b).
[Table]
Co-search on ASIC.
We benchmark with NASAIC, the ﬁrst exploration towards network / accelerator co-search targeting ASIC accelerators, with both the co-search results and their reported sequential optimization/hardware aware optimization results (Yang et al., 2020) on CIFAR10 in Tab. 3.
We can observe that compared with both co-search, sequential optimization, and hardware-aware optimization methods for exploring the ASIC design space, our TRIPS framework consistently achieves notably improved trade-offs between accuracy and energy delay product (EDP), which is energy multiplied with latency.
In particular, we achieve a +0.17% ∼ +1.
% higher accuracy with a 371.56 ∼
[Table]
88 × reduction in
EDP.
In the baseline implementations, most of the area is occupied by the support for heterogeneous functionalities, which leads to severe under utilization when executing one task, thus contributing to the surprisingly higher area and energy consumption.
We further benchmark TRIPS over other two co-search baselines targeting ASIC accelerators, i.e.,
NHAS (Lin et al.) and DANCE (Choi et al., 2020).
In particular, we ﬁx the precision of TRIPS to be 4-bit and 16-bit to fairly compare with (1) NHAS which adopts 4-bit and (2) DANCE which adopts 16-bit, respectively.
As shown in Tab. 4, TRIPS achieves a 0.96%/3.5% higher accuracy and a 20.9%/64.9% reduction in latency together with a 6.3%/22.3% reduction in area consumption, as compared with NHAS and DANCE, respectively, verifying the superiority of our TRIPS.
4. A BLATION STUDIES ABOUT TRIPS
[Figure]
Scalability under the same DSP.
In Fig.
5, we show the pareto frontier of our TRIPS framework under the same DSP constraint with different accuracy and FPS trade-offs on CIFARto show our TRIPS can handle and is scalable with a large range of DNN solutions.
Effectiveness of heterogeneous sampling.
In addition to the example and analysis in Sec. 3.2, we further benchmark with the baseline that adopts the same sampling strategy for updating both the weights and precision.
We integrate the baseline’s sampling strategy into our TRIPS framework ( K = 2 for all the experiments), termed as TRIPS w/o h-sampling, and show the trade-offs between the achieved accuracy and FPS in Fig.
We ﬁnd it tends to select lower precision choices which are harmful to the overall accuracy, which is consistently inferior than that of
TRIPS with heterogeneous sampling, due to the inaccurate estimation for different precision ranking .
Comparison with sequential optimization.
Due to the great ﬂexibility on both software and hardware side, a natural baseline is to search the network and precision based on theoretical efﬁciency metrics (e.g., bit operations) and then search for the best matched accelerator given the searched network and precision from the ﬁrst search.
We benchmark over results from such a design ﬂow in
Fig.
5 on CIFAR-100 and observe that TRIPS consistently outperforms the sequential optimization baseline, e.g., a 1.95% higher accuracy with 1.75 × FPS, indicating the poor correlation between theoretical efﬁciency and real-device efﬁciency measurement.
More ablation studies about the accelerator search engine and visualization of the searched network, precision and accelerator can be found in Appendix C and D, respectively.
C ONCLUSION
We propose a Triple-Search (TRIPS) framework to jointly search for the network structure, precision, and accelerator in a differentiable manner.
Our TRIPS framework adopts a heterogeneous sampling strategy and a novel co-search pipeline that integrates a generic differentiable accelerator search engine to achieve unbiased search with constant memory consumption.
Extensive experiments validate the superiority of TRIPS over SOTA designs in terms of accuracy and efﬁciency.
A T RAINING AND SEARCH SETTING
Search settings.
For searching on CIFAR-10/100 dataset, we use half of the dataset for updating supernet weight ω and the other half for updating network and precision parameter α and β .
We search for 90 epochs with an initial gumbel softmax temperature 5 decayed by a factor 0.975 every epoch.
For searching on ImageNet, we randomly sample 100 classes as a proxy search dataset and use data for updating ω and the other for updating α and β .
We pretrain the supernet byepochs without updating network architecture and precision, then search for 90 epochs with an initial temperature 5 decayed by 0.956 every epoch, following (Wu et al., 2019).
For both CIFAR-10/ and ImageNet, we use initial learning rate 0.1 and an annealing cosine learning rate.
Training settings.
For CIFAR-10/100, we train the derived network for 600 epochs with a 0.
initial learning rate and an annealing cosine learning rate on a single NVIDIA RTX-2080Ti gpu following (Liu et al., 2018).
For ImageNet, we adopt a 0.05 initial learning rate and an annealing cosine learning rate for 150 epochs with four NVIDIA Tesla V100 gpus.
B A CCELERATOR SEARCH SPACE
To ﬂexibly maintain the balance between hardware resource consumption and throughput across different generated networks, we employ the chunk-wise pipeline styled accelerator architecture inspired by (Shen et al., 2017; Zhang et al., 2018b).
To enable the automatic hardware optimization and explore as much as the performance frontier, we further free up the hardware conﬁgurations during the co-optimization.
Adopted from (Chen et al., 2017; Zhang et al., 2015; Yang et al., 2016), these conﬁgurations, as illustrated in Fig. 1, cover 1) parallel processing elements (PE) settings: number and inter-connections of PEs, 2) buffer management: allocation of lower memory levels between input, weight and output, 3) tiling and scheduling of MAC(Multiply and Accumulate) computations and 4) layer allocation: ways to assign each layer to the corresponding pipeline stage (sub-accelerator).
All the above conﬁgurations are formatted and maintained through vectors of options to be compatible with the optimization formulation in Sec. 3.
Taking AlexNet as an example workload, the total accelerator space size can reach up to 10 5 for each sub-accelerator and the space can go exponentially larger as the number of sub-accelerator (pipeline chunks) increases.
C A BLATION STUDIES ABOUT THE ACCELERATOR SEARCH ENGINE
The proposed accelerator search engine is one key enabler of our TRIPS framework.
To evaluate its efﬁcacy, we compare the accelerator efﬁciency of the TRIPS generated accelerators with SOTA accelerators under the same datasets and models.
For FPGA-based accelerators, we consider three representative including (Qiu et al., 2016; Xiao et al., 2017; Zhang et al., 2018b) on two DNN models (AlexNet and VGG16) on ImageNet.
For a fair comparison, when using our own engine to generate optimal accelerators, we adopt the same precision and FPGA resource as the baselines.
The results in Tab.
5 show that the TRIPS generated accelerators outperform both SOTA expert-designed and tool-generated accelerators under the same dataset, DNNs, and FPGA resources.
For example, the
TRIPS generated accelerators achieve up to 2 .
16 × increase in throughput on VGG16.
The consistent better performance of our auto generated accelerators validates the effectiveness of our accelerator search engine in navigating the large and discrete design space of DNN accelerators to search for optimal DNN accelerators.
[Table]
D V ISUALIZATION OF SEARCHED NETWORK , PRECISION , AND ACCELERATOR .
Fig.
6 visualizes the searched network, precision, and accelerator achieved a 72.2% top-1 accuracy on ImageNet and 110 FPS on ZC706 FPGA.
We conclude the insights below.
Insights for the searched network.
We ﬁnd that wide-shallow networks will better favor real device efﬁciency on ZC706 FPGA while achieve a similar accuracy.
We conjecture the reason is that wider networks offer more opportunities for feature/channel-wise parallelism when batch size equals to one, leading to higher resource utilization and thus overall higher throughput.
[Figure]
Insights for the searched accelerator of TRIPS.
The whole network is partitioned into multiple pipeline chunks to prioritize the resulting throughput, with each color representing one chunk.
Deterministically, two blocks with different quantization schemes will not be put into one chunk due to hardware constraints.
Adopted from the design in (Shen et al., 2017), there is no dependency of computation among blocks, so the pipeline chunks can take non-consecutive layers and better group the layers with similar dimensions together.
Generally, as observed in Fig.
6 the chunks which take mostly the early blocks of the network favor spatially tiling the feature map height and width as it offers more parallelism, while the later chunks tends to choose the architecture to tile channels as, after down-sampling, parallelism opportunity is more prominent along channel dimensions.