Neural Networks are Programs, Too
summary
Claims neural networks are programs so functional techniques (Finally Tagless, Haskell types) yield automatic differentiation by dual numbers, a DSL that compiles to a DAG with hash consing, and algebraic vector spaces to generalize gradients. Implements forward and reverse modes, an interpreter for simply typed lambda calculus, and shows a compositional NN encoding (XOR, loss) but stops short of GPU optimization; performance remains unoptimized. Watch if wanting a concrete DSL+AST+AD implementation rather than high‑level motivation.
AI-written summary · about
chapters (21)
- 0:00Introduction
- 1:05Deep Learning Framework
- 1:47Newer Networks
- 2:14Gradient Descent
- 2:49Recurrent Neural Network
- 3:25Convolutional Neural Network
- 3:56Train Neural Network
- 9:09Simple Selling Strategies
- 9:54Example
- 14:38Prototype
- 16:18Space
- 18:02Gradient
- 19:43Exponential
- 20:25Basis
- 23:33Direct
- 27:13Automatic differentiation
- 29:39New network
- 30:20Topology
- 30:52High Order Functions
- 31:22Standard Term
- 33:47NonStandard Term
related talks
34mDifferentiable Functional Programming
36mProgramming Languages for Automatic Differentiation: What Now?
44mFast Neural Networks… a no brainer!
39mDifferentiable Functional Programming
59mWhats and Whys of Neural Network Verification (A Declarative Programming Perspec...
37mMonadic Deep Learning
46mCode + AI: Will Robots Take Our Coding Jobs? ML Applied to Programming
33mLearn Neural Networks With Go - Not Math!
