Block Sparse Attention with Log-Linear Complexity
PISA selects sparse attention blocks with pyramid Top-K routing, reducing complexity to O(N log N).
2 stories, newest first · one card per story
PISA selects sparse attention blocks with pyramid Top-K routing, reducing complexity to O(N log N).

OECD PISA data from 91 countries shows AI-using students generally score lower, though moderate intentional use plus critical evaluation training can improve outcomes.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views