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:20240328T220302Z 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
\nNatural language provides an intuitive and powerful i nterface to access knowledge at scale. Modern language systems draw inform ation from two rich knowledge sources: (1) information stored in their par ameters during massive pretraining and (2) documents retrieved at inferenc e time. Yet\, we are far from building systems that can reliably provide i nformation from such knowledge sources. In this talk\, I will discuss path s for more robust systems. In the first part of the talk\, I will present a module for scaling retrieval-based knowledge augmentation. We learn a co mpressor that maps retrieved documents into textual summaries prior to in- context integration. This not only reduces the computational costs but als o filters irrelevant or incorrect information. In the second half of the t alk\, I will discuss the challenges of updating knowledge stored in model parameters and propose a method to prevent models from reciting outdated i nformation by identifying facts that are prone to rapid change. I will con clude my talk by proposing an interactive system that can elicit informati on from users when needed.
\nBiography
\nEunsol Choi is an assistant professor in the Computer Scie nce department at the University of Texas at Austin. Prior to UT\, she spe nt a year at Google AI as a visiting researcher. Her research area spans n atural language processing and machine learning. She is particularly inter ested in interpreting and reasoning about text in a dynamic real world con text. She is a recipient of a Facebook research fellowship\, Google facult y research award\, Sony faculty award\, and an outstanding paper award at EMNLP. She received a Ph.D. in computer science and engineering from Unive rsity of Washington and B.A in mathematics and computer science from Corne ll University.
\n\n X-TAGS;LANGUAGE=en-US:2024\,Choi\,March END:VEVENT END:VCALENDAR