Understanding Machine Learning: From Theory to Algorithms

26.5 Bibliographic Remarks 387

Our proof of the concentration lemma is due to Kakade and Tewari lecture
notes. Kakade, Sridharan & Tewari (2008) gave a unified framework for deriving
bounds on the Rademacher complexity of linear classes with respect to different
assumptions on the norms.