We anticipate the runtime of this algorithm to be close to timeout*num_reads according to the MST2 reference (no restarts - STS(), which should run until a timeout condition is met). However, it seems to be more than 2 orders of magnitude shorter and basically independent of timeout.
Perhaps a max number of iterations (z) is silently hardcoded per restart? I've varied, num_restarts, tenure, num_reads and complexity (size and level of frustration) of the ising model without recovering the expected behavior.
We anticipate the runtime of this algorithm to be close to timeout*num_reads according to the MST2 reference (no restarts - STS(), which should run until a timeout condition is met). However, it seems to be more than 2 orders of magnitude shorter and basically independent of timeout.
Perhaps a max number of iterations (z) is silently hardcoded per restart? I've varied, num_restarts, tenure, num_reads and complexity (size and level of frustration) of the ising model without recovering the expected behavior.