Transformer Architectures: Subquadratic Attention Mechanisms

Related lectures (29)

Page 2 of 3

Explores the Divide-and-Conquer algorithm for matrix multiplication, including Strassen's Method and its significance in optimizing time complexity.

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.

Explains square matrices, including invertible, triangular, and diagonal matrices, and their properties.

Covers generative models with a focus on self-attention and transformers, discussing sampling methods and empirical means.

Covers matrix notation, arithmetic, multiplication algorithms, and complexity analysis.

Covers matrix operations, including multiplication, transposition, powers, and inverses, and explains how to determine if a matrix is invertible.

Covers linear systems, diagonal and triangular matrices, and LU factorization.

Covers matrix product, inverses, and properties of invertible matrices.

Covers the fundamentals of linear equations, matrices, and systems of linear equations, including matrix operations and solutions.

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.