DCLGOct 15, 2024

ATTNChecker: Highly-Optimized Fault Tolerant Attention for Large Language Model Training

arXiv:2410.11720v313 citationsh-index: 9PPoPP
Originality Incremental advance
AI Analysis

This addresses the issue of training disruptions due to faults for researchers and practitioners working with large language models, representing an incremental improvement in fault tolerance methods.

The paper tackles the problem of faults in attention mechanisms during large language model training, proposing ATTNChecker, an algorithm-based fault tolerance technique that incurs 7% overhead on average and reduces recovery overhead by up to 49x compared to checkpoint/restore methods.

Large Language Models (LLMs) have demonstrated remarkable performance in various natural language processing tasks. However, the training of these models is computationally intensive and susceptible to faults, particularly in the attention mechanism, which is a critical component of transformer-based LLMs. In this paper, we investigate the impact of faults on LLM training, focusing on INF, NaN, and near-INF values in the computation results with systematic fault injection experiments. We observe the propagation patterns of these errors, which can trigger non-trainable states in the model and disrupt training, forcing the procedure to load from checkpoints. To mitigate the impact of these faults, we propose ATTNChecker, the first Algorithm-Based Fault Tolerance (ABFT) technique tailored for the attention mechanism in LLMs. ATTNChecker is designed based on fault propagation patterns of LLM and incorporates performance optimization to adapt to both system reliability and model vulnerability while providing lightweight protection for fast LLM training. Evaluations on four LLMs show that ATTNChecker incurs on average 7% overhead on training while detecting and correcting all extreme errors. Compared with the state-of-the-art checkpoint/restore approach, ATTNChecker reduces recovery overhead by up to 49x.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes