Search Results for author:
Found 1 papers, 0 papers with code
Fast Multipole Attention: A Divide-and-Conquer Attention Mechanism for Long Sequences
The overall complexity of Fast Multipole Attention is $\mathcal{O}(n)$ or $\mathcal{O}(n \log n)$, depending on whether the queries are down-sampled or not.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
