mlsanityData to 7 Oct 2026

Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-design

arXiv 2209.09570 ↗First posted 20 Sep 2022cs.AR cs.LGcited by 29

Not on the map. Why?

Abstract (arXiv)

Attention-based neural networks have become pervasive in many AI tasks. Despite their excellent algorithmic performance, the use of the attention mechanism and feed-forward network (FFN) demands excessive computational and memory resources, which often compromises their hardware performance. Although various sparse variants have been introduced, most approaches only focus on mitigating the quadratic scaling of attention on the algorithm level, without explicitly considering the efficiency of mapping their methods on real hardware designs. Furthermore, most efforts only focus on either the attention mechanism or the FFNs but without jointly optimizing both parts, causing most of the current designs to lack scalability when dealing with different input lengths. This paper systematically considers the sparsity patterns in different variants from a hardware perspective. On the algorithmic level, we propose FABNet, a hardware-friendly variant that adopts a unified butterfly sparsity pattern to approximate both the attention mechanism and the FFNs. On the hardware level, a novel adaptable butterfly accelerator is proposed that can be configured at runtime via dedicated hardware control to accelerate different butterfly layers using a single unified hardware engine. On the Long-Range-Arena dataset, FABNet achieves the same accuracy as the vanilla Transformer while reducing the amount of computation by 10 to 66 times and the number of parameters 2 to 22 times. By jointly optimizing the algorithm and hardware, our FPGA-based butterfly accelerator achieves 14.2 to 23.2 times speedup over state-of-the-art accelerators normalized to the same computational budget. Compared with optimized CPU and GPU designs on Raspberry Pi 4 and Jetson Nano, our system is up to 273.8 and 15.1 times faster under the same power budget.

Key facts. Cited by 29 papers in the map (data through 7 Oct 2026). Builds on 35 of its 49 references that are in the map. First posted on arXiv 20 Sep 2022.

Builds on

35 of 49 references.

References · 35

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  5. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  6. 2016Layer Normalizationcited by 5,579
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2020Longformer: The Long-Document Transformercited by 3,362
  9. 2020Big Bird: Transformers for Longer Sequencescited by 1,673
  10. 2020Reformer: The Efficient Transformercited by 1,658
  11. 2020Rethinking Attention with Performerscited by 1,584
  12. 2019Generating Long Sequences with Sparse Transformerscited by 1,523
23 more
  1. 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
  2. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
  3. 2019Cross-lingual Language Model Pretrainingcited by 1,088
  4. 2020Efficient Transformers: A Surveycited by 784
  5. 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
  6. 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 468
  7. 2021FNet: Mixing Tokens with Fourier Transformscited by 343
  8. 2020Sparse Sinkhorn Attentioncited by 250
  9. 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
  10. 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 128
  11. 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
  12. 2020A3: Accelerating Attention Mechanisms in Neural Networks with Approximationcited by 97
  13. 2019A Tensorized Transformer for Language Modelingcited by 85
  14. 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
  15. 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 73
  16. 2020EdgeBERT: Sentence-Level Energy Optimizations for Latency-Aware Multi-Task NLP Inferencecited by 69
  17. 2022A General Survey on Attention Mechanisms in Deep Learningcited by 64
  18. 2020FTRANS: Energy-Efficient Acceleration of Transformers using FPGAcited by 52
  19. 2020Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Mapscited by 36
  20. 2021Energon: Towards Efficient Acceleration of Transformers Using Dynamic Sparse Attentioncited by 26
  21. 2018C-LSTM: Enabling Efficient LSTM using Structured Compression Techniques on FPGAscited by 21
  22. 2019HyPar: Towards Hybrid Parallelism for Deep Learning Accelerator Arraycited by 15
  23. 2018E-RNN: Design Optimization for Efficient Recurrent Neural Networks in FPGAscited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 10; 2024: 9; 2025: 8; 2026: 1.

29 papers.

Sort:

By area:

  1. 2024A Survey on Efficient Inference for Large Language Modelscited by 197
  2. 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
  3. 2024FlightLLM: Efficient Large Language Model Inference with a Complete Mapping Flow on FPGAscited by 60
  4. 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
  5. 2024MELTing point: Mobile Evaluation of Language Transformerscited by 35
  6. 2024Duplex: A Device for Large Language Models with Mixture of Experts, Grouped Query Attention, and Continuous Batchingcited by 33
  7. 2023On Efficient Training of Large-Scale Deep Learning Models: A Literature Reviewcited by 26
  8. 2025PIM Is All You Need: A CXL-Enabled GPU-Free System for Large Language Model Inferencecited by 22
  9. 2023ShiftAddViT: Mixture of Multiplication Primitives Towards Efficient Vision Transformercited by 15
  10. 2022The Future of Consumer Edge-AI Computingcited by 12
  11. 2025LightMamba: Efficient Mamba Acceleration on FPGA with Quantization and Hardware Co-designcited by 11
  12. 2024HG-PIPE: Vision Transformer Acceleration with Hybrid-Grained Pipelinecited by 7
17 more
  1. 2023PQA: Exploring the Potential of Product Quantization in DNN Hardware Accelerationcited by 6
  2. 2023Sparse-DySta: Sparsity-Aware Dynamic and Static Scheduling for Sparse Multi-DNN Workloadscited by 6
  3. 2023Efficient N:M Sparse DNN Training Using Algorithm, Architecture, and Dataflow Co-Designcited by 5
  4. 2024SWAT: Scalable and Efficient Window Attention-based Transformers Acceleration on FPGAscited by 5
  5. 2023When Monte-Carlo Dropout Meets Multi-Exit: Optimizing Bayesian Neural Networks on FPGAcited by 4
  6. 2025MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitivenesscited by 4
  7. 2025TreeQ: Pushing the Quantization Boundary of Diffusion Transformer via Tree-Structured Mixed-Precision Searchcited by 3
  8. 2023A Dataflow Compiler for Efficient LLM Inference using Custom Microscaling Formatscited by 2
  9. 2024Co-Designing Binarized Transformer and Hardware Accelerator for Efficient End-to-End Edge Deploymentcited by 2
  10. 2025BitStopper: An Efficient Transformer Attention Accelerator via Stage-fusion and Early Terminationcited by 1
  11. 2023Dimension Mixer: Group Mixing of Input Dimensions for Efficient Function Approximationcited by 0
  12. 2024Enhancing Dropout-based Bayesian Neural Networks with Multi-Exit on FPGAcited by 0
  13. 2024Accelerating MRI Uncertainty Estimation with Mask-based Bayesian Neural Networkcited by 0
  14. 2025Accelerating Sparse Transformer Inference on GPUcited by 0
  15. 2025Efficient In-Memory Acceleration of Sparse Block Diagonal LLMscited by 0
  16. 2025Efficient Tensor Completion Algorithms for Highly Oscillatory Operatorscited by 0
  17. 2026ELiTeFormer: An Efficient Transformer for FPGAscited by 0