▶ Watch ↗AI Engineer World's Fair 202524:35
Luminal - Search-Based Deep Learning Compilers - Joe Fioti
Read the full talk →Key ideas
Scroll to read ↓Deep learning needs only a small mathematical vocabulary. Luminal builds models from that vocabulary, then searches equivalent implementations to recover efficient GPU execution.
- Why does simple linear algebra need such complicated libraries?0:02 ↗
- Compose familiar layers from primitive operations2:26 ↗
- Keep the graph static and the changing dimensions bounded4:33 ↗
- The primitive graph is the starting point, not the execution plan6:44 ↗
- Simpler hardware asks more of the compiler8:53 ↗
- Search equivalent implementations instead of prescribing every choice11:59 ↗
- Fusion removes an intermediate trip through global memory14:38 ↗
- From naive attention to a FlashAttention implementation16:41 ↗
- Reuse buffers and submit kernels together18:08 ↗
- Attach a backward graph without rebuilding the compiler20:23 ↗
- Extend the graph across hardware, environments and deployment21:33 ↗