ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “coded caching”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ITTheoreticalRecentOct 9, 2026

Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files

Tati V D N Eswar, Jithin Ravi

The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.

View →
cs.DCcs.OSEmpiricalRecentJun 15, 2026

CacheWise: Understanding Workloads and Optimizing KVCache Management for Efficiently Serving LLM Coding Agents

Shubham Tiwari, Tapan Chugh, Nash Rickert, Simon Peter +2 more

This paper presents a new KVCache management layer called CacheWise that improves performance for coding agent workloads.

View →
cs.SEcs.AIcs.ETEmpiricalRecentOct 10, 2026

TurnCost: Turns, Not Observations: Cache-Aware Loop Engineering for Coding Agents

Pramod Kumar, Raj Kumar Pandey

This paper analyzes the efficiency of AI coding agents and identifies the opportunity for reducing unnecessary turns in their loop engineering process.

View →
cs.IRcs.CLcs.LGEmpiricalRecentJun 18, 2026

Closing the Calibration Gap in Semantic Caching

Aditeya Baral, Radoslav Ralev, Iliya Sotirov Zhechev, Srijith Rajamohan +1 more

This paper introduces new metrics to evaluate semantic caching systems and shows that model selection is a calibration problem, not a ranking one.

View →
cs.IREmpiricalRecentJun 10, 2026

CORE-Bench: A Comprehensive Benchmark for Code Retrieval in the Era of Agentic Coding

Fuwei Zhang, Yanzhao Zhang, Mingxin Li, Dingkun Long +4 more

This paper introduces CORE-Bench, a comprehensive benchmark for code retrieval in agentic coding.

View →
cs.DCcs.AIcs.LGEmpiricalRecentJun 19, 2026

Recency/Frequency Adaptive KV Caching for Large Language Model Serving

Yang Shen, Meghana Madhyastha, Robert Underwood, Bogdan Nicolae +1 more

The paper proposes adaptive caching for key-value (KV) caching in large language models, improving cache hit rate and reducing time to first token.

View →
cs.DBcs.DSEmpiricalRecentJun 18, 2026

Caching for Dollars, Not Hits: An Exact Offline Reference for Cloud-Egress Caching and the Crossover That Decides When It Pays

Madhulatha Mandarapu, Sandeep Kunkunuru

This paper analyzes the effectiveness of caching heuristics on cloud object storage and provides a benchmark to measure their performance.

View →
cs.IRcs.AIcs.CLEmpiricalRecentJul 29, 2026

MediaWiki Code2Code Search: Neural Retrieval for the Semantic Discovery of Open-Source Software Entities

Francesco Tosoni

This paper presents MediaWiki Code2Code Search, a neural retrieval system for semantic code-to-code discovery in large-scale ecosystems, achieving superior performance over traditional Information Ret…

View →
cs.ITTheoreticalRecentJun 22, 2026

Private Information Retrieval from Joint Systematic MDS-Coded with Non-Colluding Servers: Bounds and Constructions

Jingke Xu, Lirong Shi, Peng Lan, Weijun Fang

This paper studies the capacity of joint MDS-coded private information retrieval schemes.

View →
cs.ITcs.AIcs.NEEmpiricalRecentSep 29, 2026

Evolving Towards Better Codes: LLM-Guided Search for High-Distance Binary Linear Codes

Amal Seddas, Vladyslav Shashkov, Maryna Viazovska, Emmanuel Abbe

This paper uses large language models to improve the best-known bounds for binary linear codes.

View →
cs.CRcs.AIcs.CLRecentMay 26, 2026

Grounded Cache Routing for Retrieval-Augmented Generation: When Is It Safe to Reuse an Answer?

Syed Huma Shah

The paper proposes GroundedCache, an evidence-validated cache router that significantly improves the safety of reusing cached semantic answers in RAG systems by requiring multiple gates to validate th…

View →
cs.HCcs.AIEmpiricalRecentAug 10, 2026

Can Coding Agents Solve Repository-Level Issues with Rendered Code? An Exploratory Study of Visual Representations

Weijie Liang, Yuanfeng Song, Xing Chen, Caleb Chen Cao +2 more

This paper evaluates the use of rendered code as operational context for agentic coding, showing consistent reduction in prompt-token cost but limited increase in linear savings and end-to-end repair…

View →
cs.ITTheoreticalRecentJul 7, 2026

From Bit to Block: Capacity Achievement via Product Coding

Bin Zhang

This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.

View →
cs.DBcs.DSEmpiricalRecentJun 15, 2026

C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression

Kepan Zhang, Tiancheng Zhao, Helen Xu

This paper proposes C^2, a set of techniques to improve the spatial locality of succinct tries, resulting in faster query performance and reduced memory footprint.

View →
cs.AIcs.CLcs.SEEmpiricalRecentNov 12, 2026

CoReMem: Cost-Internalizing Memory for Successive Coding Tasks with Prospective Valuation

Peiwen Li, Harshit Verma, Sophia Zhou, Haiwen Wang +5 more

This paper introduces Coding-Repository Memory (CoReMem), a framework that guides memory design and actor adaptation for coding agents.

View →
cs.ITTheoreticalRecentOct 20, 2026

Exact Storage-Repair-Bandwidth Tradeoffs for $(6,5,5)$ and $(7,6,6)$ Exact-Repair Regenerating Codes

Chao Tian

Provides exact information-theoretic outer bounds for storage-repair-bandwidth tradeoff regions for specific cases.

View →
cs.ARcs.DCEmpiricalRecentOct 24, 2026

ZipFusion: Fusing Lossless KV Decompression with Attention for Efficient LLM Decoding

Yuetao Chen, Peng Wang, Hong Xu

This paper presents ZipFusion, a method that enables attention to consume losslessly compressed key-value (KV) cache directly, improving model decode throughput and reducing memory-bandwidth bound.

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

View →