Softpick: No Attention Sink, No Massive Activations with Rectified Softmax
Abstract
We introduce softpick, a rectified, not sum-to-one, drop-in replacement for softmax in transformer attention mechanisms that eliminates attention sink and massive activations. Our experiments with 340M parameter models demonstrate that softpick maintains performance parity with softmax on standard benchmarks while achieving 0% sink rate. The softpick transformer produces hidden states with significantly lower kurtosis (340 vs 33,510) and creates sparse attention maps (46.97% sparsity). Models using softpick consistently outperform softmax when quantized, with particularly pronounced advantages at lower bit precisions. Our analysis and discussion shows how softpick has the potential to open new possibilities for quantization, low-precision training, sparsity optimization, pruning, and interpretability. Our code is available at https://github.com/zaydzuhri/softpick-attention.
Community
We introduce softpick, a rectified, not sum-to-one, drop-in replacement for softmax in transformer attention mechanisms that eliminates attention sink and massive activations. Our experiments with 340M parameter models demonstrate that softpick maintains performance parity with softmax on standard benchmarks while achieving 0% sink rate. The softpick transformer produces hidden states with significantly lower kurtosis (340 vs 33,510) and creates sparse attention maps (46.97% sparsity). Models using softpick consistently outperform softmax when quantized, with particularly pronounced advantages at lower bit precisions. Our analysis and discussion shows how softpick has the potential to open new possibilities for quantization, low-precision training, sparsity optimization, pruning, and interpretability. Our code is available at https://github.com/zaydzuhri/softpick-attention.
Notice: The wikitext perplexity numbers are wrong in V1 of this paper. We did not set the correct LM Eval Harness settings. We will correct them swiftly.
Predominant attention-sinks occur with models of billions of parameters. Can softpick mitigate them at that scale?
This is an early preprint. We will be scaling up to 2B and 7B model scales soon and update the paper. Stay tuned 👍
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- BitNet v2: Native 4-bit Activations with Hadamard Transformation for 1-bit LLMs (2025)
- Accurate INT8 Training Through Dynamic Block-Level Fallback (2025)
- CASP: Compression of Large Multimodal Models Based on Attention Sparsity (2025)
- RSQ: Learning from Important Tokens Leads to Better Quantized LLMs (2025)
- Using Attention Sinks to Identify and Evaluate Dormant Heads in Pretrained LLMs (2025)
- A Refined Analysis of Massive Activations in LLMs (2025)
- Forgetting Transformer: Softmax Attention with a Forget Gate (2025)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment:
@librarian-bot
recommend
Models citing this paper 6
Browse 6 models citing this paperDatasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper