1. Bartlett, P.L., Mendelson, S.: Rademacher and Gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463–482 (2003). http://dl.acm.org/citation.cfm?id=944919.944944
2. Geman, S., Bienenstock, E., Doursat, R.: Neural networks and the bias/variance dilemma. Neural Comput. 4(1), 1–58 (1992)
3. Goldberg, D.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley Longman Publishing Company, Reading (1999)
4. Kearns, M.J., Schapire, R.E.: Efficient distribution-free learning of probabilistic concepts. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, vol. 1, pp. 382–391 (1990). https://doi.org/10.1109/FSCS.1990.89557
5. Kohavi, R., Wolpert, D.H., et al.: Bias plus variance decomposition for zero-one loss functions. In: ICML 1996, pp. 275–283 (1996)