Jump to content

Thomas Dean (computer scientist)

Edit links
From Wikipedia, the free encyclopedia

Thomas L. Dean
Thomas Dean in 2012
Born1950 (age 73–74)
NationalityAmerican
Alma materVirginia Polytechnic Institute
Yale University
Known forANYTIME ALGORITHMS
AwardsAAAI Fellow (1994)[1]
ACM Fellow (2009) [2]
Scientific career
FieldsComputer Science
InstitutionsGoogle
Stanford University
Brown University
Thesis Temporal Imagery: An Approach to Reasoning about Time for Planning and Problem Solving  (1985)
Doctoral advisorDrew McDermott
Websitecs.brown.edu/people/tdean/

Thomas L. Dean (born 1950) is an American computer scientist known for his work in robot planning, probabilistic graphical models, and computational neuroscience. He was one of the first to introduce ideas from operations research and control theory to artificial intelligence.[3] In particular, he introduced the idea of the anytime algorithm and was the first to apply the factored Markov decision process to robotics.[4][5] He has authored several influential textbooks on artificial intelligence.[3][6][7]

He was a professor at Brown University from 1993 to 2007, holding roles including department chair, acting vice president for computing and information services, and deputy provost.[8] In 2006 he started working at Google, where he was instrumental in helping the Google Brain project get its start. He is currently an emeritus professor at Brown and a lecturer and research fellow at Stanford.[9]

Academic and Scientific Contribution

[edit]

Artificial Intelligence

[edit]

Control

[edit]

Dean and Wellman's book Planning and Control[3] provided a much-needed bridge between research in AI on discrete-time symbolic methods for goal directed planning and decision making and continuous-time control theoretic methods for robotics and industrial control systems. Basic control concepts including "observability", "stability", and "optimality" are introduced, and many of the most important theoretical results are presented and explained. In a book review in the Artificial Intelligence Journal, James Hendler wrote that the book serves as a 'Rosetta Stone' for translation between the fields of robotics and AI.[10]

Anytime Algorithms

[edit]

The term anytime algorithm was coined by Dean and Boddy in the late '80s.[11] The focus of Dean and Boddy's work in this area has been on deliberation scheduling applied to time-dependent planning problems. Deliberation scheduling is the explicit allocation of resources to tasks (in most cases anytime algorithms) so as to maximize the total value of an agent's computation.[12] Time-dependent planning problems are defined to be planning problems where the time available for responding to events varies from situation to situation. In addition to defining the basic concepts, Dean and Boddy provided theoretical analyses and applications in robotics and operations research.[13][14][15][16][17]

Markov Processes

[edit]

Dean played a leading role in the adoption of the framework of Markov decision processes (MDPs) as a foundational tool in artificial intelligence. In particular, he pioneered the use of AI representations and algorithms for || factoring || complex models and problems into weakly-interacting subparts to improve computational efficiency. His work in state estimation emphasized temporal causal reasoning[18][13][19] and the integration with probabilistic graphical models.[20][21] His work in control includes state-space partitioning,[22][23][24][25][26] hierarchical methods,[20][21] and model minimization.[27][28][29][14] This line of work is clearly summarized by a highly influential paper jointly written with Craig Boutilier and Steve Hanks.[30]

AI Textbook

[edit]

Working with his collaborators, James Allen and Yiannis Aloimonos specializing in respectively computer vision and natural language processing, Dean wrote one of the first modern AI textbooks incorporating probability theory, machine learning and robotics, and placing traditional AI topics such as symbolic reasoning and knowledge representation using the predicate calculus within a broader context.[6] The first and only edition published in December 1994 initially competed with the first edition of Russell and Norvig's Artificial Intelligence: A Modern Approach that came out in 1995, but was eclipsed by the second edition of the Russell and Norvig text released in 2003.[31]

Robotics

[edit]

As co-chair of the 1991 AAAI Conference Dean organized a press event featuring mobile robots carrying trays of canapés and barely avoiding the participants. The coverage on the evening news was enthusiastically positive and in 1992, Dean and Peter Bonasso, with feedback from the robotics community, created the AAAI Robotics Competition featuring events aimed at showing off robots competing in events that involved performing tasks in the home, office, and disaster sites.[32][33][34] The competition was still being held in 2010.[35]

Computational Neuroscience

[edit]

Stanford Course

[edit]

