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:20240329T022948Z 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
\nIn this talk\, I will present a simple extension of i mage-based Masked Autoencoders (MAE) to self-supervised representation lea rning from audio spectrograms. Following the Transformer encoder-decoder d esign in MAE\, our Audio-MAE first encodes audio spectrogram patches with a high masking ratio\, feeding only the non-masked tokens through encoder layers. The decoder then re-orders and decodes the encoded context padded with mask tokens\, in order to reconstruct the input spectrogram. We find it beneficial to incorporate local window attention in the decoder\, as au dio spectrograms are highly correlated in local time and frequency bands. We then fine-tune the encoder with a lower masking ratio on target dataset s. Empirically\, Audio-MAE sets new state-of-the-art performance on six au dio and speech classification tasks\, outperforming other recent models th at use external supervised pre-training.
\nBio
\nFlorian Metze is a Research Scientist Manager at Meta AI in New York\ , supporting a team of researchers and engineers working on multi-modal (i mage\, video\, audio\, text) content understanding for Meta’s Family of Ap ps (Instagram\, Threads\, Facebook\, WhatsApp). He used to be an Associate Research Professor at Carnegie Mellon University\, in the School of Compu ter Science’s Language Technologies Institute\, where he still is an Adjun ct Professor. He is also a co-founder of Abridge\, a company working on ex tracting information from doctor patient conversations. His work covers ma ny areas of speech recognition and multi-media analysis with a focus on en d-to-end deep learning. Currently\, he focuses on multi-modal processing o f videos\, and using that information to recommend unconnected content. In the past\, he has worked on low resource and multi-lingual speech process ing\, speech recognition with articulatory features\, large-scale multi-me dia retrieval and summarization\, information extraction from medical inte rviews\, and recognition of personality or similar meta-data from speech.< /p>\n
For more information\, please see http://www.cs.cmu.edu/directory/fmetze
\n\n X-TAGS;LANGUAGE=en-US:2023\,Metze\,November END:VEVENT END:VCALENDAR