Skip to content

Embedded Conditional Independence Tests for Large Language Model Generated Text with an Application to German Parliament Speeches

Sep 2026 · 1 citation · 31 references
Mathematics Computer Science

TL;DR

Embedded CITs (eCITs), which embed X and Z and apply an existing CIT to the resulting representations and to the resulting representations, are proposed and it is shown that sufficiency weakens to mean sufficiency when the embedded test targets conditional mean independence.

Abstract

Conditional independence tests (CITs) test for conditional dependence between two random objects $X$ and $Y$ given a third random object $Z$. Existing CITs have limited applicability to high-dimensional data, especially multimodal data like text. However, we show that such tests are of interest for large language model (LLM) outputs, where we test whether an output $X$ generated from a source text $Z$ carries information about an attribute $Y$ beyond $Z$ itself. For this purpose, we propose embedded CITs (eCITs), which embed $X$ and $Z$ and apply an existing CIT to the resulting representations and to $Y$. We show that, provided the embedding of $Z$ is sufficient, i.e. retains the information $Z$ carries about either $Y$ or the representation of $X$, the null hypothesis transfers from $X$ and $Z$ to their representations, so that a CIT valid for the embedded hypothesis is valid for the original one. We further give conditions for equivalence of the two hypotheses, and show that sufficiency weakens to mean sufficiency when the embedded test targets conditional mean independence. We propose a semi-synthetic simulation design to assess type I error (T1E) control and power of the eCITs for given embedding maps on a specific dataset and task, and use it to evaluate them on our application. Applying the eCITs to German Parliament speeches, we find for all combinations of embedding maps considered that the summaries of two LLMs contain information about the speaker's faction and gender beyond the speech they were generated from.

View source

Similar papers

#natural language process... Preprint Oct 2026

The Asymptotics of Language Model Alignment with Memory

Language model (LM) alignment broadly aims to perturb a given LM $Q$ into an aligned LM $q$ such that i) the outputs produced by $q$ and $Q$ are'close'in probability, ii) $q$ has a higher expected reward than $Q$. Two common techniques for LM alignment are: KL-constrained RL, which requires knowledge of the LM distribu...

Haricharan Balasundaram, V. Rameshwar · 0 citations
Preprint Sep 2026

Near-Optimal Bounds for Testing Residual-String Equality and Parenthesis Languages

Residual-String Equality, denoted $\texttt{ResStringEq}$, is the property consisting of all pairs of strings over $\{0,1,*\}$ that are equal after deleting all `$*$'symbols from them. This property was first introduced by Fischer, Magniez, and Starikovskaya (SODA 2018), who used it to show a lower bound on testing the...

Hadar Strauss · 0 citations
#machine learning Preprint Oct 2026

Principled Top-$k$ Selection for Language Models with Hybrid Gradients

Selecting the best $k$ items out of $m$ candidates is a critical component of modern large language model systems, such as document selection in Retrieval-Augmented Generation (RAG) and expert routing in Mixture-of-Experts (MoEs). However, training these selection modules remains challenging due to weak gradient signal...

Xu-Chen Gong, Ju Sun, Tian Li · 0 citations
#machine learning Preprint Sep 2026

Large Language Bayes Is Not Reparameterisation-Invariant

Large Language Bayes (LLB) answers an informal modelling question by sampling candidate probabilistic programs from a language model, running approximate inference on each, and averaging them with weights proportional to an exponentiated evidence bound. We show that this weighting depends on how a model is written. The...

Jian Xu · 0 citations
Preprint Sep 2026

ZigZag Trie: A Novel Index for Contextual Queries

There is increasing interest in queries about the context of a string $P$ in a longer text $T$, i.e., the set of all string pairs $(L,R)$, with $|L|=|R|=q$, for a given $q$, such that the string $LPR$ occurs in $T$. Such contextual queries are important in several domains but are challenging to answer efficiently. This...

Ling Li, D. Gibney, S. V. Thankachan et al. · 0 citations
#machine learning Preprint Sep 2026

Mutual Information Constrained Chernoff Bottleneck

The classical information bottleneck (IB) measures the relevance of a representation $U$ of $X$ to a target $Y$ by $I(U;Y)$, which does not directly characterize the error of downstream decisions. For a binary hypothesis $Y$ inferred from many separately encoded observations, the optimal error exponent is the Chernoff...

Di-Er Tang, Guang-Yue Han · 1 citation

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.