Self-Tuning Sparse Attention: Multi-Fidelity Hyperparameter Optimization for Transformer Acceleration
Not on the map. Why?
Abstract (arXiv)
Sparse attention mechanisms promise to break the quadratic bottleneck of long-context transformers, yet production adoption remains limited by a critical usability gap: optimal hyperparameters vary substantially across layers and models, and current methods (e.g., SpargeAttn) rely on manual grid search to identify them. We propose AFBS-BO (Adaptive Fidelity Binary Search with Bayesian Optimization), a fully automated framework that discovers optimal layer- and head-specific hyperparameters without human intervention. Our hybrid algorithm combines Bayesian Optimization for global exploration with binary search for local refinement, leveraging multi-fidelity evaluation across sequence lengths to reduce tuning cost. On Llama-2-7B, AFBS-BO accelerates hyperparameter discovery by 3.4x with 8.8x fewer evaluations than grid search, and identifies high-sparsity configurations that outperform existing sparse attention baselines while closely matching dense attention quality. By transforming sparse attention from a manually tuned heuristic into a self-optimizing primitive, AFBS-BO enables plug-and-play acceleration across diverse transformer architectures and domains.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 19 Mar 2026.
Builds on
27 of 38 references.
References · 27
- 2017Attention Is All You Needcited by 60,361
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2024CogVideoX: Text-to-Video Diffusion Models with An Expert Transformercited by 2,261
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2018A Tutorial on Bayesian Optimizationcited by 744
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 674
15 more
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
- 2017Large Batch Training of Convolutional Networkscited by 535
- 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 501
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
- 2018Neural Architecture Search with Bayesian Optimisation and Optimal Transportcited by 195
- 2020Resolution Adaptive Networks for Efficient Inferencecited by 146
- 2025SpargeAttention: Accurate and Training-free Sparse Attention Accelerating Any Model Inferencecited by 120
- 2022Towards Learning Universal Hyperparameter Optimizers with Transformerscited by 81
- 2023Dynamic Token Pruning in Plain Vision Transformers for Semantic Segmentationcited by 62
- 2020Multi-Fidelity Bayesian Optimization via Deep Neural Networkscited by 46
- 2023Training-free Neural Architecture Search for RNNs and Transformerscited by 9
- 2025AttentionPredictor: Temporal Patterns Matter for KV Cache Compressioncited by 7
- 2026Elastic Attention: Test-time Adaptive Sparsity Ratios for Efficient Transformerscited by 5
- 2025Adaptive Layer-Wise Transformations for Post-Training Quantization of Large Language Modelscited by 1
Built on by
Not cited yet.