David A. McAllester
David A. McAllester
|Known for||Artificial intelligence|
|Awards||AAAI Classic Paper Award (2010)|
International Conference on Logic Programming Test of Time award (2014)
|Fields||Computer Science, Artificial Intelligence, Machine Learning|
|Institutions||Toyota Technological Institute at Chicago|
|Doctoral advisor||Gerald Sussman|
David A. McAllester (born May 30, 1956) is an American computer scientist who is Professor and former Chief Academic Officer at the Toyota Technological Institute at Chicago. He received his B.S., M.S., and Ph.D. degrees from the Massachusetts Institute of Technology in 1978, 1979, and 1987 respectively. His PhD was supervised by Gerald Sussman. He served on the faculty of Cornell University for the academic year of 1987-1988 and on the faculty of MIT from 1988 to 1995. He was a member of technical staff at AT&T Labs-Research from 1995 to 2002. He has been a fellow of the American Association of Artificial Intelligence since 1997. He has authored over 100 refereed publications.
McAllester's research areas include machine learning theory, the theory of programming languages, automated reasoning, AI planning, computer game playing (computer chess), and computational linguistics. A 1991 paper on AI planning proved to be one of the most influential papers of the decade in that area. A 1993 paper on computer game algorithms influenced the design of the algorithms used in the Deep Blue system that defeated Garry Kasparov. A 1998 paper on machine learning theory introduced PAC-Bayesian theorems which combine Bayesian and non-Bayesian methods. His plans for future research are focused on the integration of semantics into statistical approaches to computational linguistics.
Opinions on Artificial Intelligence
McAllester has voiced concerns about the potential dangers of artificial intelligence, stating in an article to the Pittsburgh Tribune-Review that it is inevitable that fully automated intelligent machines will be able to design and build smarter, better versions of themselves, an event known as the Singularity. The Singularity would enable machines to become infinitely intelligent, and would pose an "incredibly dangerous scenario". McAllester estimates a 10 percent probability of the Singularity occurring within 25 years, and a 90 percent probability of it occurring within 75 years. He appeared on the AAAI Presidential Panel on Long-Term AI Futures in 2009:, and considers the dangers of superintelligent AI worth taking seriously:
I am uncomfortable saying that we are ninety-nine per cent certain that we are safe for fifty years...That feels like hubris to me.
He was later described as discussing the Singularity at the panel in terms of two major milestones in artificial intelligence:
1) Operational Sentience: We can easily converse with computers.
2) The AI Chain Reaction: A computer that boot straps itself to a better self. Repeat.
McAllester has also written on friendly artificial intelligence on his blog. He states that before machines become capable of programming themselves (potentially leading to the Singularity), there should be a period where they are moderately intelligent in which it should be possible to test out giving them a purpose or mission that should render them safe to humans:
I personally believe that it is likely that within a decade agents will be capable of compelling conversation about the everyday events that are the topics of non-technical dinner conversations. I think this will happen long before machines can program themselves leading to an intelligence explosion. The early stages of artificial general intelligence (AGI) will be safe. However, the early stages of AGI will provide an excellent test bed for the servant mission or other approaches to friendly AI ... If there is a coming era of safe (not too intelligent) AGI then we will have time to think further about later more dangerous eras.
- David McAllester's academic page at TTIC.
- Machine Thoughts, David McAllester's personal blog.
- David Allen McAllester at the Mathematics Genealogy Project.
- "AAAI Classic Paper Award". AAAI. 2016. Retrieved 19 August 2016.
- "Pascal's paper stands the test of time". Australian National University. 23 April 2014. Retrieved 19 August 2016.
- "David McAllester bio". Toyota Technological Institute at Chicago. Retrieved 19 August 2016.
- McAllester, David; Rosenblitt, David (December 1991). "Systematic Nonlinear Planning" (PDF). Proceedings AAAI-91. AAAI: 634–639. Retrieved 19 August 2016.
- "Google Scholar Citations". Google Scholar. 2016. Retrieved 19 August 2016.
- McAllester, David; Yuret, Deniz (20 October 1993). "Alpha-Beta-Conspiracy Search". Draft. Retrieved 19 August 2016.
- Campbell, Murray S.; Joseph Hoane, Jr., A.; Hsu, Feng-hsiung (1999). "Search Control Methods in Deep Blue" (PDF). AAAI Technical Report SS-99-07. AAAI: 19–23. Retrieved 16 August 2016.
To the best of our knowledge, the idea of separating the white and black depth computation was first suggested by David McAllester. A later paper (McAllester and Yuret 1993) derived an algorithm, ABC, from conspiracy theory (McAllester 1988).
- McAllester, David (1998). "Some PAC-Bayesian theorems". Proceedings of the eleventh annual conference on Computational learning theory. Association for Computing Machinery: 230–234. doi:10.1145/279943.279989. Retrieved 19 August 2016.
- Cronin, Mike (2 November 2009). "Futurists' report reviews dangers of smart robots". Pittsburgh Tribune-Review. Retrieved 20 August 2016.
- "Asilomar Meeting on Long-Term AI Futures". Microsoft Research. 2009. Retrieved 20 August 2016.
- Khatchadourian, Raffi (23 November 2015). "The Doomsday Invention: Will artificial intelligence bring us utopia or destruction?". The New Yorker. Retrieved 23 August 2016.
- Fortnow, Lance (31 July 2009). "The Singularity". Computational Complexity. Blogger. Retrieved 20 August 2016.
- McAllester, David (10 August 2014). "Friendly AI and the Servant Mission". Machine Thoughts. Wordpress. Retrieved 20 August 2016.