Manfred K. Warmuth
{{Short description|German computer scientist}}
{{Infobox scientist
|image = Replace this image male.svg
|image_size = 150px |
| name = Manfred Klaus Warmuth
| birth_date =
| birth_place =
| residence =
| nationality =
| field = Computer Science
| work_institution = {{plainlist|
| alma_mater = University of Colorado, Boulder
| doctoral_advisor = Hal Gabow
| doctoral_students = Yoav Freund
| known_for = {{plainlist|1=
- Weighted majority algorithm
- Occam learning
- Introducing VC-dimension to computational learning theory
}}
| prizes = Elected to Leopoldina (2021)
}}
Manfred Klaus Warmuth is a computer scientist known for his pioneering research in computational learning theory.{{r|simons}} He is a Distinguished Professor emeritus at the University of California, Santa Cruz.
Education and career
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.{{r|x}} His doctoral dissertation, Scheduling on Profiles of Constant Breadth, was supervised by Harold N. Gabow.{{r|mg}}
After postdoctoral research at the University of California, Berkeley and Hebrew University of Jerusalem, Warmuth joined the University of California, Santa Cruz in 1983, became Distinguished Professor there in 2017, and retired as a professor emeritus in 2018. He was a visiting faculty member at Google Brain from 2019 to 2020.{{r|leo}}
Contributions
With his student Nick Littlestone,{{r|mg}} Warmuth published the weighted majority algorithm for combining the results for multiple predictors in 1989.{{r|blum-mansour}}{{ran|WM}}
Warmuth was also the coauthor of an influential 1989 paper in the Journal of the ACM, with Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, introducing the Vapnik–Chervonenkis dimension to computational learning theory.{{r|i2clt}}{{ran|VC}} With the same authors, he also introduced Occam learning in 1987.{{r|valiant}}{{ran|OR}}
Recognition
In 2021, Warmuth became a member of the German National Academy of Sciences Leopoldina.{{r|leo}}
Selected publications
{{rma|VC|tw=2em|{{citation
| last1 = Blumer | first1 = Anselm
| last2 = Ehrenfeucht | first2 = Andrzej | author2-link = Andrzej Ehrenfeucht
| last3 = Haussler | first3 = David | author3-link = David Haussler
| last4 = Warmuth | first4 = Manfred K.
| doi = 10.1145/76359.76371
| issue = 4
| journal = Journal of the ACM
| mr = 1072253
| pages = 929–965
| title = Learnability and the Vapnik–Chervonenkis dimension
| volume = 36
| year = 1989| s2cid = 1138467
| doi-access = free
}}; a preliminary version, "Classifying learnable geometric concepts with the Vapnik–Chervonenkis dimension", was presented at the ACM Symposium on Theory of Computing (STOC 1986), {{doi|10.1145/12130.12158}}}}
{{rma|OR|tw=2em|{{citation
| last1 = Blumer | first1 = Anselm
| last2 = Ehrenfeucht | first2 = Andrzej | author2-link = Andrzej Ehrenfeucht
| last3 = Haussler | first3 = David | author3-link = David Haussler
| last4 = Warmuth | first4 = Manfred K.
| doi = 10.1016/0020-0190(87)90114-1
| issue = 6
| journal = Information Processing Letters
| mr = 896392
| pages = 377–380
| title = Occam's razor
| volume = 24
| year = 1987}}}}
{{rma|WM|tw=2em|{{citation
| last1 = Littlestone | first1 = Nick
| last2 = Warmuth | first2 = Manfred K.
| doi = 10.1006/inco.1994.1009
| issue = 2
| journal = Information and Computation
| mr = 1265851
| pages = 212–261
| title = The weighted majority algorithm
| volume = 108
| year = 1994| doi-access = free
}}; announced at the IEEE Symposium on Foundations of Computer Science (FOCS 1989), {{doi|10.1109/SFCS.1989.63487}}}}
References
{{reflist|refs=
| last1 = Blum | first1 = Avrim
| last2 = Mansour | first2 = Yishay
| editor1-last = Nisan | editor1-first = Noam
| editor2-last = Roughgarden | editor2-first = Tim
| editor3-last = Tardos | editor3-first = Éva
| editor4-last = Vazirani | editor4-first = Vijay V.
| contribution = Learning, regret minimization, and equilibria
| isbn = 978-0-521-87282-9
| mr = 2391751
| pages = 79–101
| publisher = Cambridge University Press
| title = Algorithmic Game Theory
| year = 2007}}; see 4.3.2 Randomized Weighted Majority Algorithm, [https://books.google.com/books?id=YCu2alSw0w8C&pg=PA85 pp. 85–86]
| last1 = Kearns | first1 = Michael J.
| last2 = Vazirani | first2 = Umesh V.
| isbn = 0-262-11193-4
| mr = 1331838
| page = 70
| publisher = MIT Press, Cambridge, MA
| title = An Introduction to Computational Learning Theory
| url = https://books.google.com/books?id=vCA01wY6iywC&pg=PA70
| year = 1994}}
| last = Valiant | first = Leslie G.
| editor1-last = Meyrowitz | editor1-first = Alan L.
| editor2-last = Chipman | editor2-first = Susan
| contribution = A view of computational learning theory
| doi = 10.1007/978-0-585-27366-2_8
| pages = 263–289
| publisher = Springer
| series = The Springer International Series in Engineering and Computer Science
| title = Foundations of Knowledge Acquisition
| volume = 195}}; see [https://books.google.com/books?id=mU9VqnaKCNoC&pg=PA280 p. 280]
}}
External links
- [https://mwarmuth.bitbucket.io/ Home page]
{{Authority control}}
{{DEFAULTSORT:Warmuth, Manfred K.}}
Category:Year of birth missing (living people)
Category:University of California, Santa Cruz faculty
Category:University of Colorado Boulder alumni
Category:21st-century German scientists
Category:Members of the German National Academy of Sciences Leopoldina
Category:German computer scientists