pith. sign in

Ppt: Token pruning and pooling for efficient vision transformers

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

fields

cs.CV 3 cs.LG 1

years

2026 3 2025 1

representative citing papers

Rethink MAE with Linear Time-Invariant Dynamics

cs.CV · 2026-04-29 · unverdicted · novelty 7.0

Token order in frozen visual representations is exploitable via SSM-based LTI probes, revealing pre-training-dependent heterogeneity that fixed pooling misses.

MPM: Mutual Pair Merging for Efficient Vision Transformers

cs.CV · 2026-04-07 · conditional · novelty 6.0

MPM merges mutual nearest-neighbor token pairs in cosine space for ViTs, records a merge map for reconstruction, and delivers up to 60% latency reduction on Raspberry Pi 5 and 20% throughput gain on H100 with under 3% mIoU drop on ADE20K.

ASAP: Attention Sink Anchored Pruning

cs.LG · 2026-05-21 · unverdicted · novelty 5.0

ASAP prunes tokens in ViTs by anchoring on attention sinks modeled as lazy random walks, using cumulative transition matrices and radial diffusion clustering to compress redundancy while preserving accuracy.

citing papers explorer

Showing 4 of 4 citing papers.

  • Rethink MAE with Linear Time-Invariant Dynamics cs.CV · 2026-04-29 · unverdicted · none · ref 9

    Token order in frozen visual representations is exploitable via SSM-based LTI probes, revealing pre-training-dependent heterogeneity that fixed pooling misses.

  • MPM: Mutual Pair Merging for Efficient Vision Transformers cs.CV · 2026-04-07 · conditional · none · ref 33

    MPM merges mutual nearest-neighbor token pairs in cosine space for ViTs, records a merge map for reconstruction, and delivers up to 60% latency reduction on Raspberry Pi 5 and 20% throughput gain on H100 with under 3% mIoU drop on ADE20K.

  • ASAP: Attention Sink Anchored Pruning cs.LG · 2026-05-21 · unverdicted · none · ref 3

    ASAP prunes tokens in ViTs by anchoring on attention sinks modeled as lazy random walks, using cumulative transition matrices and radial diffusion clustering to compress redundancy while preserving accuracy.

  • Where Do Tokens Go? Understanding Pruning Behaviors in STEP at High Resolutions cs.CV · 2025-09-17 · unverdicted · none · ref 54

    STEP uses dynamic superpatch merging via dCTS and early token exits to cut token count by 2.5x and computational complexity by up to 4x on ViT-Large for high-res segmentation, with at most 2% accuracy drop and 40% tokens halted early.