1. Neural Network Learning: Theoretical Foundations;Anthony,1999
2. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora;Journal of Computer and System sciences,1997
3. Universal approximation bounds for superpositions of a sigmoidal function;Barron;IEEE Transaction on Information Theory,1993
4. Rademacher and Gaussian complexities: Risk bounds and structural results;Bartlett;Journal of Machine Learning Research,2002
5. Local Rademacher complexities;Bartlett,2003