Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yaotao Wei
dblp:431/2626
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper |
Efficient and distributed learning · 67% Vision and language · 33% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | TOP-RL: Task-Optimized Progressive Token Pruning with Reinforcement Learning for Vision Language Models · AAAI 2026 |
Machine learning › Efficient and distributed learning › model compression › token pruning
visual token pruning |
1.0 | 1 | 2026 | TOP-RL: Task-Optimized Progressive Token Pruning with Reinforcement Learning for Vision Language Models · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.0markov decision process · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | TOP-RL: Task-Optimized Progressive Token Pruning with Reinforcement Learning for Vision Language ModelsabstractIn recent years, Large Vision-Language Models (LVLMs) have significantly advanced multimodal tasks. However, their inference requires intensive processing of numerous visual tokens and incurs substantial computational overhead. Existing methods typically compress visual tokens either at the input stage or in early model layers, ignoring variations across tasks and depths. To address these limitations, we introduce TOP-RL, a Task-Optimized Progressive token pruning framework based on Reinforcement Learning. TOP-RL formulates visual token pruning as a multi-stage Markov Decision Process (MDP). It employs an agent trained with dense and fine-grained reward signals to progressively generate differentiable binary masks. This enables TOP-RL to adaptively select crucial visual tokens tailored to each task, effectively balancing accuracy and computational efficiency. Extensive experiments on leading multimodal datasets and advanced LVLMs validate that TOP-RL effectively learns task-optimized pruning policies, significantly boosting inference efficiency while preserving robust performance. For instance, LLaVA-NeXT equipped with TOP-RL achieves a 1.9x speedup in inference time and a 9.3x reduction in FLOPs, with 96% performance preserved. Hengyi Wang, Weiying Xie, Yaotao Wei, Kai Jiang 0001, Mingxiang Cao, Chenhe Hao, Leyuan Fang |
AAAI | 4 |