Josh Alman
where else to find them
bluesky:jalman.bsky.social
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Fast Attention Requires Bounded Entries | Sketching and Algorithm Design 2023 | 2023-10-09 |
Shows attention computation has a sharp threshold: if all Q,K,V entries satisfy B ≤ √log n a polynomial-approximation method yields a low-rank decomposition… | ||
| nothing matches | ||