Block Sparse Attention with Log-Linear Complexity
PISA selects sparse attention blocks with pyramid Top-K routing, reducing complexity to O(N log N).
1 stories, newest first · one card per story
PISA selects sparse attention blocks with pyramid Top-K routing, reducing complexity to O(N log N).
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views