Jinpeng Chen
Author directoryBeihang, BUPT
Other people with similar names: Jinpeng Chen (CUHK)
2026
Bridging Reasoning and Retrieval: A Large-Small Model Collaboration Framework for Multimodal Entity Alignment
Xiongnan Jin | Jianming Lin | Tiantian Mei | Tiantian Zhu | Changxin Huang | Jinpeng Chen | Chaoqun Hong | Jianqiang Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Xiongnan Jin | Jianming Lin | Tiantian Mei | Tiantian Zhu | Changxin Huang | Jinpeng Chen | Chaoqun Hong | Jianqiang Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Multimodal Knowledge Graphs (MMKGs) provide structured multimodal grounding for Multimodal Large Language Models (MLLMs), while Multimodal Entity Alignment (MMEA) is essential for integrating heterogeneous MMKGs. However, existing MMEA methods remain vulnerable to noisy modalities and unreliable pseudo-supervision. We propose CRMEA, a large–small collaborative framework for unsupervised MMEA that unifies PTM-based retrieval and MLLM-based reasoning through a closed-loop optimization process. CRMEA introduces a text-centric adaptive cross-modal coordination mechanism to regulate noisy visual evidence, together with a retrieve-and-vote strategy for reliable pseudo-supervision. Extensive experiments show that CRMEA consistently outperforms existing unsupervised MMEA methods and achieves performance competitive with state-of-the-art supervised approaches, while maintaining strong robustness, adaptability across heterogeneous backbones, and substantially improved cost-effectiveness over exhaustive MLLM-based alignment. Code and data are available at https://github.com/nsai-szu/CRMEA.
See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs
Yicheng Ji | Jun Zhang | Jinpeng Chen | Cong Wang | Lidan Shou | Gang Chen | Huan Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yicheng Ji | Jun Zhang | Jinpeng Chen | Cong Wang | Lidan Shou | Gang Chen | Huan Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Video Large Language Models (Video-LLMs) excel in video understanding but suffer from high inference latency due to autoregressive generation. Speculative Decoding (SD) mitigates this by applying a draft-and-verify paradigm, yet existing methods are constrained by rigid exact-match rules, severely limiting the acceleration potential. To bridge this gap, we propose LVSpec, the first training-free loosely SD framework tailored for Video-LLMs. Grounded in the insight that generation is governed by sparse visual-relevant anchors (mandating strictness) amidst abundant visual-irrelevant fillers (permitting loose verification), LVSpec employs a lightweight visual-relevant token identification scheme to accurately pinpoint the former. To further maximize acceptance, we augment this with a position-shift tolerant mechanism that effectively salvages positionally mismatched but semantically equivalent tokens. Experiments demonstrate that LVSpec is high-fidelity and rapid: it preserves >99.8% of target performance while accelerating Qwen2.5-VL-32B by 2.70 × and LLaVA-OneVision-72B by 2.94 ×. Notably, it boosts the mean accepted length and speedup ratio by 136% and 35% compared to SOTA training-free SD methods for Video-LLMs. Code is provided in the submitted software.
2025
SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning
Yicheng Ji | Jun Zhang | Heming Xia | Jinpeng Chen | Lidan Shou | Gang Chen | Huan Li
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Yicheng Ji | Jun Zhang | Heming Xia | Jinpeng Chen | Lidan Shou | Gang Chen | Huan Li
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Video large language models (Vid-LLMs) have shown strong capabilities in understanding video content. However, their reliance on dense video token representations introduces substantial memory and computational overhead in both prefilling and decoding. To mitigate the information loss of recent video token reduction methods and accelerate the decoding stage of Vid-LLMs losslessly, we introduce SpecVLM, a training-free speculative decoding (SD) framework tailored for Vid-LLMs that incorporates staged video token pruning.Building on our novel finding that the draft model’s speculation exhibits low sensitivity to video token pruning, SpecVLM prunes up to 90% of video tokens to enable efficient speculation without sacrificing accuracy. To achieve this, we performs a two-stage pruning process: Stage I selects highly informative tokens guided by attention signals from the verifier (target model), while Stage II prunes remaining redundant ones in a spatially uniform manner.Extensive experiments on four video understanding benchmarks demonstrate the effectiveness and robustness of SpecVLM, which achieves up to 2.68× decoding speedup for LLaVA-OneVision-72B and 2.11× speedup for Qwen2.5-VL-32B. Code is available at https://github.com/zju-jiyicheng/SpecVLM.