Paper recorded by Signals 4 on 2026-10-09 in cs.CV. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-09 on arXiv · recorded by Signals 4 on 2026-10-12
Category: cs.CV · 计算机视觉 · first seen 2026-10-12
Modern vision and language models process ever longer token sequences, and reducing them is the main lever on downstream cost. Token compression, however, faces a fundamental trade-off: selecting tokens discards information, while existing merging methods preserve it only through pairwise token-to-token matching or $MN$ token-to-output interactions. We introduce LapMerge, a differentiable merging