mlsanityData to 14 Oct 2026

Custom Algorithm-based Fault Tolerance for Attention Layers in Transformers

arXiv 2507.16676 ↗First posted 22 Jul 2025cs.LG cs.ARcited by 2

Not on the map. Why?

Abstract (arXiv)

Transformers and large language models (LLMs), powered by the attention mechanism, have transformed numerous AI applications, driving the need for specialized hardware accelerators. A major challenge in these accelerators is efficiently detecting errors caused by random hardware faults. Traditional algorithm-based fault tolerance (ABFT) techniques verify individual matrix multiplications but fall short in handling the full attention mechanism, particularly due to intermediate softmax normalization. This work proposes Flash-ABFT, a novel method that computes an online checksum across the entire three-matrix product of query, key and value matrices, of an attention layer, including the softmax operation, with a single check. This approach significantly reduces overhead by eliminating redundant checks while maintaining high fault-detection accuracy. Experimental results demonstrate that Flash-ABFT incurs only 5.3% hardware area overhead and less than 1.9% energy overhead, making it a cost-effective and robust solution for error detection in attention accelerators.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 18 of its 32 references that are in the map. First posted on arXiv 22 Jul 2025.

Builds on

18 of 32 references.

References · 18

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  5. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  6. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  7. 2020Longformer: The Long-Document Transformercited by 3,413
  8. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  9. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  10. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  11. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  12. 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
6 more
  1. 2018Online normalizer calculation for softmaxcited by 162
  2. 2021Self-attention Does Not Need O(n2) Memorycited by 154
  3. 2020Making Convolutions Resilient via Algorithm-Based Error Detection Techniquescited by 12
  4. 2024ATTNChecker: Highly-Optimized Fault Tolerant Attention for Large Language Model Trainingcited by 12
  5. 2023ApproxABFT: Approximate Algorithm-Based Fault Tolerance for Neural Network Processingcited by 3
  6. 2024GCN-ABFT: Low-Cost Online Error Checking for Graph Convolutional Networkscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.