Cover image of show Probably Approximately Correct Learners

Probably Approximately Correct Learners

Podcast by Chara Podimata

English

Technology & science

Limited Offer

2 months for 19 kr.

Then 99 kr. / monthCancel anytime.

  • 20 hours of audiobooks / month
  • Podcasts only on Podimo
  • All free podcasts
Get Started

About Probably Approximately Correct Learners

Welcome to Probably Approximately Correct Learners, a podcast from the Learning Theory Alliance team. In this podcast, we will dive deep into the minds of leading researchers in Machine Learning! Join us for engaging interviews that explore a diverse range of topics—from groundbreaking research findings to the experiences and insights that shape life beyond academia. Whether you're a seasoned expert or just starting your journey in the field, this podcast is your gateway to understanding the evolving landscape of Machine Learning. Tune in and broaden your perspective with each episode!

All episodes

4 episodes

episode Ep. 4: Nicole Immorlica artwork

Ep. 4: Nicole Immorlica

Welcome to Probably Approximately Correct Learners, episode 4! In this episode, Chara chats with Prof. Nicole Immorlica. Nicole Immorlica is a Professor of Computer Science at Yale University and a Researcher at Microsoft.  She received her BS in 2000, MEng in 2001 and PhD in 2005 in theoretical computer science from MIT in Cambridge, MA.  She joined MSR NE in 2012 after completing postdocs at Microsoft in Redmond, WA and Centruum vor Wiskunde en Informatics (CWI) in Amsterdam, Netherlands, and a professorship in computer science at Northwestern University.  Nicole’s research interest is in the design and operation of sociotechnical systems. Using tools and modeling concepts from both theoretical computer science and economics, Nicole hopes to explain, predict, and shape behavioral patterns in various online and offline systems, markets, and games. She is known for her work on social networks, matching markets, and mechanism design.  She is the recipient of a number of fellowships and awards including ACM Fellow, the Sloan Fellowship, the Microsoft Faculty Fellowship and the NSF CAREER Award.  She has been on several boards including SIGecom, SIGACT, the Game Theory Society, and OneChronos; is an associate editor of Operations Research and Transactions on Economics and Computation, and was program committee member and chair for several ACM, IEEE and INFORMS conferences in her area. Nicole and I talked about this paper: https://arxiv.org/pdf/2502.20783 [https://arxiv.org/pdf/2502.20783].

2 Apr 2026 - 47 min
episode Ep. 3: Sam Hopkins artwork

Ep. 3: Sam Hopkins

Welcome to Probably Approximately Correct Learners Episode 3! In this episode, Chara chats with Professor Sam Hopkins. Sam is a theoretical computer scientist and Assistant Professor at MIT, in the Theory of Computing [https://toc.csail.mit.edu/] group in the Department of Electrical Engineering and Computer Science [https://www.eecs.mit.edu/], where he holds the Jamieson Career Development Chair. His interests include algorithms, theory of machine learning, semidefinite programming, sum of squares method, and bicycles. Before MIT, he was a Miller [http://miller.berkeley.edu/] fellow in the theory of computing group [http://theory.cs.berkeley.edu/] at UC Berkeley, hosted by Prasad Raghavendra [https://people.eecs.berkeley.edu/~prasad/] and Luca Trevisan [https://lucatrevisan.github.io/]. Before that, he got his PhD at Cornell [https://www.cs.cornell.edu/research/theory], advised by David Steurer [http://www.dsteurer.org/].

12 Sep 2025 - 1 h 1 min
episode Ep. 1: Jamie Morgenstern artwork

Ep. 1: Jamie Morgenstern

Welcome to our first ever Probably Approximately Correct Learners episode! In this episode, Chara chats with Professor Jamie Morgenstern (UW). Jamie is an assistant professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. She was previously an assistant professor in the School of Computer Science at Georgia Tech. Prior to starting as faculty, she was hosted by Michael Kearns, Aaron Roth, and Rakesh Vohra as a Warren Center fellow at the University of Pennsylvania. She completed her PhD working with Avrim Blum at Carnegie Mellon University. She studies the social impact of machine learning and the impact of social behavior on ML's guarantees. For example, how should machine learning be made robust to behavior of the people generating training or test data for it? And, how should ensure that the models we design do not exacerbate inequalities already present in society? You can find more information about Jamie and her research on her website: https://jamiemorgenstern.com/. Jamie and Chara talked about this paper: https://arxiv.org/abs/2206.02667.

13 Aug 2024 - 42 min
Sign up to listen
En fantastisk app med et enormt stort udvalg af spændende podcasts. Podimo formår virkelig at lave godt indhold, der takler de lidt mere svære emner. At der så også er lydbøger oveni til en billig pris, gør at det er blevet min favorit app.
En fantastisk app med et enormt stort udvalg af spændende podcasts. Podimo formår virkelig at lave godt indhold, der takler de lidt mere svære emner. At der så også er lydbøger oveni til en billig pris, gør at det er blevet min favorit app.
Rigtig god tjeneste med gode eksklusive podcasts og derudover et kæmpe udvalg af podcasts og lydbøger. Kan varmt anbefales, om ikke andet så udelukkende pga Dårligdommerne, Klovn podcast, Hakkedrengene og Han duo 😁 👍
Podimo er blevet uundværlig! Til lange bilture, hverdagen, rengøringen og i det hele taget, når man trænger til lidt adspredelse.

Choose your subscription

Most popular

Limited Offer

Premium

20 hours of audiobooks

  • Podcasts only on Podimo

  • No ads in Podimo shows

  • Cancel anytime

2 months for 19 kr.
Then 99 kr. / month

Get Started

Premium Plus

Unlimited audiobooks

  • Podcasts only on Podimo

  • No ads in Podimo shows

  • Cancel anytime

Start 7 days free trial
Then 129 kr. / month

Start for free

Only on Podimo

Popular audiobooks

Get Started

2 months for 19 kr. Then 99 kr. / month. Cancel anytime.