Skip to main content
. Author manuscript; available in PMC: 2021 Jul 30.
Published in final edited form as: J Mach Learn Res. 2019;20:177.

Figure 5:

Figure 5:

Monotonicity for binary search. Above we show a version of Figure 4C for two alternative values of γ. This figure is meant, to add intuition for the monotonicity results in Lemma 10, in addition to the formal proof. Increasing γ is equivalent to decreasing the slope of the red line in Figure 4C. We define two values γ1 < γ2, where γ1 corresponds to the solid red line, above, and γ2 corresponds to the semi-transparent, red line. The y-intercept values of these lines are equal to h^,γ1(g^,γ1) and h^,γ2(g^,γ2) respectively (see Figure 4C caption). The solid and semi-transparent, black dots mark (g^,γ1) and (g^,γ2) respectively. Plugging γ1 and γ2 into Eq 6.1 yields two lower bounds for MR^, marked by the slopes of the solid and semi-transparent, black lines respectively (see Figure 4C caption). We see that (1) h^,γ1(g^,γ1)h^,γ2(g^,γ2), that (2) e^orig(g^,γ1)e^orig(g^,γ2), and that (3) the left-hand side of Eq 6.1 is decreasing in γ when e^orig(g^,γ1)ϵabs. These three conclusions are marked by arrows in the above figure, with numbering matching the enumerated list in Lemma 10.