David A. McAllester

From Wikipedia, the free encyclopedia
Jump to: navigation, search

This article is about the computer scientist, David A. McAllester. For the ethnomusicologist, see David P. McAllester

Professor David A. McAllester 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 served 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.

Professor 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.

McAllester is currently a professor and chief academic officer at the Toyota Technological Institute at Chicago, an accredited research institute closely affiliated with the University of Chicago.

External links[edit]