← Search

Josh Alman

8 accepted papers

2024

How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation

ICLR 2024spotlight

In the classical transformer attention scheme, we are given three $n \times d$ size matrices $Q, K, V$ (the query, key, and value tokens), and the goal is to compute a new $n \times d$ size matrix $D^{-1} \exp(QK^\top) V$ where $D = \mathrm{diag}( \exp(QK^\top) {\bf 1}_n )$. Here, $\exp()$ is applie…

Cited by 48SourcePDFScholar
2024

Metric Transforms and Low Rank Representations of Kernels for Fast Attention

NeurIPS 2024spotlight

We introduce a new linear-algebraic tool based on group representation theory, and use it to address three key problems in machine learning. 1. Past researchers have proposed fast attention algorithms for LLMs by approximating or replace softmax attention with other functions, such as low-degree po…

Cited by 1SourcePDFScholar
2023

Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing

NeurIPS 2023poster

Over the last decade, deep neural networks have transformed our society, and they are already widely applied in various machine learning applications. State-of-the-art deep neural networks are becoming larger in size every year to deliver increasing model accuracy, and as a result, model training co…

Cited by 37SourcePDFScholar