The NPM research community has adopted several approaches to efficiently search a library of NPMs for the optimal NPM(s) . We define the efficiency of a search strategy with respect to two naive baselines: (i) exhaustive search, where we conduct the high-fidelity experiment on every NPM in the library, and (ii) random search, where we conduct the high-fidelity experiment on a (uniform) random sample of the NPMs in the library.