- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces LapMerge, a differentiable token merging operator designed to reduce sequence length under an exact output budget while achieving linear-time computation.
Critical strengths
LapMerge provides a mathematically grounded approach to exact-budget token merging by formulating token aggregation as equal-mass partitioning of a smoothed importance distribution.
Critical weaknesses
LapMerge builds on the Laplace CDF and scan-based computations used in LapSum for differentiable ranking and selection. A more systematic comparison with LapSum would help establish the distinct contribution of LapMerge.
Questions for authors
-
The evaluation on modern multimodal models is limited. The MLLM evaluation primarily relies on POPE with a single Qwen2.5-VL backbone. Additional benchmarks and end-to-end inference measurements would strengthen the practical claims.
-
The order-permutation experiments show a substantial performance drop when the scan order is randomized, indicating that the method relies on meaningful local structure in the input sequence. While this inductive bias is suitable for spatially or temporally organized tokens, its applicability to sequences where relevant information is distributed across distant positions remains unclear. The paper would benefit from a clearer characterization of when ordered merging is preferable to order-agnostic or content-based merging methods.
-
Although the paper compares LapMerge with pruning, uniform pooling, and local smoothing baselines, the individual contributions of its main design choices remain insufficiently isolated. In particular, it is unclear how much of the performance gain comes from token merging itself, adaptive equal-mass partitioning, or Laplace-based smoothing.