BEGIN:VCALENDAR VERSION:2.0 PRODID:-//128.220.36.25//NONSGML kigkonsult.se iCalcreator 2.26.9// CALSCALE:GREGORIAN METHOD:PUBLISH X-FROM-URL:https://www.clsp.jhu.edu X-WR-TIMEZONE:America/New_York BEGIN:VTIMEZONE TZID:America/New_York X-LIC-LOCATION:America/New_York BEGIN:STANDARD DTSTART:20231105T020000 TZOFFSETFROM:-0400 TZOFFSETTO:-0500 RDATE:20241103T020000 TZNAME:EST END:STANDARD BEGIN:DAYLIGHT DTSTART:20240310T020000 TZOFFSETFROM:-0500 TZOFFSETTO:-0400 RDATE:20250309T020000 TZNAME:EDT END:DAYLIGHT END:VTIMEZONE BEGIN:VEVENT UID:ai1ec-22395@www.clsp.jhu.edu DTSTAMP:20240329T064458Z CATEGORIES;LANGUAGE=en-US:Seminars CONTACT: DESCRIPTION:Abstract\nRecursive calls over recursive data are widely useful for generating probability distributions\, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also useful\, but unfortunately\, ex isting probabilistic programming languages do not perform exact inference on recursive calls over recursive data\, forcing programmers to code many applications manually. We introduce a probabilistic language in which a wi de variety of recursion can be expressed naturally\, and inference carried out exactly. For instance\, probabilistic pushdown automata and their gen eralizations are easy to express\, and polynomial-time parsing algorithms for them are derived automatically. We eliminate recursive data types usin g program transformations related to defunctionalization and refunctionali zation. These transformations are assured correct by a linear type system\ , and a successful choice of transformations\, if there is one\, is guaran teed to be found by a greedy algorithm. I will also describe the implement ation of this language in two phases: first\, compilation to a factor grap h grammar\, and second\, computing the sum-product of the factor graph gra mmar.\n\nBiography\nDavid Chiang (PhD\, University of Pennsylvania\, 2004) is an associate professor in the Department of Computer Science and Engin eering at the University of Notre Dame. His research is on computational m odels for learning human languages\, particularly how to translate from on e language to another. His work on applying formal grammars and machine le arning to translation has been recognized with two best paper awards (at A CL 2005 and NAACL HLT 2009). He has received research grants from DARPA\, NSF\, Google\, and Amazon\, has served on the executive board of NAACL and the editorial board of Computational Linguistics and JAIR\, and is curren tly on the editorial board of Transactions of the ACL. DTSTART;TZID=America/New_York:20221017T120000 DTEND;TZID=America/New_York:20221017T131500 LOCATION:Hackerman Hall B17 @ 3400 N. Charles Street\, Baltimore\, MD 21218 SEQUENCE:0 SUMMARY:David Chiang (University of Notre Dame) “Exact Recursive Probabilis tic Programming with Colin McDonald\, Darcey Riley\, Kenneth Sible (Notre Dame) and Chung-chieh Shan (Indiana)” URL:https://www.clsp.jhu.edu/events/david-chiang-university-of-notre-dame/ X-COST-TYPE:free X-ALT-DESC;FMTTYPE=text/html:\\n\\n
\\nAbstr act
\nAbstr act
\nModern learning architectures for natural language processing have been very successful in incorporating a huge amount of texts into their parameters. However\, by and large\, such models store and use knowledge in distributed and decentralized ways. This proves unreliable and makes the models ill-suited for knowledge-intensive tasks that require reasoning over factual information in linguistic expre ssions. In this talk\, I will give a few examples of exploring alternativ e architectures to tackle those challenges. In particular\, we can improve the performance of such (language) models by representing\, storing and a ccessing knowledge in a dedicated memory component.
\nThis talk is based on several joint works with Yury Zemlyanskiy (Goo gle Research)\, Michiel de Jong (USC and Google Research)\, William Cohen (Google Research and CMU) and our other collaborators in Google Research.< /p>\n
Biography
\nFei is a research scientist at Google Research. Before that\, he was a Professor of Computer Science at U niversity of Southern California. His primary research interests are machi ne learning and its application to various AI problems: speech and languag e processing\, computer vision\, robotics and recently weather forecast an d climate modeling. He has a PhD (2007) from Computer and Information Sc ience from U. of Pennsylvania and B.Sc and M.Sc in Biomedical Engineering from Southeast University (Nanjing\, China).
\n X-TAGS;LANGUAGE=en-US:2022\,October\,Sha END:VEVENT END:VCALENDAR