Pith. sign in

REVIEW 2 cited by

Linear Log-Normal Attention with Unbiased Concentration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.13541 v4 pith:VK7TE46S submitted 2023-11-22 cs.LG cs.AI

classification cs.LGcs.AI
keywords attentionself-attentionconcentrationlinearlog-normalmechanismdistributionmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Power Law Guided Dynamic Sifting for Efficient Attention

    cs.LG 2025-06 conditional novelty 6.0 of 10

    SiftAttention skips top-k sorting in sparse attention by thresholding attention weights with a threshold predicted from a power-law fit of score quantiles over generation steps.

  2. Top-Theta Attention: Sparsifying Transformers by Compensated Thresholding

    cs.CL 2025-02 conditional novelty 6.0 of 10

    Static per-head thresholds calibrated on a small dataset can replace top-k selection in transformer attention, achieving 3 to 10x sparsity with negligible accuracy loss.

Pith tools