20 results for “coded caching”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper characterizes the memory-rate trade-off for demand-private coded caching with heterogeneous file sizes and cache capacities.
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.
This paper analyzes the efficiency of AI coding agents and identifies the opportunity for reducing unnecessary turns in their loop engineering process.
This paper introduces new metrics to evaluate semantic caching systems and shows that model selection is a calibration problem, not a ranking one.
Fuwei Zhang, Yanzhao Zhang, Mingxin Li, Dingkun Long +4 more
This paper introduces CORE-Bench, a comprehensive benchmark for code retrieval in agentic coding.
The paper proposes adaptive caching for key-value (KV) caching in large language models, improving cache hit rate and reducing time to first token.
This paper analyzes the effectiveness of caching heuristics on cloud object storage and provides a benchmark to measure their performance.
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…
This paper studies the capacity of joint MDS-coded private information retrieval schemes.
This paper uses large language models to improve the best-known bounds for binary linear codes.
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…
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…
This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.
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.
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.
Provides exact information-theoretic outer bounds for storage-repair-bandwidth tradeoff regions for specific cases.
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.
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.