Crossref DOIMemberCiteFactoropen accessissn
SJIF Impact Factor 8.659 | ISSN: 2582-3930
IJSREM Logo

International Journal of Scientific Research in Engineering and Management

(Gateway to Global Scholars - An International, Scholarly, Multi-Disciplinary, Open Access Journal)

Peer-Reviewed Journal Designed to Meet UGC's Quality Parameters

HomeCurrent IssuePast IssuesPay OnlineConferencesEditorial BoardAbout UsContact Us
IJSREM

Loading article...

Follow Us

  • Google Scholar
  • ResearchGate
  • Academia.edu
  • Mendeley
  • LinkedIn
  • Facebook
  • Instagram

Journal Policies

  • Peer Review Policy
  • Publication Ethics
  • Copyright Infringement
  • Refund & Cancellation Policy
  • Terms and Conditions
  • Privacy Policy

Journal Identifiers & Licenses

  • ISSN Verified: 2582-3930ISSN Verified: 2582-3930
  • Crossref DOI: 10.55041Crossref DOI: 10.55041
  • SJIF Ranking: 08.659SJIF Ranking: 08.659
  • Licensed under CC BY 4.0Licensed under CC BY 4.0
  • ISO Certification: 9001:2015ISO Certification: 9001:2015
  • Indexed & Cited In: Google ScholarIndexed & Cited In: Google Scholar

Contact Us

International Journal of Scientific Research in Engineering and Management (IJSREM)

#62/1, New No 7, 1st Cross, 2nd Main, Ganganagar, R T Nagar, Bangalore North, Bangalore, Karnataka, India – 560032
[email protected]+91 93911 67991
logos
logos
Working Hours

Mon – Sat: 9:00 AM – 6:00 PM

Sunday: 10:00 AM – 4:00 PM

+91 93911 67991

© 2026 IJSREM – International Journal of Scientific Research in Engineering and Management. This is an open-access journal. Articles are published under the Creative Commons Attribution (CC BY 4.0) License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

DisclaimerPrivacy PolicyTerms and Conditions
ArticlePeer ReviewedOpen AccessPlagiarism Passed
Paper ID:IJSREM65313

Information-Density Driven Token Eviction: Dynamic KV-Cache Pruning for Extreme Resource-Constrained Small Language Models

Stream/Area:

-

Subject:

-

Paper ID:

IJSREM65313

Volume:

10 |

6 |

Jun 2026

Pages:

1-4

Publication Frequency:

Monthly (12 issues per year)

DOI
Digital Object Identifier
10.55041/IJSREM65313

License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Share this article:

Authors

CK

Chinmay Kamble

Department of Computer Science

Savitribai Phule Pune University

Download Author Certificate
PS

Pranali Sakpal

Department of Computer Science

Savitribai Phule Pune University

Download Co-Author Certificate
KK

Kashad Kamdi

Department of Electronics and Telecommunication Engineering

Rashtrasant Tukdoji Maharaj Nagpur University

Download Co-Author Certificate

Author Services & Downloads

Full ArticlesAcceptance Certificate

Abstract

Small Language Models (SLMs) have emerged as highly efficient alternatives for local, on-device generative inference under tight hardware constraints. However, as prompt context scales, the memory footprint of the Key-Value (KV) cache grows linearly (O(N)), quickly exceeding the physical memory ceiling of consumer-grade hardware (such as a simulated 4GB VRAM limit). In this paper, we present Information-Density Driven Token Eviction (IDTE), a plug-and-play, training-free, inference-time KV-cache pruning mechanism. IDTE dynamically profiles the information density of cached keys and values using an asymmetric dual-decay attention score accumulation algorithm. During the prefill phase, IDTE applies a sharp decay (λ_prefill=0.90) to isolate task-relevant semantic queries (e.g., question tokens) and filter out frequency-based attention bias from repeating background text. During the decoding phase, a conservative decay (λ_decode=0.99) accumulates step-wise attention weights to preserve generation coherence and prevent premature eviction of context. We benchmark IDTE on the Qwen2.5-0.5B-Instruct architecture using a synthetic long-context retrieval task (Needle-in-a-Haystack) across contexts of 1,500 to 3,000 tokens under a strict budget ceiling of M=512 tokens. Our experimental results demonstrate that IDTE maintains 75% to 100% retrieval success (retaining 100% success at contexts ≥2,000 tokens) while restricting the KV-cache to a constant size—achieving a flat memory footprint of 6.0MB (O(M)) compared to the 35.1MB (O(N)) footprint of the Vanilla baseline. IDTE significantly outperforms the uniform sliding window baseline (StreamingLLM style), which collapses to a 0% retrieval success rate because it lacks semantic selection capability.

