Skip to main content
← Back to news

PISA: block sparse attention with log-linear complexity

Research
Source:arXiv
The PISA paper proposes a pyramid Top-K selection strategy that brings block sparse attention to O(N log N) complexity, cutting the quadratic bottleneck of block selection; Triton kernels for training and Inference.

Get the next local-AI briefing

Once a week, the top selection from iaLocale: articles, news and resources on local AI, and more.

After signing up you receive a confirmation email (double opt-in). Without confirmation we send nothing. No spam, we promise.