Of course, it is difficult to compare overall runtime of convex optimization with that of MERT, as we know of no way to bound the number of gradient evaluations required for convergence with MERT.
we resort to empirical comparison later in the paper, and find that the two methods appear to have comparable runtime.