Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 34

Assessing Identifiability with Unmeasured Confounders/Mediators

Recommended resources

Introduction

In our last lesson, we explored the front-door criterion, a clever strategy for identifying a causal effect even in the presence of an unmeasured confounder, provided the effect is fully mediated by an observable mechanism. This was a valuable tool, but it relies on strong assumptions that may not always hold. What happens in more complex scenarios where the front-door path is also blocked, or when multiple unobserved confounders are at play, especially within the intricate network of your triadic system?

This lesson addresses that very question by broadening our assessment of identifiability. We will move from specific recipes like the backdoor and front-door criteria to more general principles for determining if a causal effect can be identified from a graph. You will learn to recognize situations where identification is possible even when it's not immediately obvious. We will then introduce a powerful and modern technique known as Proximal Causal Learning, specifically using Double Negative Controls (DNC). This method is exceptionally well-suited to your project, as it is designed to handle unmeasured confounding in network settings where interference is present. Finally, we'll briefly touch upon what to do when identification fails, setting the stage for sensitivity analysis.


1. General Graphical Criteria for Identifiability

The backdoor and front-door criteria are sufficient for identification, but they are not the only ways. A causal effect might be identifiable even if neither criterion is met. The rules of do-calculus are complete, meaning they can identify any effect that is identifiable. However, applying them manually can be complex. Fortunately, we can rely on more general graphical criteria to build our intuition.

The video below from Brady Neal's "Causal Inference" course introduces a more general sufficient condition for identifiability and also a necessary one, helping us understand the boundaries of what's possible.

5.5 - Determining Identifiability from the Graph

This video explores graphical conditions for identifiability that go beyond the basic backdoor and front-door rules.

Please watch the following segments: Motivation: Start with the motivating problem from the beginning, which presents a graph where neither the backdoor nor front-door criterion is satisfied. Sufficient Condition: Watch the explanation of the "unconfounded children criterion". The key idea is that if you can find a single set of variables that blocks all non-causal paths to the children of the treatment node (that are also ancestors of the outcome), you can isolate the causal effect. Necessary Condition: Next, watch the segment on the necessary condition. This explains that while each individual backdoor path must be blockable, this is not sufficient for identifiability. The example with the collider is crucial—it shows how blocking one path can paradoxically unblock another. Completeness: Finally, note the brief mention of a necessary and sufficient graphical criterion (the "hedge criterion" or ID algorithm). We won't delve into its mechanics, but it's important to know that a complete graphical solution exists.

The main takeaway is that identifiability hinges on our ability to isolate the causal flow from treatment to outcome by blocking all confounding pathways. This can be more complex than blocking a single backdoor path, as the set of variables needed for adjustment must work simultaneously without opening new paths.


2. Handling Unmeasured Network Confounding with Double Negative Controls

When confounding is unmeasured, especially in a network, we need more advanced tools. The method of Double Negative Controls (DNC), part of a broader field called Proximal Causal Learning, offers a path forward by using proxies to learn about the unmeasured confounder.

This is particularly relevant for your triadic model, where unobserved factors like "pre-existing group dynamics" or "latent compatibility" can act as network confounders, influencing both the choices people make (treatment) and their eventual satisfaction (outcome). This is the problem of homophily and contextual confounding that plagues social network analysis.

The following image illustrates the core challenge in a networked setting. An unmeasured confounder can create spurious correlations between individuals. In panel A, it causes homophily (people with similar connect), and conditioning on the connection creates a confounding path. In panel B, is a shared context that affects all parties.

Directed acyclic graphs from a study on causal inference with interference. Panel A shows unobserved variables (U) creating confounding in a natural system, while panel B shows the goal of estimating potential outcomes under an intervention. This illustrates the type of complex confounding DNC is designed to address.

The paper "Identification and estimation of causal peer effects using double negative controls" by Naoki Egami provides a rigorous yet applicable framework for this problem. Given your background in econometrics and causal analysis, you will find its logic compelling.

Identification and estimation of causal peer effects using double ...

This paper details the theory and application of the DNC method for unmeasured network confounding. We will focus on the identification strategy rather than the GMM estimation details.

First, read the Introduction (the identification challenge) to understand the core problems of unmeasured network confounding (homophily and contextual effects) that motivate the DNC approach. To build intuition, review Section 2, starting from "Identification challenge" and continuing through "Identification with DNCs". This section introduces the main idea in a simple dyadic (two-person) setting. Pay close attention to the definitions of the Negative Control Outcome (NCO), W, and Negative Control Exposure (NCE), Z. Now, let's generalize. Read Section 3.2, "Identification assumptions". This presents the four key assumptions in a full network setting, which is directly applicable to your triad. The most critical part for your project design is Section 3.3, "Selecting negative controls". This provides practical strategies for choosing valid NCOs and NCEs. Focus on the two main strategies: Using auxiliary variables (like 'headaches' in the Add Health example). Using focal behaviors of peers or peers-of-peers (like the GPA of a friend's friend). This is a powerful idea in network contexts. Finally, read the Conclusion of the empirical application in Section 4.3 (Results) to see how the DNC estimator revealed significant bias in a standard OLS regression, highlighting its practical importance.

The DNC Logic in a Nutshell

