Weakness: 1.Some typos such as “TRAFE-OFFS” in the title of section 4.1. 2.The 24 different structures generated by random premutation in section 4.1 should be explained in more detail. 3.The penultimate sentence of Section 3.3 states that "iterative greedy search can avoid the suboptimality of the resulting scaling strategy on a particular model", which is not a serious statement because the results of the iterative greedy search are also suboptimal solutions. 4.The conclusion of "Cost breakdown can indicate the transferability effectiveness" in Figure 7 is not sufficient. We cannot extend the conclusion obtained from a few specific experiments to any different hardware devices or different architectures. 5.Why not use the same cost for different devices instead of flops, latency, and 1/FPS for different hardware? 6.The result comparison of "Iteratively greedy Search" versus "random search" on the model structure should be supplemented.
6.The result comparison of "Iteratively greedy Search" versus "random search" on the model structure should be supplemented.