Finally, we perform network slimming on the supernet obtained from the first step through latency evaluation using the lookup table.
Note that a typical gradient-based searching algorithm simply select the block with largest \(\alpha \)  [1]}, which does not fit our scope as it cannot search the width \(C_j\) .
In fact, constructing a multiple-width supernet is memory-consuming and even unrealistic given that each \(\texttt {MP}\)  has several branches in our design.
Instead of directly searching on the complex searching space, we perform a gradual slimming on the single-width supernet as follows.
