This implies that the calculation of the two non-monotonic upper bounds is less efficient than the linear loss computation in the monotonic scenario.
a non-monotonic algorithm that uses the lower bound as loss expression is the fastest option (even faster than the monotonic approach) as the oracle does not need to compute cycles at all, speeding up the training process.