Pith. sign in

REVIEW 2 cited by

Efficient Attention via Control Variates

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 2302.04542 v1 pith:5WJF35HD submitted 2023-02-09 cs.LG cs.CLcs.CV

classification cs.LGcs.CLcs.CV
keywords attentioncontrolapproximationefficientsoftmaxvariatescomplexitylinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Random-feature-based attention (RFA) is an efficient approximation of softmax attention with linear runtime and space complexity. However, the approximation gap between RFA and conventional softmax attention is not well studied. Built upon previous progress of RFA, we characterize this gap through the lens of control variates and show that RFA can be decomposed into a sum of multiple control variate estimators for each element in the sequence. This new framework reveals that exact softmax attention can be recovered from RFA by manipulating each control variate. Besides, it allows us to develop a more flexible form of control variates, resulting in a novel attention mechanism that significantly reduces the approximation gap while maintaining linear complexity. Extensive experiments demonstrate that our model outperforms state-of-the-art efficient attention mechanisms on both vision and language tasks.

Discussion (0). Sign in 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. Feature Shift Localization Network

    cs.LG 2025-06 conditional novelty 6.0 of 10

    FSL-Net localizes shifted features between two datasets using a network trained on 1,350 datasets, matching DataFix's F1 while being about 36x faster on average.

  2. Scaling Reasoning without Attention

    cs.LG 2025-05 conditional novelty 4.0 of 10

    A purely attention-free Mamba-2 model, fine-tuned with PromptCoT-style synthetic data, reaches state-of-the-art scores on AIME and LiveCodeBench among open models of its size and surpasses Gemma3-27B on three benchmarks.

Pith tools