Pith. sign in

Efficient Attention via Control Variates

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Feature Shift Localization Network

cs.LG · 2025-06-10 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Feature Shift Localization Network cs.LG · 2025-06-10 · conditional · none · ref 20 · internal anchor

    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.