Lemma 28.1: the Maximum-Likelihood (majority-vote) rule minimizes the average over b ∈ {±1}^d of E_{S∼D_b^m}[L_{D_b}(A(S))] among all algorithms

Initializing...

Lemma 28.1: the Maximum-Likelihood (majority-vote) rule minimizes the average over b ∈ {±1}^d of E_{S∼D_b^m}[L_{D_b}(A(S))] among all algorithms · Prove2Me