We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.04542")
get_code_for_paper("2302.04542")
have("2302.04542")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.04542.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.04542)
Connect an agent — have() is free.