The DNC method hinges on finding two special variables, and , that act as proxies for the unmeasured confounder .

  1. Negative Control Outcome (W): This variable is a proxy for the outcome. It is assumed to be affected by the unmeasured confounder but is not affected by the treatment .
  2. Negative Control Exposure (Z): This variable is a proxy for the exposure to the confounder. It is related to but does not directly affect the outcome or the NCO .

The relationship between how affects and how affects is captured by a confounding bridge function. The NCE, , provides the information needed to identify this bridge function, effectively allowing you to "adjust" for without ever measuring it.

Applying DNC to the Vee-Triad Experiment

Let's translate this to your experiment on the vee-triad.

  • Ego (): The person whose outcome we are measuring (e.g., the pivot woman).
  • Treatment (): The ego's exposure under the experimental condition (e.g., their living arrangement, a communication protocol). This is part of the full treatment vector for the triad.
  • Outcome (): The ego's satisfaction.
  • Unmeasured Confounder (): A latent characteristic of the triad, like 'pre-existing emotional cohesion' or 'conflict avoidance tendency'.

To use DNC, we need to select a plausible NCO and NCE based on domain knowledge.

  • Potential NCO (): We need a variable for the pivot woman () that is affected by the triad's 'emotional cohesion' () but not by the specific living arrangement (). A candidate could be a measure of 'sleep quality' or 'frequency of non-relationship-related rumination'.

    • Justification: It's plausible that low underlying cohesion () might cause stress that degrades sleep quality (), regardless of the specific living arrangement (). You must argue that the arrangement itself (e.g., living together vs. apart) does not have a direct causal arrow to sleep quality, except through satisfaction.
  • Potential NCE (): This is where the network structure of the triad is powerful. As Egami's paper suggests, we can use variables from peers. The NCE for the pivot woman could be a variable measured on her partners.

    • Justification: Let's choose one of the partners, . A candidate NCE could be partner 's baseline score on a 'locus of control' personality trait, measured before the experiment begins. The argument would be that this stable trait is correlated with the formation of the triad and its latent cohesion (), but it does not have a direct causal effect on the pivot woman's satisfaction () or her sleep quality (). Its influence is mediated through the system dynamics captured by .

Finding and justifying these negative controls is the most challenging part of this method, but it provides a rigorous path to identification where simpler methods fail. The dissertation by Kao also emphasizes the theoretical importance of accounting for network properties to achieve unconfoundedness, which is precisely what the DNC method helps you do in practice. The "Unconfounded Influence Network Assumption" discussed by Kao is the formal condition that DNCs help satisfy by using proxies for latent network-related attributes.

[PDF] Causal Inference Under Network Interference: A Framework for ...

This section of Edward Kao's dissertation provides the theoretical underpinning for why we must worry about network confounding and how to address it.

Please read Section 1.5.2, starting from the beginning. Then, focus on the descriptions of Assumption 1.5 (Unconfounded Influence Network Assumption) and Theorem 1.3 (Unconfounded Influence Network by Conditioning on Network Parameters). The key insight is that properties of the network (like a person's "activity level" or "community membership," which are proxies for your latent U) can be confounders. To get a valid causal estimate, you must condition on them. The DNC method is a practical way to do this when these properties are unmeasured.


3. When Identification Fails: An Introduction to Sensitivity Analysis

What if you cannot find plausible negative controls? Or what if, even after applying all these methods, you conclude that your causal effect of interest is simply not identifiable from the available data? This does not mean your research is invalid. The next step is to perform a sensitivity analysis.

Instead of a binary "yes/no" on identification, sensitivity analysis asks:

How strong would an unobserved confounder need to be, in terms of its effect on both the treatment and the outcome, to change my conclusion?

If a very weak confounder could flip your result from significant to non-significant, your finding is considered "sensitive" or fragile. If it would take an implausibly large confounding effect to overturn your result, your finding is "robust."

The image below shows a contour plot of a "bias factor." This is a typical output of a sensitivity analysis. It illustrates how the bias in an estimate changes as a function of the unmeasured confounder's properties (e.g., its mean in the treatment vs. control group, and its effect on the outcome).

This figure from a paper on sensitivity analysis shows a contour plot where the bias factor (the colors and contour lines) is a function of two parameters of an unmeasured confounder. This visualizes how sensitive an estimate is to different levels of confounding.

We will not go into the calculations today, but it is critical to know that this is the principled approach to handling situations where identification is not possible. We will return to this and learn how to compute and interpret these measures (like E-values) in Module 8.


Conclusion

In this lesson, we have moved beyond simple identification recipes to a more robust framework for assessing and achieving identifiability in the face of unmeasured variables, particularly within your complex triadic system.

Key Takeaways:

  • Identifiability can be assessed with general graphical criteria that are more powerful than the basic backdoor and front-door rules.
  • When unmeasured confounding is present, especially in networks, Double Negative Controls (DNC) offer a powerful identification strategy by using proxy variables for the confounder.
  • The selection of an NCO (unaffected by treatment, affected by confounder) and an NCE (related to the confounder, but not the outcome) is a critical design step that relies on deep domain knowledge.
  • If an effect is ultimately non-identifiable, the next step is not to abandon the analysis, but to conduct a sensitivity analysis to quantify the robustness of your findings to potential confounding.

In our next lesson, we will explore another subtle threat to valid causal inference: selection bias. We will specifically examine how Berkson's paradox can arise from conditioning on a collider, such as the triad's joint decision to continue participating in your study, which can induce spurious associations even in a well-designed experiment.