homepage: | http://ttic.uchicago.edu/~dmcallester/ |
search externally: | Google Scholar, Springer, CiteSeer, Microsoft Academic Search, Scirus , DBlife |
Description
Professor McAllester received his B.S., M.S., and Ph.D. degrees from the Massachusetts Institute of Technology in 1978, 1979, and 1987 respectively. 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 (AAAI) since 1997. Since 2002 he has been Chief Academic Officer at the Toyota Technological Institute at Chicago (TTIC).
Professor McAllester's research areas include machine learning, the theory of programming languages, automated reasoning, AI planning, computer game playing (computer chess), computational linguistics and computer vision. 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 Gary Kasparov. A 1998 paper on machine learning theory introduced PAC-Bayesian theorems which combine Bayesian and nonBayesian methods. A 2001 paper with Andrew Appel introduced the influential step indexed model of recursive types in programming languages. He was part of a team (with Pedro Felzenszwalb, Ross Girshick and Deva Ramanan) that developed the deformable part model (DPM) which has become the community baseline system for object detection in computer vision. He is currently working with Raquel Urtasun and Koichiro Yamaguchi on stereo vision and optical flow algorithms with applications to robotic cars. He recently introduced a theoretical analysis of droupout learning for deep neural networks based on a PAC-Bayesian generalization bounds. He also recently posted an arxiv manuscript on a type-theoretic foundation for mathematics.
Lectures: