Table of Contents
Fetching ...

Context Dependence and Reliability in Autoregressive Language Models

Poushali Sengupta, Shashi Raj Pandey, Sabita Maharjan, Frank Eliassen

TL;DR

This work tackles the challenge of explaining autoregressive LLM behavior in the presence of redundant context by introducing RISE, a dependence-aware scoring method. RISE quantifies the unique information each structured context unit provides about the next-token distribution, using conditional mutual information and normalization to suppress redundancy. The authors formalize theoretical properties, analyze computational aspects, and present an integrated lightweight selector alongside an optional learned module to retain only informative anchors. Empirical results on open-weight models demonstrate that RISE reduces redundancy-driven attribution inflation, improves interpretability, and yields actionable monitoring signals for prompt auditing, retrieval validation, and safety in practical deployments. Overall, RISE advances trustworthy AI explanations by prioritizing true dependence over frequency or overlap in long, structured contexts.

Abstract

Large language models (LLMs) generate outputs by utilizing extensive context, which often includes redundant information from prompts, retrieved passages, and interaction history. In critical applications, it is vital to identify which context elements actually influence the output, as standard explanation methods struggle with redundancy and overlapping context. Minor changes in input can lead to unpredictable shifts in attribution scores, undermining interpretability and raising concerns about risks like prompt injection. This work addresses the challenge of distinguishing essential context elements from correlated ones. We introduce RISE (Redundancy-Insensitive Scoring of Explanation), a method that quantifies the unique influence of each input relative to others, minimizing the impact of redundancies and providing clearer, stable attributions. Experiments demonstrate that RISE offers more robust explanations than traditional methods, emphasizing the importance of conditional information for trustworthy LLM explanations and monitoring.

Context Dependence and Reliability in Autoregressive Language Models

TL;DR

This work tackles the challenge of explaining autoregressive LLM behavior in the presence of redundant context by introducing RISE, a dependence-aware scoring method. RISE quantifies the unique information each structured context unit provides about the next-token distribution, using conditional mutual information and normalization to suppress redundancy. The authors formalize theoretical properties, analyze computational aspects, and present an integrated lightweight selector alongside an optional learned module to retain only informative anchors. Empirical results on open-weight models demonstrate that RISE reduces redundancy-driven attribution inflation, improves interpretability, and yields actionable monitoring signals for prompt auditing, retrieval validation, and safety in practical deployments. Overall, RISE advances trustworthy AI explanations by prioritizing true dependence over frequency or overlap in long, structured contexts.

Abstract

Large language models (LLMs) generate outputs by utilizing extensive context, which often includes redundant information from prompts, retrieved passages, and interaction history. In critical applications, it is vital to identify which context elements actually influence the output, as standard explanation methods struggle with redundancy and overlapping context. Minor changes in input can lead to unpredictable shifts in attribution scores, undermining interpretability and raising concerns about risks like prompt injection. This work addresses the challenge of distinguishing essential context elements from correlated ones. We introduce RISE (Redundancy-Insensitive Scoring of Explanation), a method that quantifies the unique influence of each input relative to others, minimizing the impact of redundancies and providing clearer, stable attributions. Experiments demonstrate that RISE offers more robust explanations than traditional methods, emphasizing the importance of conditional information for trustworthy LLM explanations and monitoring.
Paper Structure (18 sections, 10 theorems, 43 equations, 8 figures, 7 tables, 1 algorithm)

This paper contains 18 sections, 10 theorems, 43 equations, 8 figures, 7 tables, 1 algorithm.

Key Result

Lemma 1

If a context unit $\medmath{C_i}$ satisfies $\medmath{C_i \perp\!\!\!\perp \hat{T} \mid \mathcal{C}_{\setminus i},}$ then $\medmath{\Delta_i = 0}$ and hence $\medmath{\mathrm{RISE}(C_i) = 0}$ for $\medmath{\varepsilon = 0}$ and $\medmath{\sum_j \Delta_j > 0}$.

Figures (8)

  • Figure 1: Lightweight dependence-aware context design using RISE. Structured context units are mapped to compact representations, scored by their unique contribution conditioned on the rest of the context, and redundant units (e.g., overlapping RAG chunks) are suppressed before attribution and generation.
  • Figure 2: Lightweight dependence-aware selection: retain recent context for fast dynamics and sparsely select uniquely informative long-range anchors, enabling inference-time monitoring via anchor drift.
  • Figure 3: Aggregate attribution behavior across methods. RISE exhibits stronger redundancy suppression (lower redundancy sensitivity) despite lower raw rank stability, reflecting dependence-aware scoring under overlap.
  • Figure 4: Cross-model evaluation of RISE on SQuAD. Left: Stability measured by Spearman rank correlation across prompt variants. Right: Redundancy sensitivity measured by duplicate split score (lower is better). RISE exhibits consistent behavior across models, supporting model-agnostic robustness.
  • Figure 5: Stress-test evaluation on SQuAD. Left: Stability under increasing paraphrase strength (light/medium/hard), measured by Spearman correlation. Center: Redundancy sweep showing duplicate split as the number of repeated instruction units increases (lower is better). Right: Intervention experiment measuring log-probability drop after removing top-2 versus bottom-2 attributed units.
  • ...and 3 more figures

Theorems & Definitions (15)

  • Lemma 1: Redundancy suppression under conditional independence
  • Corollary 1: Duplicate-context invariance
  • Proposition 1: Stability under redundancy injection
  • Lemma 2: Conditional redundancy implies non-selection (ideal case)
  • Corollary 2: Duplicate/overlap suppression under conditioning
  • Lemma 3: Non-negativity
  • proof
  • Lemma 4: Normalization
  • proof
  • Lemma 5: Group attribution
  • ...and 5 more