Dana Angluin

Dana Angluin is a professor of computer science at Yale University. She contributed to the foundations of computational learning theory.

Dana Angluin
Alma materUniversity of California, Berkeley
Known forL* Algorithm
Query learning
Exact learning
Scientific career
FieldsComputer Science Machine Learning
InstitutionsYale University
ThesisAn Application of the Theory of Computational Complexity to the Study of Inductive Inference (1976)
Doctoral advisorManuel Blum[1]
Doctoral studentsEhud Shapiro

Education

Angluin received her B.S. and Ph.D. at University of California, Berkeley. Her thesis, entitled "An application of the theory of computational complexity to the study of inductive inference"[2] was one of the first works to apply complexity theory to the field of inductive inference.[3]

Career

Angluin joined the faculty at Yale in 1979.[3]

Dana Angluin has authored many papers and been a pioneer in many fields specifically learning regular sets from queries and counterexamples, robot navigation with distance queries, self-stabilizing universal algorithms and query learning of regular tree languages.[3][4] A lot of Angluin's work involves queries, a field in which she has made many great contributions. Angluin also has worked in the field of robotics as well dealing with navigation with distance queries.[3]

Professor Angluin is interested in machine learning and computational learning theory. Algorithmic modeling and analysis of learning tasks gives insight into the phenomena of learning, and suggests avenues for the creation of tools to help people learn, and for the design of "smarter" software and artificial agents that flexibly adapt their behavior. Professor Angluin's thesis[4] was among the first work to apply computational complexity theory to the field of inductive inference. Her work on learning from positive data reversed a previous dismissal of that topic, and established a flourishing line of research. Her work on learning with queries established the models and the foundational results for learning with membership queries. Recently, her work has focused on the areas of coping with errors in the answers to queries, map-learning by mobile robots, and fundamental questions in modeling the interaction of a teacher and a learner.

Professor Angluin helped found the Computational Learning Theory (COLT) conference, and has served on program committees for COLT[5][6][7] and on the COLT Steering committee. She served as an area editor for Information and Computation from 1989–1992.[8][9] She organized Yale's Computer Science Department's Perlis Symposium in April 2001: "From Statistics to Chat: Trends in Machine Learning".[10] She is a member of the Association for Computing Machinery and the Association for Women in Mathematics.

Angluin has also published works on Ada Lovelace and her involvement with the Analytical Engine.[11]

Work

Representative Publications:

  • Dana Angluin (Nov 2001). "Queries revisited (Invited paper)". In Naoki Abe; Roni Khardon; Thomas Zeugmann (eds.). Algorithmic Learning Theory – 12th International Conference. LNCS. 2225. Springer. pp. 12–31.
  • Dana Angluin; Jeffery Westbrook; Wenhong Zhu (2000). "Robot navigation with distance queries". SIAM Journal on Computing. 30 (1): 110–144. CiteSeerX 10.1.1.44.9279. doi:10.1137/S0097539797330057.
  • Dana Angluin (1987). "Learning Regular Sets from Queries and Counter-Examples" (PDF). Information and Control. 75 (2): 87–106. doi:10.1016/0890-5401(87)90052-6. Archived from the original (PDF) on 2013-12-02.
  • Dana Angluin (Aug 1987). Learning k-Bounded Context-Free Grammars (PDF) (Technical report). Yale University. p. 13. 557.
  • Dana Angluin (1980). "Finding Patterns Common to a Set of Strings". Journal of Computer and System Sciences. 21: 46–62. doi:10.1016/0022-0000(80)90041-0.
  • Dana Angluin (1980). "Inductive Inference of Formal Languages from Positive Data" (PDF). Information and Control. 45 (2): 117–135. doi:10.1016/s0019-9958(80)90285-5.
  • Dana Angluin (1976). An Application of the Theory of Computational Complexity to the Study of Inductive Inference (Ph.D.). University of California at Berkeley.
gollark: dodecahedron
gollark: Huh.
gollark: this is not a good haiku
gollark: dodecahedron
gollark: dodecahedron

See also
  • Automata Theory

References
  1. Dana Angluin at the Mathematics Genealogy Project
  2. Angluin, Dana Charmian (1976). An Application of the Theory of Computational Complexity to the Study of Inductive Inference (PhD Thesis thesis). University of California, Berkeley.
  3. "Dana Angluin, B.A., Ph.D. University of California at Berkeley, 1969, 1976. Joined Yale Faculty 1979. | Computer Science". cpsc.yale.edu. Retrieved 2016-12-11.
  4. D Angluin (1976). "An Application of the Theory of Computational Complexity to the Study of Inductive Inference." Available from ProQuest Dissertations & Theses Global. (302813707)
  5. , COLT '89 Proceedings
  6. , COLT '02 Proceedings
  7. , COLT '08 Proceedings
  8. "Editorial Board". Information and Computation. 82 (1): i. 1989. doi:10.1016/0890-5401(89)90061-8.
  9. "Editorial Board". Information and Computation. 99 (1): i. 1992. doi:10.1016/0890-5401(92)90023-9.
  10. "Symposium will explore 'trends in machine learning'". Yale Bulletin and Calendar. April 20, 2001. Archived from the original on April 18, 2009.
  11. Case, Bettye Anne; Leggett, Anne M. (2005). Complexities: Women in Mathematics. Princeton University Press. p. 60. ISBN 9781400880164.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.