1 problem

Consider a finite hypothesis class ${\cal H}$ with $N=|{\cal H}|$, and suppose a noiseless generalized binary search procedure uses $n_0$ queries. In the noisy setting, each query…