Fast and Exact Relative-Position Attention via Structure-Aware Kernels
A precise tile attention algorithm integrates additive relative position terms into the computation similar to FlashAttention, reducing memory and computational overhead, accelerating long-context relative position Transformers. The method (1) uses offset-aware tiles to avoid redundant index and memory access, (2) only computes necessary key/query relation products and reuses them in forward and backward passes, and (3) uses offset-based gradient sharding and aggregation to eliminate atomic contention.

















