You will be shown an excerpt from a computer science scientific research paper, followed by a question about the paper. Please answer the question. Do not include any text in your response other than the answer.

Context: There are two methods to find an architecture with a loose latency constraint. One is to use compound scaling that scales a small network with shorter latency, and the other is to search a network directly. To compare these two methods,we first scaled ours-M using the same scaling coefficients that we used to scale ours-M+ to ours-L+ and trained it. When conducting a direct search, we scaled the depth and width of the supernet and the input image size first and applied the proposed NAS technique for the scaled supernet. We used batch size 512 instead of 1024 during the architecture search due to the memory limitation of TPU. The comparison result is shown in Table 7 in terms of top-1 accuracy(%) and the latency on the target NPU(ms).Two results were similar while direct search needed 10 hours on TPUv3; It means that compound scaling is an effective method to find a large network fast.

Question: How does authors verify that searching in a small supernet then scaling is good tactic to search a big network?
Searching in a small supernet then scaling was better than directly searching in a big supernet; The accuracy was similar, but the direct search needed much higher search cost.