Michael Kearns (computer scientist)
Michael Justin Kearns | |
---|---|
Born | California |
Alma mater | Ronald Rivest (postdoctoral, MIT) Richard M. Karp (postdoctoral, UC Berkeley) |
Doctoral students | Jennifer Wortman Vaughan |
Other notable students | John Langford (postdoctoral visitor) |
Website | www |
Michael Justin Kearns is an American
Biography
Kearns was born into an academic family, where his father David R Kearns is Professor Emeritus at
Kearns received his B.S. degree at the
Kearns is currently a full professor and National Center Chair at the University of Pennsylvania, where his appointment is split across the Department of Computer and Information Science, and
Kearns was named Fellow of the Association for Computing Machinery (2014) for contributions to machine learning,[1] and a fellow of the American Academy of Arts and Sciences (2012).
His former graduate students and postdoctoral visitors include Ryan W. Porter, John Langford, and Jennifer Wortman Vaughan.
Kearns' work has been reported by media, such as
Academic life
Computational learning theory
Kearns and Umesh Vazirani published An introduction to computational learning theory, which has been a standard text on computational learning theory since it was published in 1994.
Weak learnability and the origin of Boosting algorithms
The question "is weakly learnability equivalent to strong learnability?" posed by Kearns and Valiant (Unpublished manuscript 1988, ACM Symposium on Theory of Computing 1989)[8][9] is the origin of boosting machine learning algorithms, which got a positive answer by Robert Schapire (1990, proof by construction, not practical) and Yoav Freund (1993, by voting, not practical) and then they developed the practical AdaBoost (European Conference on Computational Learning Theory 1995, Journal of Computer and System Sciences 1997), an adaptive boosting algorithm that won the prestigious Gödel Prize (2003).
Honors and awards
- 2021. Member of the U. S. National Academy of Sciences.[10]
- 2014. ACM Fellow.
- For contributions to machine learning, artificial intelligence, and algorithmic game theory and computational social science. [1]
- 2012. American Academy of Arts and Sciences Fellow.
Selected works
- 2019. The Ethical Algorithm: The Science of Socially Aware Algorithm Design. (with Aaron Roth). Oxford University Press.
- 1994. An introduction to computational learning theory. (with Umesh Vazirani). MIT press.
- Widely used as a text book in computational learning theory courses.[11]
- 1990. The computational complexity of machine learning. MIT press.
- Based on his 1989 doctoral dissertation;
- ACM Doctoral Dissertation Award Series in 1990
- 1989. Cryptographic limitations on learning Boolean formulae and finite automata. (with Leslie Valiant) Proceedings of the twenty-first annual ACM symposium on Theory of computing (STOC'89).
- The open question: is weakly learnability equivalent to strong learnability?;
- The origin of boosting algorithms;
- Important publication in machine learning.
See also
References
- ^ a b c d MICHAEL KEARNS (2014). "ACM Fellows 2014". acm.org. ACM. Retrieved January 10, 2015.
- ^ "Morgan Stanley Hires Ex-SAC Capital Artificial Intelligence Expert". Bloomberg News. 26 June 2018.
- ^ "Amazon Scholar: Michael Kearns". 26 June 2020.
- ^ David R. Kearns 1969 Guggenheim Fellowship Chemistry
- .
- ^ Eber, Irene. "Chen Shou Yi". School of Education Studies. Claremont Graduate University. Archived from the original on 31 August 2014. Retrieved 13 February 2021.
- ^ Irene Eber. "Chen Shou-yi, 1899-1978". acmcgu.edu. Archived from the original on August 31, 2014. Retrieved January 10, 2015.
In the growth and development of Asian Studies on the West Coast, the Claremont Colleges and Professor Chen occupy a leading place.
- ^ Michael Kearns (1988). "Thoughts on Hypothesis Boosting (Unpublished manuscript (Machine Learning class project, December 1988))" (PDF). Retrieved January 10, 2015.
{{cite journal}}
: Cite journal requires|journal=
(help) - S2CID 536357. Retrieved January 10, 2015.
- ^ "News from the National Academy of Sciences". April 26, 2021. Retrieved July 4, 2021.
Newly elected members and their affiliations at the time of election are: … Kearns, Michael; professor, department of computer and information science, University of Pennsylvania, Philadelphia
, entry in member directory:"Member Directory". National Academy of Sciences. Retrieved July 4, 2021. - ^ Columbia University. "Introduction to Computational Learning Theory". cs.columbia.edu. Retrieved January 9, 2015.
External links
- the speakers include Turing award winners, and Vijay Vazirani.