We adopt non-dominated sorting strategy [1]} to obtain the Pareto-front architectures from the population (\(\mathcal {A}_G\)  or \(\mathcal {A}_D\) ). The selected architectures are used to generate offspring by crossover and mutation. \(\mathcal {N}_i\)  is dominated by \(\mathcal {N}_j\)  when Eq. REF  satisfies.
\(\begin{array}{ll}\mathcal {F}_{k}\left(\mathcal {N}_i\right) \ge \mathcal {F}_{k}\left(\mathcal {N}_j\right) & \forall k \in \lbrace 1, \ldots , K\rbrace  \\\mathcal {F}_{k}\left(\mathcal {N}_i\right)>\mathcal {F}_{k}\left(\mathcal {N}_j\right) & \exists k \in \lbrace 1, \ldots , K\rbrace \end{array}\) 
