Cottention: Linear Transformers With Cosine Attention
<|reference_start|>Cottention: Linear Transformers With Cosine Attention: Attention mechanisms, particularly softmax attention, have been instrumental in the success of transformer-based models such as GPT. However, the quadratic memory complexity of softmax attention with respect to sequence length poses significant challenges for processing longer sequences. We introduce Cottention, a novel attention mechanism that replaces the softmax operation with cosine similarity. By leveraging the properties of cosine similarity and rearranging the attention equation, Cottention achieves native linear memory complexity with respect to sequence length, making it inherently more memory-efficient than softmax attention. We demonstrate that Cottention can be reformulated as a recurrent neural network (RNN) with a finite hidden state, allowing for constant memory usage during inference. We evaluate Cottention on both the bidirectional BERT and causal GPT tasks, demonstrating comparable performance to softmax attention while significantly reducing memory requirements. To ensure efficient computation, we develop a custom CUDA kernel for Cottention. Our results show that Cottention is a promising alternative to softmax attention, enabling the processing of longer sequences without sacrificing performance, due to its native linear memory complexity and ability to maintain a constant memory footprint during inference.<|reference_end|>
@article{mongaras2024cottention:,
    title={Cottention: Linear Transformers With Cosine Attention},
    author={Gabriel Mongaras and Trevor Dohm and Eric C. Larson},
    journal={arXiv preprint arXiv:2409.18747},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.18747},
    primaryClass={cs.LG}
}