Uploaded September 2024 | Updated September 2026, 16 hours ago
Byron Hsu presents LinkedIn's open-source collection of Triton kernels for efficient LLM training.
TIMESTAMPS
00:00 Host Opening
00:22 Main Focus
01:18 Outline
03:03 LLM Training Bottleneck
05:27 Live Demo - PyTorch Profiler
10:41 Why Triton
12:53 QA
13:49 Example - RMS Norm
18:00 QA
20:03 RMS Norm Tricks
21:20 Live Code - RMS Nrom
25:40 QA
28:14 Example - Fused Linear Cross Entropy
30:58 Gradient Checkpointing
31:51 Gradient-in-forward
32:53 QA
35:01 Chunking
36:23 QA
37:56 Live Code - Fused Linear Cross Entropy
39:59 QA
41:15 Convergence Test
42:39 Live Code - Convergence Test
44:12 Contiguity
45:15 Live Code - Contiguity
48:01 QA
49:45 Memory Address
50:38 Live Code - Memory Address
52:11 QA
1:00:28 QA - Liger Kernel
1:09:12 Acknowledgement
Slides: docs.google.com/presentation/d/1CGTV-uKw9crrBo13q1jAzAFCFzlpZFjeL4bnK67pTd8/edit?usp=sharing
Notebooks: github.com/cuda-mode/lectures/blob/main/README.md#lecture-28-liger-kernel
Byron Hsu presents LinkedIn's open-source collection of Triton kernels for efficient LLM training.
TIMESTAMPS
00:00 Host Opening
00:22 Main Focus
01:18 Outline
03:03 LLM Training Bottleneck
05:27 Live Demo - PyTorch Profiler
10:41 Why Triton
12:53 QA
13:49 Example - RMS Norm
18:00 QA
20:03 RMS Norm Tricks
21:20 Live Code - RMS Nrom
25:40 QA
28:14 Example - Fused Linear Cross Entropy
30:58 Gradient Checkpointing
31:51 Gradient-in-forward
32:53 QA
35:01 Chunking
36:23 QA
37:56 Live Code - Fused Linear Cross Entropy
39:59 QA
41:15 Convergence Test
42:39 Live Code - Convergence Test
44:12 Contiguity
45:15 Live Code - Contiguity
48:01 QA
49:45 Memory Address
50:38 Live Code - Memory Address
52:11 QA
1:00:28 QA - Liger Kernel
1:09:12 Acknowledgement
Slides: docs.google.com/presentation/d/1CGTV-uKw9crrBo13q1jAzAFCFzlpZFjeL4bnK67pTd8/edit?usp=sharing
Notebooks: github.com/cuda-mode/lectures/blob/main/README.md#lecture-28-liger-kernel
![Formalized Deep Learning Architectures for Automated Low-Level Kernel Optimization
Abstract: Vincent Abbott is a PhD student at the Massachusetts Institute of Technologys (MIT) Zardini Lab who has developed a formal framework for describing the relationship between the mathematical function implemented by a deep learning model, its resource usage, and low-level implementation. These methods are based on category theoretic diagrams [1]. The Zardini Lab has developed these diagrams into a tool for rapidly deriving low-level algorithms, as presented in their recent work FlashAttention on a Napkin [2]. These methods have been put into practice, deriving a FlashAttention-like algorithm for an attention variant from first principles [3].
Recently, he has been working on encoding the underlying mathematics into an automated tool for diagram generation and algorithm optimization. In this talk, Vincent Abbott will cover formal diagrams for deep learning models, show how they can be used to derive low-level algorithms such as FlashAttention and corresponding performance models, and preview work related to automated tools for diagramming and analyzing algorithms.
[1] https://openreview.net/forum?id=RyZB4qXEgt
[2] https://openreview.net/forum?id=pF2ukh7HxA
[3] https://dl.acm.org/doi/10.1007/978-3-032-00686-8_1 Formalized Deep Learning Architectures for Automated Low-Level Kernel Optimization](https://i.ytimg.com/vi/hAoY2bpRIKg/mqdefault.jpg)









