About this episode
An accessible, concise tour of backpropagation: how the forward pass computes outputs, how the backward pass uses the chain rule to compute gradients efficiently, and why caching intermediates matters. A quick history from 1960s-70s precursors to Werbos, Rumelhart–Hinton–Williams' 1986 breakthrough, with NETtalk and TD-Gammon as milestones. We also discuss limitations like local minima and vanishing/exploding gradients, and what these mean for today’s huge models. Brought to you by Embersilk.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Get every episode summarized
Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Intellectually Curious
Did OpenAI Solve Navier-Stokes? A Future-Shaping Claim Put to the Test
Intellectually Curious
Sep 9, 20265:52pending
Understanding the Hubble Tension
Intellectually Curious
Sep 9, 20265:57pending
OpenClaw 2.0 Feature Overview
Intellectually Curious
Sep 8, 20268:03pending
First to Leave, Last to Arrive: The $15 Million Fermi Explorer to Alpha Centauri
Intellectually Curious
Sep 7, 20265:50pending