Improvement of the randomized lower-bound constant

Improve the constant 128 in the randomized lower bound relating expected mistakes and expected ERM-oracle calls for thresholds on an unknown order under the minimal-prefix rule.

Background

Theorem C proves that expected mistakes are at least ((T+1-epsilon)128^{-E[Q]}-1)/2 under an explicit hard distribution. The paper states that the constant is not optimized and explicitly identifies improving it as an open problem.