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

Kazi Hasan Ibn Arif

dblp:385/8989 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 · 50% Vision and language · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 50% GPUs and heterogeneous computing · 50%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › vision-language model
high-resolution vision-language models
0.912025
HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models · AAAI 2025
Machine learning › Efficient and distributed learning
inference efficiency
0.912025
HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models · AAAI 2025
Computer vision › Vision and language › vision-language model
vision-language model inference
0.912025
HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models · AAAI 2025
Machine learning › Efficient and distributed learning › model compression › token compression
visual token reduction
0.912025
HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models · AAAI 2025
GPUs and heterogeneous computing
GPU memory management
0.312025
HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models · AAAI 2025
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.312025
HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models · AAAI 2025

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

vision transformer · 1.7large language model · 1.7attention-guided token dropping · 1.7
YearPublicationVenuePosition
2025 HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models
abstract
High-resolution Vision-Language Models (VLMs) are widely used in multimodal tasks to enhance accuracy by preserving detailed image information. However, these models often generate an excessive number of visual tokens due to the need to encode multiple partitions of a high-resolution image input. Processing such a large number of visual tokens poses significant computational challenges, particularly for resource-constrained commodity GPUs. To address this challenge, we propose High-Resolution Early Dropping (HiRED), a plug-and-play token-dropping method designed to operate within a fixed token budget. HiRED leverages the attention of CLS token in the vision transformer (ViT) to assess the visual content of the image partitions and allocate an optimal token budget for each partition accordingly. The most informative visual tokens from each partition within the allocated budget are then selected and passed to the subsequent Large Language Model (LLM). We showed that HiRED achieves superior accuracy and performance, compared to existing token-dropping methods. Empirically, HiRED-20% (i.e., a 20% token budget) on LLaVA-Next-7B achieves a 4.7x increase in token generation throughput, reduces response latency by 78%, and saves 14% of GPU memory for single inference on an NVIDIA TESLA P40 (24 GB). For larger batch sizes (e.g., 4), HiRED-20% prevents out-of-memory errors by cutting memory usage by 30%, while preserving throughput and latency benefits.
Kazi Hasan Ibn Arif, JinYi Yoon, Dimitrios S. Nikolopoulos, Hans Vandierendonck, Chacko John Deepu, Bo Ji 0001
AAAI1