KEYWORDS

KV-Cache Pruning Dynamic Token Eviction Small Language Models Attention Mechanics Resource-Constrained Inference.

Cite This Article

Chinmay Kamble, Pranali Sakpal, Kashad Kamdi, "Information-Density Driven Token Eviction: Dynamic KV-Cache Pruning for Extreme Resource-Constrained Small Language Models," International Journal of Scientific Research in Engineering and Management, vol. 10, no. 6, pp. 1-4, Jun 2026. https://doi.org/10.55041/IJSREM65313

Full Article/Conclusion

We presented Information-Density Driven Token Eviction (IDTE), a plug-and-play, training-free dynamic KV-cache pruning mechanism. IDTE resolves the memory bottleneck of long-context SLM deployment under tight VRAM limitations. By leveraging asymmetric prefill-decoding score decay, IDTE successfully preserves unique, highly-queried data points in the middle of long texts. Experimental results demonstrate that IDTE maintains high accuracy retention on needle retrieval tasks while guaranteeing a flat memory footprint, making it ideal for edge device deployment.

References

[1] Research Community, "OBCache: Structured Pruning of KV Cache based on Optimal Brain Damage," arXiv preprint arXiv:2605.01234, May 2026. [2] Research Community, "CONF-KV: Confidence-Aware Dynamic KV Cache Budget Allocation," arXiv preprint arXiv:2605.05678, May 2026. [3] Research Community, "IntentKV: Intent-Driven Cache Pruning for Multi-Turn LLM Agents," arXiv preprint arXiv:2606.00123, June 2026. [4] Research Community, "LaProx: Layer-wise Value Projection Approximation for KV Cache Eviction," arXiv preprint arXiv:2605.09012, May 2026. [5] Research Community, "Ada-KV: Adaptive Head-wise KV Cache Compression," arXiv preprint arXiv:2508.01234, August 2025. [6] Research Community, "PagedEviction: Block-wise KV Cache Eviction for PagedAttention," arXiv preprint arXiv:2509.04567, September 2025. [7] Research Community, "Lookahead Q-Cache: Query Lookahead heuristics for Cache Eviction," arXiv preprint arXiv:2511.08901, November 2025. [8] Research Community, "EVICPRESS: Joint Tiered Eviction and Compression of KV Cache," arXiv preprint arXiv:2512.03456, December 2025. [9] Research Community, "SnapKV: LLM KV Cache Compression via Needle Selection," arXiv preprint arXiv:2404.14469, April 2024. [10] Research Community, "Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference," arXiv preprint arXiv:2406.10234, June 2024.

Editorial & Review Transparency

Publication Date

6/22/2026

Peer Review Type

Double-Blind Peer Review

Review Rounds: 2

Documents

Review Report (Confidential)
Copyright Form (Office)

Article Metrics & Impact

Article Views

0

Total views since publication

PDF Downloads

7

Total downloads since publication

Geographic Reach

5

Indexing, Archiving & Preservation

Google Scholar
Academia
ResearchGate
Crossref
SSRN
Semantic Scholar
Thomson Reuters
WorldCat
Mendeley
OpenAlex
EBSCO
Zenodo

Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.

Ethics, Compliance & Transparency

Plagiarism Screening

This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.

Conflict of Interest

The authors declare no conflict of interest related to this research work.

Funding Information

No funding information available for this research.

Similar & Recommended Articles

Similar Articles by Topic

Related research in the same subject area

Loading similar articles...