Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Desheng Hui

dblp:414/9810 · DBLP profile ↗
← Back
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 · 77% Language models and text generation · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › token reduction
adaptive token pruning
1.012026
SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning · AAAI 2026
Machine learning › Efficient and distributed learning
KV cache management
1.012026
SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning · AAAI 2026
Machine learning › Efficient and distributed learning › inference efficiency
LLM inference optimization
1.012026
SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning · AAAI 2026
Natural language and speech › Language models and text generation › large language model inference
long-context inference
1.012026
SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning · AAAI 2026
Machine learning › Efficient and distributed learning
attention computation
0.312026
SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning · AAAI 2026

Methods — techniques the papers use, named apart from their topics

dynamic token pruning · 1.0asynchronous KV cache prefetching · 1.0
YearPublicationVenuePosition
2026 SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning
abstract
Long-context inference for Large Language Models (LLMs) is heavily limited by high computational demands. While several existing methods optimize attention computation, they still process the full set of hidden states at each layer, limiting overall efficiency. In this work, we propose SlimInfer, an innovative framework that aims to accelerate inference by directly pruning less critical prompt tokens during the forward pass. Our key insight is an information diffusion phenomenon: As information from critical tokens propagates through layers, it becomes distributed across the entire sequence. This diffusion process suggests that LLMs can maintain their semantic integrity when excessive tokens, even including these critical ones, are pruned in hidden states. Motivated by this, SlimInfer introduces a dynamic fine-grained pruning mechanism that accurately removes redundant tokens of hidden state at intermediate layers. This layer-wise pruning naturally enables an asynchronous KV cache manager that prefetches required token blocks without complex predictors, reducing both memory usage and I/O costs. Extensive experiments show that SlimInfer can achieve up to 2.53× time-to-first-token (TTFT) speedup and 1.88× end-to-end latency reduction for LLaMA3.1-8B-Instruct on a single RTX 4090, without sacrificing performance on LongBench.
Lingkun Long, Rubing Yang, Yushi Huang, Desheng Hui, Jianlei Yang 0001
AAAI4