arXiv Machine Learning

Embedding-Bias in Conditional Independence Testing

arXiv:2610. 11584v1 Announce Type: cross Abstract: To test conditional independence of $X$ and $Y$ given a text or an image $Z$, one conditions on an embedding $\psi(Z)$ in place of $Z$.

arXiv AI
Sep 2

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

The paper introduces embedded Conditional Independence Tests (eCITs) to assess whether large language model (LLM) outputs contain additional information about an attribute beyond the source text. By embedding the source and output texts and applying existing CITs to these representations, the authors show that the null hypothesis can transfer from the original variables to their embeddings under sufficient conditions. Using a semi‑synthetic simulation design, they evaluate type I error control and power, and apply eCITs to German Parliament speeches, finding that LLM summaries reveal speaker faction and gender information beyond the original speech content.

By Marco Simnacher, Georg Keilbar, Benjamin K\"onig, Christoph Lippert, Sonja Greven
arXiv Computer Vision
Sep 28

Conditional Predictive Sufficient Statistics for Visual Representation Learning

The paper introduces Conditional Predictive Sufficient Statistics (CPSS) as a formal way to capture useful visual representations that preserve latent factors shared with future data while discarding noise. It shows that predicting the next image patch embedding with a cosine loss approximates maximum likelihood under a von Mises-Fisher model, and that stop‑gradient alone does not enforce sufficiency. Experiments on MNIST and CIFAR‑10 with small causal Transformers demonstrate that CPSS readouts outperform intermediate blocks, while removing stop‑gradient collapses embedding rank even when the pretext loss appears perfect.

By Yuzhou Hong
arXiv Machine Learning
Sep 22

Whitening Inverts the Hierarchy: What the Norm of a Whitened Embedding Measures

The paper investigates the use of the squared norm of a whitened foundation‑model embedding as a training‑free likelihood surrogate. It shows that the apparent Gaussianity of whitened coordinates stems from the projection central limit theorem, not from a true joint Gaussian distribution, and that the norm is systematically over‑dispersed compared to a Gaussian reference. The authors explain that whitening reverses the encoder’s spectral hierarchy, concentrating norm contributions in near‑degenerate directions dominated by noise, and propose interpreting the squared norm as a Mahalanobis measure of semantic atypicality rather than a log‑likelihood.

By Mohammed Ahnouch, Lotfi Elaachak