VLDB 2026 Research / reviewers in the wild / expert
Yicheng Ji
dblp:228/5492
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0002-1876-5602ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Efficient and distributed learning · 80% Vision and language · 20% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
inference acceleration |
1.9 | 2 | 2026 | See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs · ACL (1) 2026 SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning · EMNLP 2025 |
Machine learning › Efficient and distributed learning › inference acceleration
speculative decoding |
1.9 | 2 | 2026 | See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs · ACL (1) 2026 SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning · EMNLP 2025 |
Computer vision › Vision and language › video-language model
video large language model |
1.2 | 2 | 2026 | SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning · EMNLP 2025 See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs · ACL (1) 2026 |
Machine learning › Efficient and distributed learning › model compression
token pruning |
0.9 | 1 | 2025 | SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token Pruning · EMNLP 2025 |
Methods — techniques the papers use, named apart from their topics
visual-semantic guidance · 1.0position-shift tolerant verification · 1.0verifier-guided token pruning · 0.9attention signal · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMsabstractVideo Large Language Models (Video-LLMs) excel in video understanding but suffer from high inference latency during 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 visualirrelevant 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 achieves high fidelity and speed: 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 at https://github.com/zju-jiyicheng/LVSpec. Yicheng Ji, Jun Zhang 0069, Jinpeng Chen 0001, Lidan Shou, Gang Chen 0001, Huan Li 0003 |
ACL (1) | 1 |
| 2025 | SpecVLM: Enhancing Speculative Decoding of Video LLMs via Verifier-Guided Token PruningabstractVideo 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 perform a two-stage pruning process: Stage I selects highly informative tokens guided by attention signals from the verifier (target model), while Stage II prunes the 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. Yicheng Ji, Jun Zhang 0069, Heming Xia, Jinpeng Chen 0001, Lidan Shou, Gang Chen 0001, Huan Li 0003 |
EMNLP | 1 |