Linear Log-Normal Attention with Unbiased Concentration

Yury Nahshan, Dor-Joseph Kampeas, E. Haleva
2/12/2026

No official code found. Best implementation: ynahshan/linear-lognormal-attention (7 stars, MIT, last commit 2024-01-29).

Abstract

Transformer models have achieved remarkable results in a wide range of applications. However, their scalability is hampered by the quadratic time and memory complexity of the self-attention mechanism concerning the sequence length. This limitation poses a substantial obstacle when dealing with long documents or high-resolution images. In this work, we study the self-attention mechanism by analyzing the distribution of the attention matrix and its concentration ability. Furthermore, we propose instruments to measure these quantities and introduce a novel self-attention mechanism, Linear Log-Normal Attention, designed to emulate the distribution and concentration behavior of the original self-attention. Our experimental results on popular natural language benchmarks reveal that our proposed Linear Log-Normal Attention outperforms other linearized attention alternatives, offering a promising avenue for enhancing the scalability of transformer models.

View on arXivView PDF

Code Implementations(1)

MIT
70Python, Jupyter NotebookJan 24, 20242 years agoMIT

Similar Papers

Cite this paper

@article{nahshan2026linear,
  title  = {Linear Log-Normal Attention with Unbiased Concentration},
  author = {Yury Nahshan and Dor-Joseph Kampeas and E. Haleva},
  year   = {2026},
  eprint = {2311.13541},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2311.13541},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.13541.svg)](https://codeofpaper.com/paper/2311.13541)

Discussion