Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rounak Sharma

dblp:400/7017 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0009-8205-040XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 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
Language models and text generation · 69% Efficient and distributed learning · 31%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 50% Indexing and storage engines · 50%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › hallucination detection
context faithfulness
1.012026
Tokens to Types: Context Editing with Selective Entity Abstraction for Grounded Generation · SIGIR 2026
Natural language and speech › Language models and text generation › text generation
grounded text generation
1.012026
Tokens to Types: Context Editing with Selective Entity Abstraction for Grounded Generation · SIGIR 2026
Natural language and speech › Language models and text generation › retrieval-augmented generation
knowledge conflict
1.012026
Tokens to Types: Context Editing with Selective Entity Abstraction for Grounded Generation · SIGIR 2026
Machine learning › Efficient and distributed learning › inference efficiency
inference optimization
0.912025
Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation · Proc. ACM Manag. Data 2025
Machine learning › Efficient and distributed learning › inference efficiency
KV cache reuse
0.912025
Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation · Proc. ACM Manag. Data 2025
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.912025
Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation · Proc. ACM Manag. Data 2025
Indexing and storage engines › caching
cache management
0.912025
Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation · Proc. ACM Manag. Data 2025
Information retrieval
retrieval-augmented generation
0.912025
Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation · Proc. ACM Manag. Data 2025

Methods — techniques the papers use, named apart from their topics

continuous batching · 1.7cache eviction · 1.7KV cache reuse · 1.7symbolic abstraction · 1.0entity abstraction · 1.0context editing · 1.0
YearPublicationVenuePosition
2026 Tokens to Types: Context Editing with Selective Entity Abstraction for Grounded Generation
abstract
Large language models (LLMs) frequently prioritize parametric world knowledge over provided context -- a failure mode that is particularly catastrophic in enterprise or counterfactual settings where local facts contradict web-scale training data. While modern reasoning models improve general response quality, they fail to resolve these underlying prior knowledge biases even when generating a high volume of costly thinking tokens. We propose a context-editing framework that addresses this by performing selective abstraction over entities that appear in both the context and the question. Our approach replaces these overlapping entities with typed, indexed identifiers (e.g., Paris with City łangle1\rangle), suppressing spurious lexical associations while preserving the relational structure required for grounded reasoning. This mechanism is decoupled into an offline preprocessing stage and a lightweight inference-time substitution, requiring no model retraining. Experiments across counterfactual and multi-hop knowledge-conflict benchmarks demonstrate consistent accuracy gains across many model families, open- and closed-sourced, especially for small to medium sized LLMs (0.5B to 18B). Notably, our framework yields up to a 25% improvement over state-of-the-art instruct models and 13% over reasoning models, establishing symbolic abstraction as a highly cost-efficient solution for ensuring context fidelity in LLMs.
Rounak Sharma, Debabrata Mahapatra, Shiv Kumar Saini
SIGIR1
2025 Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation
abstract
Retrieval-Augmented Generation (RAG) is often used with Large Language Models (LLMs) to infuse domain knowledge or user-specific information. In RAG, given a user query, a retriever extracts chunks of relevant text from a knowledge base. These chunks are sent to an LLM as part of the input prompt. Typically, any given chunk is repeatedly retrieved across user questions. However, currently, for every question, attention layers in LLMs fully compute the Keys and Values (KVs) repeatedly for the input chunks, as state-of-the-art methods cannot reuse KV-caches when chunks appear at arbitrary locations or with arbitrary contexts. Naive reuse leads to output quality degradation. This leads to potentially redundant computations on expensive GPUs and increases latency. In this work, we propose Cache-Craft , a system for managing and reusing precomputed KVs corresponding to the text chunks (which we call chunk-caches ) in RAG-based systems. We present how to identify chunk-caches that are reusable, how to efficiently perform a small fraction of recomputation to fix the cache and maintain output quality, and how to efficiently store and evict chunk-caches in the hardware for maximizing reuse while masking any overheads. With real production workloads as well as synthetic datasets, we show that Cache-Craft reduces redundant computation by 51% over SOTA prefix-caching and 75% over full recomputation. Additionally, with continuous batching on a real production workload, we get a 1.6× speed up in throughput for both the LLama-3-8B and 70B models and a 2.1× and 2× reduction in end-to-end response latency respectively, compared to prefix-caching, while maintaining generation quality.
Shubham Agarwal 0007, Sai Sundaresan, Subrata Mitra, Debabrata Mahapatra, Archit Gupta, Rounak Sharma, Nirmal Joshua Kapu, Tong Yu 0001, Shiv Kumar Saini
Proc. ACM Manag. Data6