After starting as a research scientist at Google, Dean was appointed as a consulting professor at Stanford and began teaching a course with the title Computational Models of the Neocortex. During the next fifteen years he invited top neuroscientists from all over the world to give talks and advise students working on class projects. Several of the classes resulted in papers coauthored by students that led to research projects at Google.[29][36][37][38]

Neuromancer Project

[edit]

In an effort to create a team focusing on scalable computational neuroscience, Dean and his students at Stanford produced a white paper entitled Technology Prospects and Investment Opportunities for Scalable Neuroscience[29] that served as the basis for building a team of software engineers and computational neuroscientists focusing on connectomics. Early on, Dean worked with Christof Koch the chief scientist at the Allen Institute for Brain Neuroscience to develop a partnership, and hired Viren Jain from HHMI to serve as the technical lead for the project.

Dean and Jain expanded the team to more than ten software engineers and participated in the planning of the NIH Brain Initiative. As their computer vision and machine learning tools improved, the team sought out and developed additional partnerships with Gerry Rubin at HHMI Janelia Campus, Jeff Lichtman at Harvard, and Winfried Denk at the Max Planck Institute of Neurobiology. Each of these collaborations would lead to high-accuracy, dense reconstructions of neural tissue samples in different organisms, repeatedly surpassing the current state of the art in size and quality.[39][40][41] Viren Jain is currently the project manager and lead scientist for the ongoing effort at Google. The resulting data on brain connectivity, including the 'hemibrain' connectome, a highly detailed map of neuronal connectivity in the fly brain[42] and the 'H01' dataset, a 1.4 petabyte rendering of a small sample of human brain tissue,[43] was publicly released.

Google Brain

[edit]

Dean led some of the earliest investigations into the use of neural networks at Google, that directly led to the creation of the Google Brain project. He experimented with approaches for using hardware acceleration to overcome current performance limitations in building industrial-scale web services, and collaborated with Dean Gaudet on the Google Infrastructure and Platforms Team to make the case for introducing graphic processing units (GPU) in Google data centers. He worked closely with Vincent Vanhoucke, who led the perception research and speech recognition quality team, to demonstrate the value of GPUs for training and deploying deep neural network architectures in the cloud focusing on speech recognition for Google Search by Voice.

Administrative and Professional Services

[edit]

University Administration

[edit]

Dean served as the Deputy Provost of Brown University from 2003 to 2005, as the chair of Brown's Computer Science Department from 1997 until 2002, and as the Acting Vice President for Computing and Information Services from 2001 until 2002. As Deputy Provost he helped develop and launch new multidisciplinary programs in genomics and the brain sciences as well as oversee substantial changes in the medical school and university libraries.

Professional Leadership

[edit]

Dean was named a fellow of AAAI in 1994 and an ACM fellow in 2009. He has served on the Executive Council of AAAI and the Computing Research Association Board of Directors. He was a recipient of an NSF Presidential Young Investigator Award in 1989. He served as program co-chair for the 1991 National Conference on Artificial Intelligence and the program chair for the 1999 International Joint Conference on Artificial Intelligence held in Stockholm. He was a founding member of the Academic Alliance of the National Center for Women and Information Technology and a former member of the IJCAI Inc. Board of Trustees.

References

