Dana Angluin




































Dana Angluin
Alma mater University of California, Berkeley
Known for L* Algorithm
Query learning
Exact learning
Scientific career
Fields
Computer Science Machine Learning
Institutions Yale University
Thesis
An Application of the Theory of Computational Complexity to the Study of Inductive Inference (1976)
Doctoral advisor
Manuel Blum[1]
Doctoral students Ehud Shapiro


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




Contents






  • 1 Education


  • 2 Career


  • 3 Work


  • 4 See also


  • 5 References


  • 6 External links





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" was one of the first works to apply complexity theory to the field of inductive inference.



Career


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


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] Angluin is highly regarded as one of the best researchers in her field of Computer Science. Angluin continues to make more progress in her chosen field of queries at Yale.[3]



Work


Representative Publications:




  • Dana Angluin (Nov 2001). "Queries revisited (Invited paper)". In Naoki Abe; Roni Khardon; Thomas Zeugmann. Algorithmic Learning Theory – 12th International Conference. LNCS. 2225. Springer. pp. 12–31..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}


  • 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" (PDF). 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.
    [4]


  • Dana Angluin (1976). An Application of the Theory of Computational Complexity to the Study of Inductive Inference (Ph.D.). University of California at Berkeley.



See also


  • Automata Theory


References





  1. ^ Dana Angluin at the Mathematics Genealogy Project


  2. ^ "Dana Angluin, B.A., Ph.D. University of California at Berkeley, 1969, 1976. Joined Yale Faculty 1979". Yale University Computer Science. Retrieved 12 April 2017.


  3. ^ abc "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. ^ ab 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. ^ [1], COLT '89 Proceedings


  6. ^ [2], COLT '02 Proceedings


  7. ^ [3], 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. (2016-05-31). Complexities: Women in Mathematics. Princeton University Press. ISBN 9781400880164.




External links



  • Angluin's home page at Yale University

  • Angluin's Google Scholar listing









-

Popular posts from this blog

Eastern Orthodox Church

Image
Not to be confused with Oriental Orthodoxy, Eastern Christianity, or Eastern Catholic Churches. "Eastern Orthodoxy", "Orthodox Church", "Orthodox Catholic Church", and "Orthodox Christian Church" redirect here. For other uses, see Orthodox (disambiguation). This article may be too long to read and navigate comfortably . The readable prose size is 132 kilobytes. Please consider splitting content into sub-articles, condensing it, or adding or removing subheadings. ( January 2018 ) Part of a series on the Eastern Orthodox Church Mosaic of Christ Pantocrator, Hagia Sophia Overview Structure Theology (History of theology) Liturgy Church history Holy Mysteries View of salvation View of Mary View of icons Background Crucifixion / Resurrection / Ascension of Jesus Christianity Christian Church Apostolic succession Four Marks of the Church Orthodoxy Organization Autocephaly Patriarchate ...
Read more

Zagreb

Image
This article is about the Croatian capital city. For other uses, see Zagreb (disambiguation). City in City of Zagreb, Croatia Zagreb City Grad Zagreb City of Zagreb Clockwise, from top: St. Mark's Square, Croatian State Archives, Zagreb Tram, Art Pavilion, Cibona & HOTO towers and Croatian National Theatre. Flag Coat of arms Zagreb Location of Zagreb in Croatia Show map of Croatia Zagreb Zagreb (Europe) Show map of Europe Coordinates: 45°49′N 15°59′E  /  45.817°N 15.983°E  / 45.817; 15.983 Coordinates: 45°49′N 15°59′E  /  45.817°N 15.983°E  / 45.817; 15.983 Country   Croatia County City of Zagreb RC diocese 1094 Free royal city 1242 Unified 1850 Subdivisions 17 city districts 218 local committees (70 settlements) Government  • Type Mayor-Council  • Mayor Milan Bandić (BM 365)  • City Assembly 51 members BM 365, ZL, NS-R (14) SDP, GLAS, HNS, HSS, NH-PS (13) ...
Read more

Understanding the information contained in the Deep Space Network XML data?

Image
up vote 1 down vote favorite NASA's Deep Space Network activity can be viewed conveniently at https://eyes.nasa.gov/dsn/dsn.html but if you would like data in a more raw XML form, it can be accessed as described in this answer Below is a small Python script that reads the XML into a list of dictionaries, and saves it to disk as a JSON. The dictionaries are organized at the higher level by dish, then by spacecraft per dish. Question: What are the most-likely meanings of all the data field contained in the Deep Space Network XML data? This is the example url from the other answer, used in the script below: https://eyes.nasa.gov/dsn/data/1365107113.xml def dictify(r,root=True): # https://stackoverflow.com/questions/2148119/how-to-convert-an-xml-string-to-a-dictionary-in-python/30923963#30923963 if root: ret...
Read more