VLDB 2026 Research / reviewers in the wild / expert
Abedelkadir Asi
dblp:119/2553 · also Abedelkader Asi
· DBLP profile ↗
11ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0006-2985-4554ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 3 · 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
2 papers |
Efficient and distributed learning · 70% Language models and text generation · 30% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › KV cache management
KV cache compression |
1.7 | 2 | 2025 | R-KV: Redundancy-aware KV Cache Compression for Reasoning Models · NeurIPS 2025 Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning · ICLR 2025 |
Natural language and speech › Language models and text generation › large language model inference
long-context inference |
0.9 | 1 | 2025 | Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning · ICLR 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.9 | 1 | 2025 | R-KV: Redundancy-aware KV Cache Compression for Reasoning Models · NeurIPS 2025 |
Machine learning › Efficient and distributed learning
inference efficiency |
0.3 | 1 | 2025 | R-KV: Redundancy-aware KV Cache Compression for Reasoning Models · NeurIPS 2025 |
Machine learning › Efficient and distributed learning
memory optimization |
0.3 | 1 | 2025 | R-KV: Redundancy-aware KV Cache Compression for Reasoning Models · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
token selection · 0.9redundancy-aware compression · 0.9attention head analysis · 0.9KV cache compression · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and ReasoningabstractKey-Value (KV) caching is a common technique to enhance the computational efficiency of Large Language Models (LLMs), but its memory overhead grows rapidly with input length. Prior work has shown that not all tokens are equally important for text generation, proposing layer-level KV cache compression to selectively retain key information. Recognizing the distinct roles of attention heads in generation, we propose HeadKV, a head-level KV cache compression method, and HeadKV-R2, which leverages a novel contextual reasoning ability estimation for compression. Our approach operates at the level of individual heads, estimating their importance for contextual QA tasks that require both retrieval and reasoning capabilities. Extensive experiments across diverse benchmarks (LongBench, LooGLE), model architectures (e.g., Llama-3-8B-Instruct, Mistral-7B-Instruct), and long-context abilities tests demonstrate that our head-level KV cache compression significantly outperforms strong baselines, particularly in low-resource settings (KV size = 64 & 128). Notably, our method retains just 1.5% of the KV cache while achieving 97% of the performance of the full KV cache on the contextual question answering benchmark. Yu Fu 0009, Zefan Cai, Abedelkadir Asi, Wayne Xiong, Yue Dong 0002 |
ICLR | 3 |
| 2025 | R-KV: Redundancy-aware KV Cache Compression for Reasoning ModelsabstractReasoning models have demonstrated impressive performance in self-reflection and chain-of-thought reasoning. However, they often produce excessively long outputs, leading to prohibitively large key-value (KV) caches during inference. While chain-of-thought inference significantly improves performance on complex reasoning tasks, it can also lead to reasoning failures when deployed with existing KV cache compression approaches. To address this, we propose Redundancy-aware KV Cache Compression for Reasoning models (R-KV), a novel method specifically targeting redundant tokens in reasoning models. Our method preserves nearly 100% of the full KV cache performance using only 10% of the KV cache, substantially outperforming existing KV cache baselines, which reach only 60% of the performance. Remarkably, R-KV even achieves 105% of full KV cache performance with 38% of the KV cache. This KV-cache reduction also leads to a 50% memory saving and a 2x speedup over standard chain-of-thought reasoning inference. Experimental results show that R-KV consistently outperforms existing KV cache compression baselines across two mathematical reasoning datasets. Zefan Cai, Hanshi Sun, Yeyang Zhou, Li-Wen Chang, Jiuxiang Gu, Anima Anandkumar, Abedelkadir Asi, Junjie Hu 0001 |
NeurIPS | 13 |
| 2023 | Comparing Fine-Tuned Transformers and Large Language Models for Sales Call Classification: A Case StudyabstractWe present a research project carried out to enable a Call Categorization Service (CCS) for Dynamics 365 Sales Conversation Intelligence. CCS identifies prevalent types of sales calls based on their transcription, for the purpose of automating manual sales processes and making informed business decisions. We sift through R&D process, and provide clear evidence that purpose-focused fine-tuned transformers out-perform GPT-3 in this text classification task. Additionally we share: an efficient, non-trivial data annotation approach suited to the problem of finding data related to rare categories in a highly unbalanced data source; Considerations regarding zero-shot and in-context learning (i.e. few-shot learning) when using LLMs for classification and cost and performance analysis that opt in favor of fine-tuned transformers as well. Roy Eisenstadt, Abedelkadir Asi, Royi Ronen |
CIKM | 2 |
| 2017 | On writer identification for Arabic historical manuscripts
Abedelkadir Asi, Alaa Abdalhaleem, Daniel Fecker, Volker Märgner, Jihad El-Sana |
Int. J. Document Anal. Recognit. | 1 |
| 2015 | Simplifying the reading of historical manuscriptsabstractComplex document layouts pose prominent challenges for document image understanding algorithms. These layouts impose irregularities on the location of text paragraphs which consequently induces difficulties in reading the text. In this paper we present a robust framework for analyzing historical manuscripts with complex layouts. This framework aims to provide a convenient reading experience for historians through topnotch algorithms for text localization, classification and dewarping. We segment text into spatially coherent regions and text-lines using texture-based filters and refine this segmentation by exploiting Markov Random Fields (MRFs). A principled technique is presented for dewarping curvy text regions using a non-linear geometric transformation. The framework has been validated using a subset of a publicly available dataset of historical documents and it provided promising results. Abedelkadir Asi, Rafi Cohen, Klara Kedem, Jihad El-Sana |
ICDAR | 1 |
| 2014 | A Coarse-to-Fine Approach for Layout Analysis of Ancient ManuscriptsabstractMany applications along the manuscript analysis pipeline rely on the accuracy of pre-processing steps. Perfectly detecting the main text area in ancient historical documents is of great importance for these applications. We propose a learning-free approach to detect the main text area in ancient manuscripts. First, we coarsely segment the main text area by using a texture-based filter. Then, we refine the segmentation by formulating the problem as an energy minimization task and achieving the minimum using graph cuts. The energy function is derived from properties of the text components. Spatial coherence of the segmented text regions is explicitly encouraged by the energy function. We evaluate the suggested method on a publicly available dataset of 38 historical document images. Experiments show that the suggested approach outperforms another state-of-the-art page segmentation method in terms of segmentation quality and time performance. Abedelkadir Asi, Rafi Cohen, Klara Kedem, Jihad El-Sana, Its'hak Dinstein |
ICFHR | 1 |
| 2014 | Document Writer Analysis with Rejection for Historical Arabic ManuscriptsabstractDetermining the individuality of handwriting in ancient manuscripts is an important aspect of the manuscript analysis process. Automatic identification of writers in historical manuscripts can support historians to gain insights into manuscripts with missing metadata such as writer name, period, and origin. In this paper writer classification and retrieval approaches for multi-page documents in the context of historical manuscripts are presented. The main contribution is a learning-based rejection strategy which utilizes writer retrieval and support vector machines for rejecting a decision if no corresponding writer can be found for a query manuscript. Experiments using different feature extraction methods demonstrate the abilities of our proposed methods. A dedicated data set based on a publicly available database of historical Arabic manuscripts was used and the experiments show promising results. Daniel Fecker, Abedelkadir Asi, Werner Pantke, Volker Märgner, Jihad El-Sana, Tim Fingscheidt |
ICFHR | 2 |
| 2014 | Writer Identification for Historical Arabic DocumentsabstractIdentification of writers of handwritten historical documents is an important and challenging task. In this paper we present several feature extraction and classification approaches for the identification of writers in historical Arabic manuscripts. The approaches are able to successfully identify writers of multipage documents. The feature extraction methods rely on different principles, such as contour-, textural- and key point-based and the classification schemes are based on averaging and voting. For all experiments a dedicated data set based on a publicly available database is used. The experiments show promising results and the best performance was achieved using a novel feature extraction based on key point descriptors. Daniel Fecker, Abedelkadir Asi, Volker Märgner, Jihad El-Sana, Tim Fingscheidt |
ICPR | 2 |
| 2014 | Text line extraction for historical document images
Raid Saabni, Abedelkadir Asi, Jihad El-Sana |
Pattern Recognit. Lett. | 2 |
| 2013 | WebGT: An Interactive Web-Based System for Historical Document Ground Truth GenerationabstractWe present WebGT, the first web-based system to help users produce ground truth data for document images. This user-friendly software system helps historians and computer scientists collectively annotate historical documents. It supports real time collaboration among remote sites independent of the local operating system and also provides several novel semi-automatic tools that have proven effective for annotating degraded documents. Ofer Biller, Abedelkadir Asi, Klara Kedem, Its'hak Dinstein |
ICDAR | 2 |
| 2012 | Layout Analysis for Arabic Historical Document Images Using Machine LearningabstractPage layout analysis is a fundamental step of any document image understanding system. We introduce an approach that segments text appearing in page margins (a.k.a side-notes text) from manuscripts with complex layout format. Simple and discriminative features are extracted in a connected-component level and subsequently robust feature vectors are generated. Multilayer perception classifier is exploited to classify connected components to the relevant class of text. A voting scheme is then applied to refine the resulting segmentation and produce the final classification. In contrast to state-of-the-art segmentation approaches, this method is independent of block segmentation, as well as pixel level analysis. The proposed method has been trained and tested on a dataset that contains a variety of complex side-notes layout formats, achieving a segmentation accuracy of about 95%. Syed Saqib Bukhari, Thomas M. Breuel, Abedelkadir Asi, Jihad El-Sana |
ICFHR | 3 |