Pith. sign in

REVIEW 2 cited by

Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?

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 2307.14023 v3 pith:EXT7HVM5 submitted 2023-07-26 cs.LG

Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?

classification cs.LG
keywords transformersfunctionlayerself-attentionapproximatorscapacitylow-rankmatrices
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Existing analyses of the expressive capacity of Transformer models have required excessively deep layers for data memorization, leading to a discrepancy with the Transformers actually used in practice. This is primarily due to the interpretation of the softmax function as an approximation of the hardmax function. By clarifying the connection between the softmax function and the Boltzmann operator, we prove that a single layer of self-attention with low-rank weight matrices possesses the capability to perfectly capture the context of an entire input sequence. As a consequence, we show that one-layer and single-head Transformers have a memorization capacity for finite samples, and that Transformers consisting of one self-attention layer with two feed-forward neural networks are universal approximators for continuous permutation equivariant functions on a compact domain.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Convergence of Gradient Descent for General Neural Network Architectures Beyond the NTK Regime

    cs.LG 2026-06 unverdicted novelty 7.0

    Proves GD convergence to stationary point neighborhoods for general NN architectures beyond NTK via block-level analysis, analyticity, and local smoothness conditions.

  2. Transformer Approximations from ReLUs

    cs.LG 2026-04 unverdicted novelty 7.0

    A recipe translates ReLU approximations to softmax attention with target-specific economic bounds for multiplication, reciprocal computation, and min/max primitives.