What is recorded here?
Computed exact attention with tiled GPU operations and recomputation, reducing transfers between high-bandwidth memory and on-chip storage without materializing the full attention matrix.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The dense algorithm changes memory access, not quadratic arithmetic complexity. IO bounds have an explicit memory model; speedups are hardware-specific. Sparse extensions are approximate and remain distinct.
Read the original work
- FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness
- Stanford HAI: FlashAttention research record
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Tri Dao; Daniel Y. Fu; Stefano Ermon; Atri Rudra; Christopher Ré
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Dao and colleagues: IO-aware exact attention with FlashAttention
Computed exact attention with tiled GPU operations and recomputation, reducing transfers between high-bandwidth memory and on-chip storage without materializing the full attention matrix.
Scientific scope
The dense algorithm changes memory access, not quadratic arithmetic complexity. IO bounds have an explicit memory model; speedups are hardware-specific. Sparse extensions are approximate and remain distinct.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Tri Dao; Daniel Y. Fu; Stefano Ermon; Atri Rudra; Christopher Ré
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.