Embedding-Bias in Conditional Independence Testing
summary
The gist
The gist The paper studies embedding-bias in conditional independence testing by formalizing and quantifying how conditioning on an embedding, instead of the original variable, can invalidate tests
In short
The study investigates how conditioning data on an embedding, instead of the original variable, can invalidate tests for conditional independence. It shows that a robust test requires controlling for 'insufficiency'—a tolerance level related to how much information is lost in the embedding. This leads to a more reliable statistical test when dealing with pre-trained encoders.
Key concepts
- Embedding-Bias
- This occurs when testing conditional independence using an embedding of data (like text) instead of the raw data itself. The embedding might discard crucial information, causing the statistical test to become unreliable or biased, even if the underlying variables are truly independent.
- Residual Correlation Test
- This is a specific statistical test inspired by measures like the Generalised Covariance Measure. It checks for correlation between parts of the data that are 'missed' by the embedding. Validity depends on ensuring these missed parts remain uncorrelated under the null hypothesis.
- Insufficiency Tolerance (B)
- This is a declared tolerance level used in a robust test. It represents an assumed upper bound on how much information might be lost when using an embedding. The test remains valid as long as this tolerance is respected, providing robustness against unknown embedding limitations.
Terminology used across episodes
This episode discusses
- Embedding-Bias in Conditional Independence Testing · Paper Radio
- The Generalised Kernel Covariance Measure
- Long Story Short: Omitted Variable Bias in Causal Machine Learning · Paper Radio
- Qwen3 Technical Report
- Embedded Conditional Independence Tests for Large Language Model Generated Text with an Application to German Parliament Speeches · Paper Radio
- Doubly Robust Conditional Independence Testing with Generative Neural Networks
The paper
Embedding-Bias in Conditional Independence Testing · Read on arXiv
To test conditional independence of X and Y given a text or an image Z, one conditions on an embedding ψ(Z) in place of Z. The embedded test is valid if Z is independent of X or of Y given ψ(Z), which cannot be confirmed from data, and when this fails, the rejection probability under the null hypothesis can tend to one. We study this failure, and show that focusing on a specific form of dependence relaxes what the embedding must retain. For a residual correlation test inspired by the Generalised Covariance Measure, validity only requires that the parts of E[X Z] and E[Y Z] missed by E[X ψ(Z)] and E[Y ψ(Z)] are uncorrelated. Otherwise, we treat the discarded information as an omitted variable. Under the null hypothesis, the bias equals the absolute correlation of the missed parts times the geometric mean of two partial R squared values. This identity yields a robust test valid under a declared tolerance for the geometric mean, which, like a sensitivity parameter, is not identified from the data. On synthetic data and text embeddings, the robust test holds its level approximately. On text generated by a language model, under an exact null hypothesis, every embedding, even the generator's own states, biases the embedded test.
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: I'm Tom, and with me are Jane, Lu, senior AI researcher at Tsinghua, Meng, lead engineer at a mysterious AI startup and Lalam, the in-house Large Language Model.
Jane: Today's paper: "Embedding-Bias in Conditional Independence Testing".
Tom: The gist The paper studies embedding-bias in conditional independence testing by formalizing and quantifying how conditioning on an embedding, instead of the original variable,
Jane: First, who's behind it and why it matters.
Paper summary: Tom: So, wrapping up "Embedding-Bias in Conditional Independence Testing," the main point is that simply using an embedding instead of the original variable in a conditional independence test can break the test's validity if that embedding isn't sufficient. The authors formalized this by showing how to treat the discarded information as an omitted variable and quantifying its effect.
Jane: They proved that under a declared bound on the geometric mean of partial R2 values, you get a test statistic that remains valid, regardless of how correlated those discarded parts actually are. This is what makes it robust.
Lu: The paper gives us tools to measure this failure through measures like ρψ(f, g) and relating them to the partial R2 values. They show exactly how much the embedding Z changes these measures based on its own structure.
Meng: For engineers building systems that rely on these embeddings, the message is clear: you need a tolerance level for that geometric mean of partial R2 values, and figuring out that tolerance requires some domain knowledge or using better methods to estimate it.
Tom: The authors suggest using richer embeddings to find a tighter lower bound on what that tolerance needs to be, and they even pointed toward prognostic scores as a way to estimate insufficiency more reliably than just sticking with a very rich embedding.
Jane: It’s about acknowledging the limitations of pre-trained encoders. They show that while these methods can approximate the original test level, you have to be careful with how you set your tolerance for that geometric mean; underestimating it leads to a biased test, and overestimating it just hurts your power.
Lu: The paper is useful because it moves us past just saying "embeddings are good" and gives us concrete ways to quantify the bias when they aren't perfect representations of the original data. It’s about how much information an embedding truly retains versus what it discards, page one of that work reads: "Embedding-Bias in Conditional Independence Testing Nikolaj Thams thams@math <ref:2610.11584#pg1,Embedding-Bias in Conditional Independence Testing Nikolaj Thams thams@math>.ku.dk Department of Mathematical Sciences University of Copenhagen Copenhagen, Denmark Anton Rask Lundborg arl@math.ku.dk Department of Mathematical Sciences University of Copenhagen Copenhagen, Denmark"
Meng: So for the future work, they really want to improve those benchmarks for how much insufficiency an embedding demonstrates in a way that’s more reliable across different types of data. It needs to be something we can actually trust when we're making real decisions.
Tom: It’s about moving from just having a test that *might* work, to having a test where you know exactly how good it is under specific conditions and what the limits are for it. That’s what this paper delivers on "Embedding-Bias in Conditional Independence Testing."
Conclusion: Tom: So, this paper "Embedding-Bias in Conditional Independence Testing" is all about how using an embedding instead of the actual data can mess up your conditional independence tests if that embedding isn't perfect.
Jane: Exactly. They're formalizing that problem by looking at how much information gets lost when you switch from a real variable to its representation, the embedding.
Lu: The authors are showing how this loss of information creates a bias under the null hypothesis, and they quantify it using these measures like rho psi of f, g.
Meng: So for practical purposes, what does that mean for us building models? Are we just ignoring some noise in our data by using an embedding?
Lalam: The AI suggests that this could lead to tests that are systematically off-target unless you account for the geometric mean of those partial R2 values.
Tom: It sounds like a warning about relying too much on the structure of embeddings when you're trying to prove independence between things.
Jane: Right, and they propose this robust test where you set a tolerance based on that geometric mean, which isn't just some arbitrary number.
Lu: They even show that using richer embeddings can give you a better estimate for what that necessary tolerance should be.
Meng: If we use these robust tests, it means we can keep our conditional independence checks more reliable even when the embedding is just an approximation of the true data relationship.
Lalam: And if we don't adjust for that bias, our results could be skewed in ways we can't easily spot.
Tom: It boils down to this: how much do you trust the embedding to carry all the necessary information needed for your test to work correctly?
Jane: That’s the core question they’re tackling here with this new framework. And it sets up some interesting questions about what we actually need in those tolerances.
More episodes
- 2610.10642-From Log-Odds to Shapley Values: An Explanatory Geometry for the Weighted Naive Bayes Classifier
- 2610.10666-Explaining the Saliency Map Sparsity of Adversarially-Trained Neural Networks
- 2610.10761-What can linear attention learn from nonlinear teachers in-context?
- 2610.10793-Calibrating Ambiguity Set via Diagnostic Transport for Distributionally Robust Optimization
- 2610.10829-Conformal Prediction under Partial Verification
- 2610.10870-Transformed Samplers with Variance Reduction
- 2610.10952-SPD-MetaFormer is what you need for small-data brain decoding
- 2610.11038-Decision-Sufficient Posterior Approximation
- 2610.11082-A General (sqrt T gamma T) Lower Bound for Kernel Bandits
- 2610.11139-Accelerating Non-Smooth and Heavy-Tailed Sampling