mlsanityData to 7 Oct 2026

SparseSAM: Structured Sparsification of Activations in Segment Anything Models

arXiv 2605.17633 ↗First posted 17 May 2026cs.CV cs.AIcited by 1

On the map: Efficient LLM inference and serving → Token pruning and merging for ViTs

Abstract (arXiv)

The Segment Anything Model (SAM) achieves strong open-vocabulary segmentation, but its ViT-based image encoders dominate inference latency and memory. Existing activation compression methods, such as token merging, reduce the token length to process, yet introduce non-trivial runtime overhead and encounter catastrophic quality drop under high compression. Other methods applying Sparse Attention focus on attention alone, leaving the MLP fully dense and capping achievable speedup. We propose SparseSAM, a (i) training-free structured sparsification framework that jointly accelerates attention and MLP layers while preserving token identity. SparseSAM introduces (ii) Stripe-Sort Attention, which uses a deterministic Z-order permutation to transform dense attention into static hardware-friendly sparse patterns, eliminating dynamic masking overhead. SparseSAM further introduces a (iii) Residual-Consistency MLP that routes only informative tokens through the MLP while propagating remaining tokens through the residual pathway. Across four segmentation benchmarks, SparseSAM loses only 0.004 mIoU at a 0.4 density and 0.021 mIoU at 0.3, a 2.10x reduction in accuracy loss versus token merging advances, while achieving 2x faster inference and 2.8x memory reduction.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Token pruning and merging for ViTs, one of 12 directions in Efficient LLM inference and serving. Builds on 30 of its 36 references that are in the map. First posted on arXiv 17 May 2026.

Builds on

30 of 36 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026StructSAM: Structure- and Spectrum-Preserving Token Merging for Segment Anything Models7 Mar
  2. 2024Accelerating Transformers with Spectrum-Preserving Token Merging25 May
  3. 2022Token Merging: Your ViT But Faster17 Oct

Other references · 27

  1. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  2. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  3. 2022DINO: DETR with Improved DeNoising Anchor Boxes for End-to-End Object Detectioncited by 1,306
  4. 2021YOLOX: Exceeding YOLO Series in 2021cited by 1,064
  5. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  6. 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
  7. 2023Segment Anything in High Qualitycited by 373
  8. 2023Faster Segment Anything: Towards Lightweight SAM for Mobile Applicationscited by 345
  9. 2025Perception Encoder: The best visual embeddings are not at the output of the networkcited by 315
  10. 2023Fast Segment Anythingcited by 286
  11. 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Headscited by 283
  12. 2019Structured Knowledge Distillation for Dense Predictioncited by 277
15 more
  1. 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 248
  2. 2025Sparse VideoGen: Accelerating Video Diffusion Transformers with Spatial-Temporal Sparsitycited by 204
  3. 2023EfficientSAM: Leveraged Masked Image Pretraining for Efficient Segment Anythingcited by 187
  4. 2022DETRs with Hybrid Matchingcited by 149
  5. 2021Group Fisher Pruning for Practical Network Compressioncited by 130
  6. 2025SpargeAttention: Accurate and Training-free Sparse Attention Accelerating Any Model Inferencecited by 113
  7. 2025Sparse VideoGen2: Accelerate Video Generation with Sparse Attention via Semantic-Aware Permutationcited by 100
  8. 2024Q-VLM: Post-training Quantization for Large Vision-Language Modelscited by 47
  9. 2022Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuningcited by 33
  10. 2024PTQ4SAM: Post-Training Quantization for Segment Anythingcited by 32
  11. 2023SlimSAM: 0.1% Data Makes Segment Anything Slimcited by 20
  12. 2026PISA: Piecewise Sparse Attention Is Wiser for Efficient Diffusion Transformerscited by 16
  13. 2025Mix-QSAM: Mixed-Precision Quantization of the Segment Anything Modelcited by 4
  14. 2025How Many Tokens Do 3D Point Cloud Transformer Architectures Really Need?cited by 4
  15. 2026JZ-Tree: GPU friendly neighbour search and friends-of-friends with dual tree walks in JAX plus CUDAcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026AB-Sparse: Sparse Attention with Adaptive Block Size for Accurate and Efficient Long-Context Inference
  2. 2024HRSAM: Efficient Interactive Segmentation in High-Resolution Images
  3. 2025Segment Anyword: Mask Prompt Inversion for Open-Set Grounded Segmentation
  4. 2025Understanding and Improving Length Generalization in Hierarchical Sparse Attention Models
  5. 2026SPAR: Single-Pass Any-Resolution ViT for Open-vocabulary Segmentation
  6. 2025Mixture of Sparse Attention: Content-Based Learnable Sparse Attention via Expert-Choice Routing
  7. 2025X-SAM: From Segment Anything to Any Segmentation
  8. 2023Token Sparsification for Faster Medical Image Segmentation