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!

Probably Approximately Correct Learners
Claim This Podcastby Chara Podimata
Podcast Authority
Beta
Podcast Overview
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!
Language
🇺🇲
Publishing Since
8/13/2024
Unlock The Full Podcast Authority Score Report
See how your podcast performs across key metrics
Podcast Authority
Beta
Recommendations available
Unlock the full report to see detailed tips
Recommendations available
Unlock the full report to see detailed tips
Unlock comprehensive insights including:
- • YouTube presence analysis
- • Social media reach metrics
- • RSS compliance scoring
- • Podcast 2.0 features
- • Technical standards
Detailed Analytics
- Complete breakdown of all 19 authority metrics
- Personalized recommendations for each metric
- Industry benchmarks and comparisons
- Technical RSS feed analysis and compliance scoring
Growth Strategies
- Step-by-step action plans for improvement
- Quick wins to boost your score immediately
- Pro tips from successful podcasters
See how your show performs across every key metric
High authority scores make your podcast more attractive to industry leaders and influencers who want to appear on credible shows.
Sponsors look for podcasts with proven authority and engagement. Your score demonstrates your podcast's value to potential partners.
Understanding your strengths and weaknesses helps you make data-driven decisions to expand your listener base effectively.
2 verified contact emails on file for Probably Approximately Correct Learners
Pitch yourself as a guest, propose sponsorships, or reach out directly to the host.
Recent Episodes

June 24, 2026
Ep. 5: Hamsa Bastani
<p>Welcome to another episode of Probably Approximately Correct Learners! This time, I'm joined by Hamsa Bastani. </p><p><br></p><p>Hamsa is an Associate Professor of Operations, Information, and Decisions (OID) and Statistics and Data Science at the Wharton School of the University of Pennsylvania, where she co-directs the <a href="https://analytics.wharton.upenn.edu/wharton-healthcare-analytics-lab/" target="“blank”">Wharton Healthcare Analytics Lab</a>. Her research sits at the intersection of machine learning, operations research, and economics. She studies how to design, deploy, and evaluate AI systems that empower human decision-makers and improve societal outcomes.</p><p><br></p><p>She aims to combine methodological depth with implementation in consequential environments. She has worked with national governments to deploy algorithms at the country scale for targeted border COVID-19 screening and essential medicine access, and she co-led one of the first large field studies of generative AI tutors in high school mathematics. She studies both the mathematical properties of algorithms and the way people respond to them.</p><p>Her research has been published in leading outlets including Nature, Management Science, Operations Research, and PNAS, and has garnered numerous recognitions, including the Wagner Prize for Excellence in Operations Research, the INFORMS Pierskalla Award for best healthcare paper, and the George Nicholson Prize. Previously, she graduated summa cum laude from Harvard in 2012 with an A.M. in physics and an A.B. in physics and mathematics, completed her PhD in Stanford's Electrical Engineering department under the supervision of <a href="https://web.stanford.edu/~bayati" target="“blank”">Mohsen Bayati</a>, and spent a year as a Herman Goldstine postdoctoral fellow at IBM Research.</p><p>Outside academia, she serves on the <a href="https://explore.workday.com/workday-ai-advisory-board" target="“blank”">Workday AI Advisory Board</a>.</p>

April 2, 2026
Ep. 4: Nicole Immorlica
<p>Welcome to Probably Approximately Correct Learners, episode 4! In this episode, Chara chats with Prof. Nicole Immorlica.</p><p><br></p><p>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.</p><p><br></p><p>Nicole and I talked about this paper: <a href="https://arxiv.org/pdf/2502.20783">https://arxiv.org/pdf/2502.20783</a>.</p>

September 12, 2025
Ep. 3: Sam Hopkins
<p>Welcome to Probably Approximately Correct Learners Episode 3! In this episode, Chara chats with Professor Sam Hopkins.</p><p><br /></p><p>Sam is a theoretical computer scientist and Assistant Professor at MIT, in the <a href="https://toc.csail.mit.edu/" rel="ugc noopener noreferrer" target="_blank">Theory of Computing</a> group in the <a href="https://www.eecs.mit.edu/" rel="ugc noopener noreferrer" target="_blank">Department of Electrical Engineering and Computer Science</a>, where he holds the Jamieson Career Development Chair. His interests include algorithms, theory of machine learning, semidefinite programming, sum of squares method, and bicycles.</p><p><br /></p><p>Before MIT, he was a <a href="http://miller.berkeley.edu/" rel="ugc noopener noreferrer" target="_blank">Miller</a> fellow in the <a href="http://theory.cs.berkeley.edu/" rel="ugc noopener noreferrer" target="_blank">theory of computing group</a> at UC Berkeley, hosted by <a href="https://people.eecs.berkeley.edu/~prasad/" rel="ugc noopener noreferrer" target="_blank">Prasad Raghavendra</a> and <a href="https://lucatrevisan.github.io/" rel="ugc noopener noreferrer" target="_blank">Luca Trevisan</a>. Before that, he got his PhD at <a href="https://www.cs.cornell.edu/research/theory" rel="ugc noopener noreferrer" target="_blank">Cornell</a>, advised by <a href="http://www.dsteurer.org/" rel="ugc noopener noreferrer" target="_blank">David Steurer</a>.</p>
5 total episodes available
Deep-dive analytics for Probably Approximately Correct Learners
Frequently asked questions
Have a different question and can't find the answer you're looking for? Reach out to our support team by sending us an email and we'll get back to you as soon as we can.
- What is Probably Approximately Correct Learners?
- How often does this podcast release new episodes?
This podcast updates weekly.
- Where can I listen to this podcast?
This podcast is available on 8 platforms including Apple Podcasts, Spotify, and more. You can also use the RSS feed directly.
- Does this podcast accept guests?
Yes, this podcast regularly features guests.
Legal Disclaimer
Pod Engine is not affiliated with, endorsed by, or officially connected with any of the podcasts displayed on this platform. We operate independently as a podcast discovery and analytics service.
All podcast artwork, thumbnails, and content displayed on this page are the property of their respective owners and are protected by applicable copyright laws. This includes, but is not limited to, podcast cover art, episode artwork, show descriptions, episode titles, transcripts, audio snippets, and any other content originating from the podcast creators or their licensors.
We display this content under fair use principles and/or implied license for the purpose of podcast discovery, information, and commentary. We make no claim of ownership over any podcast content, artwork, or related materials shown on this platform. All trademarks, service marks, and trade names are the property of their respective owners.
While we strive to ensure all content usage is properly authorized, if you are a rights holder and believe your content is being used inappropriately or without proper authorization, please contact us immediately at hey@podengine.ai for prompt review and appropriate action, which may include content removal or proper attribution.
By accessing and using this platform, you acknowledge and agree to respect all applicable copyright laws and intellectual property rights of content owners. Any unauthorized reproduction, distribution, or commercial use of the content displayed on this platform is strictly prohibited.