Home Podcasts AI Bites: The Academic Series
AI Bites: The Academic Series

AI Bites: The Academic Series

Jack Lakkapragada 79 episodes Oct 23, 2026

AI Bites: The Academic Series offers AI-generated deep dives into some of the world’s most prestigious computer science curricula. The episodes draw on personal study notes and publicly available course material from Stanford University courses such as CS124 and CS221. Using Google’s NotebookLM, the show turns dense academic topics into conversational summaries designed for learning on the go. It is an independent, AI-generated study resource and is not officially affiliated with Stanford University.

Episodes

VIDEO SHORT | MIT 6.036: Why AI Uses Random Noise to Learn Faster
VIDEO SHORT | MIT 6.036: Why AI Uses Random Noise to Learn Faster Oct 23, 2026 01:20 Why do the world's most powerful AI models rely on random noise to find optimal solutions? Because pure mathematical certainty gets trapped in local valleys! Discover why Stochastic Gradient Descent takes instant steps on single random data points—and how this "noisy bouncing" helps AI escape local traps and generalize better in under 60 seconds.Key Topics:Batch Gradient Descent vs.
VIDEO | MIT 6.036: Visualizing Gradient Descent & SGD Loss Landscapes
VIDEO | MIT 6.036: Visualizing Gradient Descent & SGD Loss Landscapes Oct 23, 2026 11:25 Watch the geometry of optimization come to life in Week 5 of MIT 6.036. We visually animate parameter trajectories rolling down 3D loss surfaces, demonstrate how overshooting step sizes cause wild oscillations, compare convex bowls against non-convex local traps, and visually map out the bouncing, noisy trajectory of Stochastic Gradient Descent vs. full Batch GD.Key Topics:Visualizing 3D loss land
Title: EP 61 | MIT 6.036: Gradient Descent & Optimization in Practice
Title: EP 61 | MIT 6.036: Gradient Descent & Optimization in Practice Oct 23, 2026 32:39 Welcome to Week 5 of MIT 6.036! Now that we've framed machine learning as loss minimization, how do we actually find the parameters that sit at the bottom of the bowl? We explore the geometry of loss landscapes, analyze step-size dynamics, derive analytical gradients for Logistic Regression, and examine why Stochastic Gradient Descent (SGD) uses random noise to outpace traditional Batch GD.Key
VIDEO SHORT | MIT 6.036: Why Step Functions Break AI Optimization
VIDEO SHORT | MIT 6.036: Why Step Functions Break AI Optimization Oct 22, 2026 01:27 Why do modern AI models output smooth probabilities instead of plain yes-or-no decisions? Because step functions break calculus! Discover why $0\text{--}1$ loss results in zero gradients everywhere, and how the Sigmoid function allows gradient-based algorithms to learn smoothly in under 60 seconds.Key Topics:The mathematical flaw of $0\text{--}1$ step loss.Smooth gradients via the Sigmoid curve $\
VIDEO | MIT 6.036: Visualizing Logistic Regression & Loss Landscapes
VIDEO | MIT 6.036: Visualizing Logistic Regression & Loss Landscapes Oct 22, 2026 12:22 Watch the mathematics of optimization come alive in Week 4 of MIT 6.036. We graphically demonstrate why traditional $0\text{--}1$ step-loss fails calculus due to flat zero gradients, animate the smooth continuous Sigmoid curve $\sigma(z) = \frac{1}{1 + e^{-z}}$, and visually step through the derivation of Negative Log-Likelihood (NLL) loss.Key Topics:Visualizing $0\text{--}1$ loss step functions v
EP 60 | MIT 6.036: Logistic Regression & ML as Optimization
EP 60 | MIT 6.036: Logistic Regression & ML as Optimization Oct 22, 2026 59:47 Welcome to Week 4 of MIT 6.036! This week we transition from heuristic rules to the formal framework of Machine Learning as Optimization. We explore why traditional step-function loss fails calculus, introduce smooth Sigmoid probabilities, and derive the Negative Log-Likelihood loss function.Key Topics:Framing ML as Loss Minimization plus $L_2$ Regularization.Why $0\text{--}1$ Loss fails (zero gra
VIDEO SHORT | MIT 6.036: Feature Representation
VIDEO SHORT | MIT 6.036: Feature Representation Sep 24, 2026 01:18 How does AI draw a straight line through data that isn't straight? It cheats by adding another dimension. Learn the foundational feature transformation trick that powers modern machine learning in under 60 seconds.Key Topics:The limitations of linear classifiers.The $\phi(x) = [x, x^2]$ parabola trick.Why data representation matters more than the algorithm.Disclaimer: Note: This is an AI-gener
VIDEO | MIT 6.036: Feature Representation
VIDEO | MIT 6.036: Feature Representation Sep 24, 2026 12:18 Watch the math come to life in Week 3 of MIT 6.036. When a straight line fails to separate our data, we don't change the line—we change the space. We visually animate the math behind feature transformations, showing how flat 1D data bends into 2D parabolas, and break down the matrix mathematics of encoding discrete categories like text and blood types into numeric vectors.Key Topics:Animating
EP 59 | MIT 6.036: Feature Representation
EP 59 | MIT 6.036: Feature Representation Sep 24, 2026 23:00 Welcome to Week 3 of MIT 6.036! What happens when a linear classifier encounters a problem that can't be solved with a straight line? You change the shape of the universe. This week, we explore the "High-Dimensional Transformation Trick," tackle the infamous XOR problem, and learn why feature engineering—like transforming blood types into factored vectors—is the true secret weapon of
VIDEO SHORT | MIT 6.036: The Perceptron Algorithm
VIDEO SHORT | MIT 6.036: The Perceptron Algorithm Sep 15, 2026 01:22 It sounds like a 1960s robot, but the Perceptron is actually the grandfather of modern neural networks. Learn how this elegant, error-correcting algorithm guarantees a perfect decision boundary in under 60 seconds.Key Topics:Frank Rosenblatt and the 1960s Perceptron.The genius of error-driven learning.The linear separability guarantee.Disclaimer: Note: This is an AI-generated discussion created us
VIDEO | MIT 6.036: The Perceptron Algorithm
VIDEO | MIT 6.036: The Perceptron Algorithm Sep 15, 2026 07:08 Watch the math come to life in Week 2 of MIT 6.036. We take the Perceptron algorithm out of the textbook and put it onto a 2D coordinate plane. See exactly how a decision boundary shifts, rotates, and corrects itself every time it makes a mistake, culminating in a visual breakdown of the famous Convergence Proof.Key Topics:Animating the mathematical update rule.Visualizing the geometric "tug-
EP 58 | MIT 6.036: The Perceptron Algorithm
EP 58 | MIT 6.036: The Perceptron Algorithm Sep 15, 2026 24:18 Welcome to Week 2 of MIT 6.036! This week, we graduate from random guessing to one of the most historically significant learning algorithms in computer science: The Perceptron. We explore its biological roots in the 1940s, break down the brilliant simplicity of its geometric update rule, and walk step-by-step through the elegant mathematical proof that guarantees it will find a perfect boundary.Ke

Recommended