Pith. sign in

REVIEW 3 cited by

Dynamic-VLM: Simple Dynamic Visual Token Compression for VideoLLM

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.09530 v1 pith:LJN65KPJ submitted 2024-12-12 cs.CV

classification cs.CV
keywords videoscompressiondatasetsdynamicmodelmodelstokenunderstanding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The application of Large Vision-Language Models (LVLMs) for analyzing images and videos is an exciting and rapidly evolving field. In recent years, we've seen significant growth in high-quality image-text datasets for fine-tuning image understanding, but there is still a lack of comparable datasets for videos. Additionally, many VideoLLMs are extensions of single-image VLMs, which may not efficiently handle the complexities of longer videos. In this study, we introduce a large-scale synthetic dataset created from proprietary models, using carefully designed prompts to tackle a wide range of questions. We also explore a dynamic visual token compression architecture that strikes a balance between computational efficiency and performance. Our proposed \model{} achieves state-of-the-art results across various video tasks and shows impressive generalization, setting new baselines in multi-image understanding. Notably, \model{} delivers an absolute improvement of 2.7\% over LLaVA-OneVision on VideoMME and 10.7\% on MuirBench. Codes are available at https://github.com/Hon-Wong/ByteVideoLLM

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adaptive Two-Stage Visual Token Pruning for Efficient Inference in Video-Language Models

    cs.CV 2026-08 conditional novelty 6.0 of 10

    A training-free two-stage token pruning method for video-language models, using eigenvalue decay of token correlations to set a content-adaptive retention ratio.

  2. CRAFT: Compression via Recursive Adaptive Fusion of Video Tokens for Vision-Language Models

    cs.CV 2026-08 conditional novelty 6.0 of 10

    CRAFT recursively merges video tokens with training-free similarity selection plus learnable gated fusion, retaining ~97% of average accuracy at 8x compression across six benchmarks.

  3. DynTok: Dynamic Compression of Visual Tokens for Efficient and Effective Video Understanding

    cs.CL 2025-06 conditional novelty 4.0 of 10

    DynTok dynamically merges similar adjacent visual tokens into groups, reducing video token counts to 44.4% with comparable or better video understanding accuracy.

Pith tools