paper-with-me

홈 › Papers

Cross-Layer Cache Aggregation for Token Reduction in Ultra-Fine-Grained Image Recognition

2024-12-31 · Edwin Arkel Rios, Jansen Christopher Yuanda, Vincent Leon Ghanz, Cheng-Wei Yu, Bo-Cheng Lai, Min-Chun Hu

Ultra-fine-grained image recognition (UFGIR) is a challenging task that involves classifying images within a macro-category. While traditional FGIR deals with classifying different species, UFGIR goes beyond by classifying sub-categories within a species such as cultivars of a plant. In recent times the usage of Vision Transformer-based backbones has allowed methods to obtain outstanding recognition performances in this task but this comes at a significant cost in terms of computation specially since this task significantly benefits from incorporating higher resolution images. Therefore, techniques such as token reduction have emerged to reduce the computational cost. However, dropping tokens leads to loss of essential information for fine-grained categories, specially as the token keep rate is reduced. Therefore, to counteract the loss of information brought by the usage of token reduction we propose a novel Cross-Layer Aggregation Classification Head and a Cross-Layer Cache mechanism to recover and access information from previous layers in later locations. Extensive experiments covering more than 2000 runs across diverse settings including 5 datasets, 9 backbones, 7 token reduction methods, 5 keep rates, and 2 image sizes demonstrate the effectiveness of the proposed plug-and-play modules and allow us to push the boundaries of accuracy vs cost for UFGIR by reducing the kept tokens to extremely low ratios of up to 10\% while maintaining a competitive accuracy to state-of-the-art models. Code is available at: \url{https://github.com/arkel23/CLCA}

📄 PDF Abstract BibTeX arXiv:2501.00243

Code (1)

arkel23/clca 공식 구현 pytorch

Tasks

Fine-Grained Image RecognitionToken Reduction

Similar Papers 제목 키워드 기반

Adaptive Layer Selection for Layer-Wise Token Pruning in LLM Inference

2026-01-12 · Rei Taniguchi, Yuyang Dong, Makoto Onizuka, Chuan Xiao arxiv

Due to the prevalence of large language models (LLMs), key-value (KV) cache reduction for LLM inference has received remarkable attention. Among numerous works that have been proposed in recent years, layer-wise token pr…

KVCompose: Efficient Structured KV Cache Compression with Composite Tokens

2025-09-05 · Dmitry Akulov, Mohamed Sana, Antonio De Domenico, Tareq Si Salem 외 arxiv

Large language models (LLMs) rely on key-value (KV) caches for efficient autoregressive decoding; however, cache size grows linearly with context length and model depth, becoming a major bottleneck in long-context infere…

DepthWeave-KV: Token-Adaptive Cross-Layer Residual Factorization for Long-Context KV Cache Compression

2026-07-07 · Anna Cordoba, Adam Puente Tercero, Nerea Angulo Hijo, Mar Linares Tercero 외 arxiv

Long-context language model inference is increasingly limited by the memory bandwidth and capacity required to store key-value caches, yet existing compression methods often apply uniform budgets across layers or tokens …

CLAA: Cross-Layer Attention Aggregation for Accelerating LLM Prefill

2026-02-17 · Bradley McDanel, Steven Li, Harshit Khaitan arxiv

The prefill stage in long-context LLM inference remains a computational bottleneck. Recent token-ranking heuristics accelerate inference by selectively processing a subset of semantically relevant tokens. However, existi…

Krul: Efficient State Restoration for Multi-turn Conversations with Dynamic Cross-layer KV Sharing

2025-07-10 · Junyi Wen, Junyuan Liang, Zicong Hong, Wuhui Chen 외

Efficient state restoration in multi-turn conversations with large language models (LLMs) remains a critical challenge, primarily due to the overhead of recomputing or loading full key-value (KV) caches for all historica…