[edit]
  1. ^ "Elected AAAI Fellows". AAAI. Retrieved September 3, 2023.
  2. ^ "ACM Fellows". awards.acm.org. Retrieved September 3, 2023.
  3. ^ a b c Dean, Thomas; Wellman, Michael (1991). Planning and Control. Morgan Kaufmann.
  4. ^ "Four Googlers elected ACM Fellows". 2009.
  5. ^ Thomas Dean publications indexed by Google Scholar
  6. ^ a b Dean, Thomas; Allen, James; Aloimonos, Yiannis (1995). Artificial Intelligence: Theory and Practice. Addison-Wesley.
  7. ^ Dean, Thomas (2004). Talking with Computers. Cambridge University Press.
  8. ^ "Tom Dean academic biography".
  9. ^ "Thomas L Dean, Stanford Bio".
  10. ^ Hendler, James (1995). "Book Review: Planning and Control by Thomas Dean and Michael Wellman". Artificial Intelligence. 73: 379–386. doi:10.1016/0004-3702(95)90045-4.
  11. ^ Dean, Thomas; Boddy, Mark (1988). "An Analysis of Time-Dependent Planning". Proceedings AAAI-88. Cambridge, Massachusetts: MIT Press. pp. 49–54.
  12. ^ Garvey, Alan; Lesser, Victor (1994). "A survey of research in deliberative real-time artificial intelligence". Real-Time Systems. 6 (3): 317–347. doi:10.1007/BF01088630. S2CID 16566928.
  13. ^ a b Dean, Thomas; Boddy, Mark (1987). "Incremental Causal Reasoning". Proceedings AAAI-87. Cambridge, Massachusetts: MIT Press. pp. 196–201.
  14. ^ a b Dean, Thomas; Givan, Robert; Leach, Sonia (1997). "Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes". In Geiger, Dan; Shenoy, Prakesh Pundalik (eds.). Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence. San Francisco, California: Morgan Kaufmann Publishers. pp. 124–131.
  15. ^ Dean, Thomas; Lin, Shieu-Hong (1995). "Decomposition Techniques for Planning in Stochastic Domains". Proceedings IJCAI-95. San Francisco, California: Morgan Kaufmann Publishers. pp. 1121–1127.
  16. ^ Dean, Thomas; Kaelbling, Leslie; Kirman, Jak; Nicholson, Ann (1993). "Planning With Deadlines in Stochastic Domains". Proceedings AAAI-93. Cambridge, Massachusetts: MIT Press. pp. 574–579.
  17. ^ Dean, Thomas; Kaelbling, Leslie; Kirman, Jak; Nicholson, Ann (1995). "Planning Under Time Constraints in Stochastic Domains". Artificial Intelligence. 76 (1–2): 35–74. doi:10.1016/0004-3702(94)00086-G.
  18. ^ Dean, Thomas; Kanazawa, Keiji (1989). "A Model for Reasoning About Persistence and Causation". Computational Intelligence. 5 (2): 142–150. doi:10.1111/j.1467-8640.1989.tb00324.x. S2CID 57798167.
  19. ^ Dean, Thomas; Kanazawa, Keiji (1988). "Probabilistic Causal Reasoning". Proceedings of the Canadian Society for Computational Studies of Intelligence. pp. 125–132.
  20. ^ a b Dean, Thomas; Kanazawa, Keiji (1989). "Persistence and Probabilistic Inference". IEEE Transactions on Systems, Man, and Cybernetics. 19: 574–585. doi:10.1109/21.31063.
  21. ^ a b Dean, T.; Kirman, J.; Kanazawa, K. (1992). "Probabilistic Network Representations of Continuous-Time Stochastic Processes for Applications in Planning and Control". In Hendler, James (ed.). Proceedings of the First International Conference on Artificial Intelligence Planning Systems (ICAPS-92). San Francisco, California: Morgan Kaufmann Publishers. pp. 273–274.
  22. ^ Dean, Thomas; Firby, R. James; Miller, David P. (1988). "Hierarchical Planning Involving Deadlines, Travel Time and Resources (Also appears in Readings in Planning (Morgan Kaufmann), edited by James Allen, James Hendler, and Austin Tate, and in Autonomous Mobile Robots: Control, Planning, and Architecture (IEEE Computer Society Press), edited by S. S. Iyengar and Alberto Elfes)". CIJ. 4: 381–398.
  23. ^ Hauskrecht, Milos; Meuleau, Nicolas; Boutilier, Craig; Kaelbling, Leslie Pack; Dean, Thomas (1998). "Hierarchical solution of Markov decision processes using macro-actions". Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98). San Francisco, California: Morgan Kaufmann Publishers. pp. 220–229.
  24. ^ Kim, Kee-Eung; Dean, Thomas (2003). "Solving Factored Markov Decision Processes Using Non-homogeneous Partitions". Artificial Intelligence. 147: 225–251. doi:10.1016/S0004-3702(02)00377-6.
  25. ^ Kim, Kee-Eung; Meuleau, Nicolas; Dean, Thomas (2000). "Approximate Solutions to Factored Markov Decision Processes via Greedy Search in the Space of Finite State Controllers". Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (ICAPS-2000). Menlo Park, California: AAAI Press. pp. 323–330.
  26. ^ Littman, Michael; Dean, Thomas; Kaelbling, Leslie (1995). "On the Complexity of Solving Markov Decision Problems". Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence. San Francisco, California: Morgan Kaufmann Publishers. pp. 394–402.
  27. ^ Dean, Thomas; Givan, Robert (1997). "Model Minimization in Markov Decision Processes". Proceedings AAAI-97. Cambridge, Massachusetts: MIT Press. pp. 106–111.
  28. ^ Dean, Thomas; Givan, Robert; Kim, Kee-Eung (1998). "Solving Planning Problems with Large State and Action Spaces". Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (ICAPS-98). pp. 102–110.
  29. ^ a b c Dean, Thomas; Ahanonu, Biafra; Chowdhury, Mainak; Datta, Anjali; Esteva, Andre; Eth, Daniel; Redmon, Nobie; Rumyantsev, Oleg; Tarter, Ysis (2013). "On the Technology Prospects and Investment Opportunities for Scalable Neuroscience". arXiv:1307.7302 [q-bio.NC].
  30. ^ Boutilier, Craig; Dean, Thomas; Hanks, Steven (1999). "Decision-Theoretic Planning: Structural Assumptions and Computational Leverage". Journal of Artificial Intelligence Research. 11: 1–94. arXiv:1105.5460. doi:10.1613/jair.575. S2CID 5297450.
  31. ^ Furbach, Ulrich (2003). "AI - A Multiple Book Review". Artificial Intelligence. 145 (1–2): 379–386. doi:10.1016/S0004-3702(03)00011-0.
  32. ^ "aaai robot competition: Topics by WorldWideScience.org". worldwidescience.org. Retrieved September 3, 2023.
  33. ^ Dean, Thomas; Bonasso, R. Peter (1993). "1992 AAAI Robot Exhibition and Competition". {AI} Magazine. 14: 35–48.
  34. ^ Dean, Thomas; Bonasso, R. Peter (1997). "A Retrospective on the AAAI Robot Competitions". {AI} Magazine. 18: 11–23.
  35. ^ Anderson, Monica; Chernova, Sonia; Dodds, Zachary; Thomaz, Andrea L.; Touretsky, David (2011). "Report on the AAAI 2010 Robot Exhibition". {AI} Magazine. 32 (3): 109–118.
  36. ^ Dean, Thomas (2017). "Inferring Mesoscale Models of Neural Computation". arXiv:1710.05183 [q-bio.NC].
  37. ^ Dean, Thomas; Chiang, Maurice; Gomez, Marcus; Gruver, Nate; Hindy, Yousef; Lam, Michelle; Lu, Peter; Sanchez, Sophia; Saxena, Rohun; Smith, Michael (2018). "Amanuensis: The Programmer's Apprentice". arXiv:1807.00082 [q-bio.NC].
  38. ^ Dean, Thomas; Fan, Chaofei; Lewis, Francis E.; Sano, Megumi (2019). "Biological Blueprints for Next Generation AI Systems". arXiv:1912.00421 [q-bio.NC].
  39. ^ Januszewski, Michal; Kornfeld, J"{o}rgen; Li, Peter H; Pope, Art; Blakely, Tim; Lindsey, Larry; Maitin-Shepard, Jeremy B; Tyka, Mike; Denk, Winfried; Jain, Viren (2017). "High-Precision Automated Reconstruction of Neurons with Flood-filling Networks". Nature Methods. 15 (8): 605–610. doi:10.1038/s41592-018-0049-4. PMID 30013046. S2CID 49863171.
  40. ^ Shapson-Coe, Alexander; Januszewski, Michał; Berger, Daniel R.; Pope, Art; Wu, Yuelong; Blakely, Tim; Schalek, Richard L.; Li, Peter; Wang, Shuohong; Maitin-Shepard, Jeremy (2021). "A connectomic study of a petascale fragment of human cerebral cortex". bioRxiv.
  41. ^ Xu, C. Shan; Januszewski, Michal; Lu, Zhiyuan; Takemura, Shin-ya; Hayworth, Kenneth J.; Huang, Gary; Shinomiya, Kazunori; Maitin-Shepard, Jeremy; Ackerman, David; Berg, Stuart (2020). "A Connectome of the Adult Drosophila Central Brain". bioRxiv.
  42. ^ "Releasing the Drosophila Hemibrain Connectome — The Largest Synapse-Resolution Map of Brain Connectivity". January 2020.
  43. ^ "A Browsable Petascale Reconstruction of the Human Cortex". June 2021.
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Thomas_Dean_(computer_scientist)&oldid=1254079436"