After studying computer science at the University of Erlangen–Nuremberg, earning a diploma in 1978, Warmuth went to the University of Colorado Boulder for graduate study, earning a master's degree there in 1980 and completing his Ph.D. in 1981.[2] His doctoral dissertation, Scheduling on Profiles of Constant Breadth, was supervised by Harold N. Gabow.[3]
With his student Nick Littlestone,[3] Warmuth published the weighted majority algorithm for combining the results for multiple predictors in 1989.[5][WM]
^ abWarmuth, Manfred K., "Curriculum Vita"(PDF), German National Academy of Sciences Leopoldina
^Blum, Avrim; Mansour, Yishay (2007), "Learning, regret minimization, and equilibria", in Nisan, Noam; Roughgarden, Tim; Tardos, Éva; Vazirani, Vijay V. (eds.), Algorithmic Game Theory, Cambridge University Press, pp. 79–101, ISBN978-0-521-87282-9, MR2391751; see 4.3.2 Randomized Weighted Majority Algorithm, pp. 85–86
^Valiant, Leslie G., "A view of computational learning theory", in Meyrowitz, Alan L.; Chipman, Susan (eds.), Foundations of Knowledge Acquisition, The Springer International Series in Engineering and Computer Science, vol. 195, Springer, pp. 263–289, doi:10.1007/978-0-585-27366-2_8; see p. 280