Bingjun Luo, Tony Wang, Chaoqi Chen, Xinpeng Ding
Multimodal Large Language Models (MLLMs) face significant computational overhead when processing long videos due to the massive number of visual tokens required. To improve efficiency, existing methods primarily reduce redundancy by pruning or merging tokens based on importance or similarity. However, these approaches largely overlook a critical dimension of video content, i.e., changes and turning points, and they lack a collaborative model for spatio-temporal relationships. To address this, we propose a new perspective: similarity is for identifying redundancy, while difference is for capturing key events. Based on this, we designed a training-free framework named ST-SimDiff. We first construct a spatio-temporal graph from the visual tokens to uniformly model their complex associations. Subsequently, we employ a parallel dual-selection strategy: 1) similarity-based selection uses community detection to retain representative tokens, compressing static information; 2) temporal difference-based selection precisely locates content-changing points to preserve tokens that capture key dynamic shifts. This allows it to preserve both static and dynamic content with a minimal number of tokens. Extensive experiments show our method significantly outperforms state-of-the-art approaches while substantially reducing computational costs. Our code is available in https://github.com/bingjunluo/ST-SimDiff.
ST-SimDiff introduces a training-free framework for visual token compression in Multimodal Large Language Models (MLLMs) during video understanding. The central insight is a dual-perspective approach: similarity identifies redundancy for compression, while difference captures key temporal events that should be preserved. The method constructs a spatio-temporal graph over visual tokens and employs two parallel selection mechanisms: (1) community detection to find and compress clusters of redundant tokens, and (2) temporal edge analysis to identify and retain tokens at content-changing "turning points." This dual-selection paradigm is conceptually clean and addresses a genuine blind spot in prior work, which focused almost exclusively on redundancy removal without explicitly preserving dynamic transitions.
The paper addresses a practical bottleneck: processing long videos with MLLMs is prohibitively expensive. The training-free nature of ST-SimDiff makes it immediately deployable on existing models, which is a significant practical advantage. The dual similarity-difference framework could influence:
However, the impact may be somewhat limited by the fact that the method operates only on visual tokens from the encoder, not addressing other efficiency bottlenecks like KV-cache management or model architecture changes.
This paper is highly timely. Long video understanding with MLLMs is an active research frontier, and computational efficiency is a critical bottleneck. The paper was published at ICLR 2026, positioning it well within the rapid development cycle of efficient MLLM methods. The comparison against recent baselines (FastV, FrameFusion, VisionZip, FasterVLM) demonstrates awareness of the current landscape. The observation that video understanding requires preserving both static content and dynamic transitions is a relevant conceptual contribution that aligns with how humans process video narratives.
The paper's framing of "similarity vs. difference" as complementary perspectives is its strongest intellectual contribution, even if the technical implementation (graph construction + connected components + thresholding) is relatively straightforward. The consistent improvements across models and benchmarks, particularly at the aggressive 30% retention ratio, validate the approach. The availability of code enhances reproducibility.
The work would benefit from analysis on more diverse video types (e.g., surveillance, sports, instructional), deeper investigation of the interaction between τ_sim and τ_diff, and exploration of whether the identified "event tokens" correlate with human-annotated key moments.
Generated May 22, 2026
Paper 2 has significantly broader impact potential as it addresses the transformation of the scientific discovery process itself through AI automation. While Paper 1 presents a solid, technically rigorous method for video processing in MLLMs, Paper 2 provides a foundational framework and survey for 'AutoResearch,' a highly timely and cross-disciplinary topic that could redefine research workflows across all scientific domains.
Paper 2 addresses a widely relevant problem in multimodal LLMs and video understanding—a rapidly growing field with broad applications. Its training-free framework for efficient video token selection offers practical computational savings with a novel similarity-difference dual perspective. The approach is applicable across many video understanding tasks and has released code. Paper 1 addresses a more niche problem (semantic recoverability in tool agents) with a formal but narrower contribution. While rigorous, its impact is limited to structured agent recovery scenarios, whereas Paper 2's efficiency gains for video MLLMs have broader immediate applicability and community interest.
Paper 1 (ST-SimDiff) addresses a broadly impactful problem—efficient video understanding with MLLMs—which is highly timely given the rapid growth of multimodal AI. Its training-free framework combining similarity and difference for token selection is novel, practical, and applicable across many video understanding tasks. Paper 2 (EDGE-OPD) tackles a more niche problem in on-policy self-distillation for rare-token/identity settings. While methodologically interesting, its narrower scope (identity internalization) and specialized application limit its breadth of impact compared to the widely applicable video efficiency gains of Paper 1.
Paper 2 introduces a unified graph-text multimodal LLM for catalytic materials that integrates property prediction and inverse structural design into a single framework, addressing a fundamental limitation (distribution shift between decoupled models) in computational materials science. This has high potential for real-world impact in catalyst discovery and clean energy. Paper 1, while technically solid, addresses the more incremental problem of video token reduction for MLLMs—an active but crowded field with many competing approaches. Paper 2's cross-disciplinary novelty (bridging LLMs and materials science) and practical applications in catalysis give it broader and deeper potential impact.
Spreadsheet-RL addresses a highly practical and widespread problem (spreadsheet automation) with a novel RL-based framework, including a new benchmark, training environment, and data pipeline. Its real-world applicability to billions of spreadsheet users gives it enormous potential impact. While ST-SimDiff offers a clever training-free video token reduction method, it represents more of an incremental improvement in the already crowded video understanding efficiency space. Spreadsheet-RL opens a relatively underexplored research direction combining RL with domain-specific tool use, with broader implications for LLM-based data interface agents.
Paper 1 addresses a widely relevant and active problem in multimodal AI—efficient video understanding with MLLMs—with a concrete, training-free framework showing strong empirical results. The field of video-language models is rapidly growing with broad applications. Paper 2 presents an interesting cross-domain benchmark for coordinated AI agents, but its scope is narrower, the tasks feel somewhat contrived (e.g., molecular sonification), and the findings are mixed, limiting its potential to drive follow-up research. Paper 1's methodological contribution (spatiotemporal graph-based dual selection) is more likely to be adopted and cited in the large MLLM community.
Paper 1 targets a broad, timely shift in agentic AI: replacing external orchestration with “compiled” procedures in model weights, promising major cost, privacy/IP, and deployment benefits. If validated, it could materially change how production agents are built across many domains, impacting both research and industry practice. It also directly addresses adoption barriers with multi-workflow evaluations (including a larger 55-node case). Paper 2 is a solid, practical efficiency method for long-video MLLMs, but is more incremental within an active line of token pruning/selection and may have narrower cross-field impact.
Paper 1 addresses a broadly impactful problem—efficient video understanding with MLLMs—relevant across computer vision, NLP, and multimedia. Its training-free framework with a novel dual perspective (similarity for redundancy, difference for key events) and spatio-temporal graph modeling offers wide applicability. Paper 2, while technically interesting, targets a narrow domain (EDA/Verilog agents) with limited cross-field impact. Paper 1's approach is more generalizable, timely given the rapid growth of MLLMs, and likely to influence a larger research community.
Paper 2 addresses a fundamental flaw in current VLM explainability evaluation by introducing a rigorous metric based on game theory (Shapley Interaction Index). Benchmarks and evaluation frameworks that expose and correct evaluation collapse typically have broad, long-lasting impact across the field, especially for high-stakes applications requiring trustworthy AI. While Paper 1 offers a practical efficiency improvement for video MLLMs, Paper 2's methodological rigor and contribution to safe AI deployment give it a higher potential for foundational scientific impact.
Paper 1 addresses the highly active and impactful area of efficient video understanding with MLLMs, proposing a novel training-free framework that balances similarity and difference for token reduction. Its practical applicability to scaling video processing in large language models, strong experimental results outperforming state-of-the-art methods, and relevance to the booming field of multimodal AI give it broader impact potential. Paper 2, while rigorous, addresses a niche topic in assurance argument semantics with more limited audience and application scope.