CS Colloquium speaker Feras Saad: TODAY at 12:30pm
Speaker: Feras Saad, Massachusetts Institute of Technology Date: Thursday, March 31, 2022 Time: 12:30pm EST Location: CS 105 Host: Ryan Adams Event page: https://www.cs.princeton.edu/events/26183 This talk will be live-streamed at https://mediacentrallive.princeton.edu/ Title: Scalable Structure Learning and Inference via Probabilistic Programming Abstract: Probabilistic programming supports probabilistic modeling, learning, and inference by representing sophisticated probabilistic models as computer programs in new programming languages. This talk presents efficient probabilistic programming-based techniques that address two fundamental challenges in scaling and automating structure learning and inference over complex data. First, I will describe scalable structure learning methods that make it possible to automatically synthesize probabilistic programs in an online setting by performing Bayesian inference over hierarchies of flexibly structured symbolic program representations, for discovering models of time series data, tabular data, and relational data. Second, I will present fast compilers and symbolic analyses that compute exact answers to a broad range of inference queries about these learned programs, which lets us extract interpretable patterns and make accurate predictions in real time. I will demonstrate how these techniques deliver state-of-the-art performance in terms of runtime, accuracy, robustness, and programmability by drawing on several examples from real-world applications, which include adapting to extreme novelty in economic time series, online forecasting of flu rates given sparse multivariate observations, discovering stochastic motion models of zebrafish hunting, and verifying the fairness of machine learning classifiers. Bio: Feras Saad is a PhD candidate in Computer Science at MIT working at the intersection of programming languages, probabilistic machine learning, and computational statistics. His research is accompanied with a collection of popular open-source probabilistic programming systems used by collaborators at Intel, Takeda, Liberty Mutual, IBM, and the Bill & Melinda Gates Foundation for practical applications of structure learning and probabilistic inference. Feras' MEng thesis on probabilistic programming and data science has been recognized with the 1st Place Computer Science Thesis Award at MIT.
CS Colloquium Speaker Speaker: Tej Chajed, Massachusetts Institute of Technology Date: Monday, April 4, 2022 Time: 12:30pm EST Location: CS 105 Host: Amit Levy Event page: [ https://www.cs.princeton.edu/events/26180 | https://www.cs.princeton.edu/events/26180 ] This talk will be live-streamed at [ https://mediacentrallive.princeton.edu/ | https://mediacentrallive.princeton.edu/ ] Title: Formal verification of a concurrent file system Abstract: Bugs in systems software like file systems, databases, and operating systems can have serious consequences, ranging from security vulnerabilities to data loss, and these bugs affect all the applications built on top. Systems verification is a promising approach to improve the reliability of our computing infrastructure, since it can eliminate whole classes of bugs through machine-checked proofs that show a system always meets its specification. In this talk, I’ll present a line of work culminating in a verified, concurrent file system called DaisyNFS. The file system comes with a proof that shows operations appear to execute correctly and atomically (that is, all-or-nothing), even if the computer crashes and when processing concurrent operations. I’ll describe how a combination of design and verification techniques make it possible to carry out the proof for an efficient implementation. Bio: Tej Chajed is a final-year PhD student at MIT advised by Frans Kaashoek and Nickolai Zeldovich. His research is on systems verification, ranging from developing new foundations through designing and verifying high-performance systems. Before MIT, he completed his undergraduate degree in Electrical Engineering and Computer Science at UIUC. His work has been in part supported by an NSF graduate research fellowship.
participants (1)
-
Emily C. Lawrence