---
title: Counterfactual Scenarios in Causal Analysis
url: https://www.emergentmind.com/topics/counterfactual-scenarios
type: topic
---

# Counterfactual Scenarios in Causal Analysis

Counterfactual scenarios are hypothetical worlds in which some antecedent differs from what actually occurred and one asks what consequences would follow under that altered condition. Across contemporary work, they appear as counterfactual conditionals in language, alternate treatment assignments in causal inference, hypothetical past interventions in time series, altered planning problems, modified policy paths in macroeconomics, and adverse but plausible stress narratives in finance [2305.16572] [2406.19573] [2409.09577] [2512.07867]. Much of the modern literature begins from structural causal models and the abduction–action–prediction pattern, but recent work also emphasizes backtracking to earlier causes, naturalness and feasibility constraints, product-space formalisms that separate counterfactuality from intervention, and domain-specific notions of realism [2211.00472] [2402.01607] [2601.00507].

## 1. Conceptual range and basic uses

In the most general sense, a counterfactual scenario is a representation of “what would happen if” some condition were different from actuality. In psycholinguistic and language-model evaluations, the defining form is a proposition that is false in the real world but assumed true in a hypothetical world, together with consequences that follow inside that hypothetical world; the canonical contrast is between real-world completions and counterfactual-world completions such as “If cats were vegetarians” followed by a consequence involving cabbages rather than fish [2305.16572]. In vector autoregressive time series, a counterfactual scenario is a hypothetical past intervention on a previously observed realization, followed by the question of what the future would have looked like under that past change [2406.19573].

The same notion is instantiated differently in planning and decision systems. In automated planning, counterfactual scenarios are minimal modifications to a planning problem \(P=\{F,A,I,G\}\) such that the modified problem admits plans satisfying a desired \(\mathrm{LTL}_f\) specification \(\psi\); this is explicitly contrasted with earlier counterfactual explanations that modify an existing plan rather than the problem itself [2508.21521]. In power-system optimisation, the scenario is a minimally perturbed demand profile that would have moved the optimal dispatch into a user-specified region, such as dispatching a generator above a threshold or committing a unit at a given time [2512.04833]. In macro-financial stress testing, a counterfactual scenario is a structured macroeconomic shock vector for GDP growth, inflation, and policy rates, generated for a fixed horizon and mapped into portfolio losses [2512.07867].

These uses share a common feature: the scenario is not merely an alternative label or outcome. It is an alternate world specification tied to a generative, causal, logical, or optimisation structure. This suggests that “scenario” in this literature usually denotes a structured alternate state of affairs rather than an unconstrained perturbation.

## 2. Structural, potential-outcome, and measure-theoretic foundations

Two classical foundations recur throughout the literature: the Potential Outcome Model and the Structural Causal Model. In the Potential Outcome Model, counterfactuals are unobserved potential outcomes \(Y(1)\) and \(Y(0)\), with identification resting on assumptions such as SUTVA, consistency, positivity, and ignorability [2407.01875]. In the Structural Causal Model, one specifies endogenous variables \(\mathbf{V}\), exogenous variables \(\mathbf{U}\), and structural assignments \(\mathbf{F}\), often written componentwise as
\[
X_i := f_i(pa_i, U_i),
\]
and counterfactual reasoning follows Pearl’s abduction–action–prediction sequence [2407.01875] [2402.01607].

This interventionist foundation has been extended in several directions. A continuous-time formulation based on local independence graphs treats a counterfactual scenario as a new probability law \(P_\theta\) on the same sample space, characterized by a martingale problem and linked to the factual law through a likelihood-ratio stochastic differential equation; identification then depends on short-term prediction structure encoded in local independence graphs [1106.0972]. At a still broader level, counterfactual probability spaces and counterfactual causal spaces represent factual and counterfactual worlds on product measurable spaces such as
\[
(\Omega,H)=\big(F\Omega\times CF\Omega,\; FE\otimes CFE\big),
\]
with shared information between worlds encoded in the probability measure \(P\) and, after intervention, in causal kernels \(K\) [2601.00507]. In that framework, counterfactuals and interventions are treated as orthogonal concepts rather than points on a single “ladder,” and a defining axiom is that there is no causal effect across worlds [2601.00507].

These extensions matter because they broaden the admissible semantics of counterfactual scenarios. Rather than requiring every counterfactual to be an intervention in an SCM, they allow multiworld probability constructions, continuous-time change-of-measure formulations, and varying degrees of shared information between factual and counterfactual worlds.

## 3. Backtracking, naturalness, and feasibility

A central recent development is the critique of purely surgical interventions. In standard Pearl-style semantics, if one wants \(Y\) to take a new value \(y^*\), one applies \(do(Y=y^*)\) while keeping its causal ancestors fixed. The backtracking literature argues that this produces counterfactual worlds by “small miracles”: the exogenous context is held fixed, but the laws are locally broken to force the antecedent [2211.00472]. Backtracking counterfactuals reverse this design. The causal laws remain unchanged, the exogenous variables are allowed to change, and the counterfactual world is generated by altered upstream conditions. Formally, the key object is a backtracking conditional
\[
P_B(\mathbf{U}^* \mid \mathbf{U}),
\]
which encodes similarity between factual and counterfactual exogenous states; desirable properties include preference for closeness, symmetry, decomposability, and distance-based constructions such as
\[
P_B(\mathbf{u}^* \mid \mathbf{u}) \propto \exp\{-d(\mathbf{u}^*,\mathbf{u})\}.
\]
Under this semantics, computation proceeds by cross-world abduction, marginalization over factual exogenous variables, and prediction in the unchanged model [2211.00472].

“Natural counterfactuals” refine this idea by permitting only the amount of backtracking needed to return a counterfactual point to a realistic region of the observed distribution. The distinction is explicit: \(do(Y=y^*)\) denotes a direct intervention, whereas \(change(Y=y^*)\) denotes an intended counterfactual change that may be realized through ancestor interventions [2402.01607]. The generation problem is posed as Feasible Intervention Optimization, with a minimal-change objective over ancestor variables and a naturalness constraint. In the implemented method, the distance is the \(L^1\) norm on ancestor variables, and naturalness is enforced by a conditional CDF criterion,
\[
\epsilon < F(x_j^* \mid pa_j^*) < 1-\epsilon.
\]
Larger \(\epsilon\) imposes a stricter notion of naturalness and therefore more forceful backtracking [2402.01607].

The key conceptual point is that backtracking is not arbitrary rewriting of the past. In the “necessary backtracking” formulation, one backtracks only when the direct intervention would otherwise be unnatural, infeasible, or out of distribution; if the direct intervention is already natural, the method collapses to ordinary non-backtracking counterfactuals [2402.01607]. This suggests a general shift from purely law-breaking counterfactual surgery toward minimally altered, distribution-respecting alternate histories.

## 4. Temporal, spatio-temporal, and multiagent scenarios

Time-indexed systems impose additional structure because the scenario typically concerns alternate histories rather than isolated variables. In vector autoregressive models, the factual process is
\[
x_t := \sum_{q=1}^Q B_q x_{t-q} + w_t,\qquad w_t \sim \mathcal{N}(\mathbf{0},\mathbf{C}),
\]
interpreted as an SCM on the time-unfolded graph [2406.19573]. A counterfactual scenario is a hypothetical intervention during a past interval, with the exogenous noise realization kept fixed across factual and counterfactual worlds. Because the model is linear, the downstream effect of a perturbation propagates exactly through the total causal effect matrices \(T_k\), which satisfy
\[
T_k = B_1T_{k-1} + \cdots + B_QT_{k-Q},\qquad T_0=I.
\]
This yields exact counterfactual trajectories and total causal effects of past interventions [2406.19573].

When multiple units interact across space and time, the main complication is interference. The spatio-temporal overview emphasizes that classical POM and standard SCM are strained by systems in which one unit’s treatment affects another unit’s outcome and today’s intervention affects future states. Its proposed unifying graphical representation is the Spatio-Temporal Bayesian Network, with factorization over time-indexed nodes and a temporal assumption that causes precede or parallel their effects [2407.01875]. Counterfactual inference is then organized recursively through “Forward Counterfactual Inference,” which searches causal pathways, back-door structures, and mediator layers in the time-indexed graph [2407.01875].

A related multiagent formulation models counterfactual scenarios as full future trajectories under alternate intervention histories rather than as one-step alternate outcomes. The GVCRN framework estimates individual treatment effects in observational multiagent systems by learning latent confounders \(Z_t\), forecasting future covariates \(\hat x_{t+1}\), forecasting future outcomes \(\hat y_{t+1}\), and rolling these predictions forward over time [2206.01900]. This design is motivated by the claim that in multiagent systems the intervention changes future interactions among agents, which then changes later outcomes. The practical consequence is that realistic counterfactual scenarios require joint modeling of treatment, latent confounding, future covariates, and long-term outcomes [2206.01900].

## 5. Explanations, planning, and closed-loop control

In explainable AI, the counterfactual scenario is often an actionable modification to inputs or environment conditions that would change a decision. A recent formulation replaces fixed mutable-feature sets with user-defined counterfactual templates \(x_{tmp}\), specified at inference time. In FCEGAN, the generator receives \((x_{og}, x_{tmp}, y_{desired})\) and outputs \(x_{cf}\), after which immutable coordinates are reset to their original values. This permits black-box counterfactual explanations without retraining or per-instance optimisation, using historical predictions rather than model internals [2502.17613]. The design goal is flexibility under heterogeneous real-world constraints rather than a universal recourse policy.

Planning work generalizes this explanatory idea from instances to domains. Given a planning problem \(P\), an \(\mathrm{LTL}_f\) formula \(\psi\), and a possible-change relation \(C\), an existential counterfactual scenario seeks the minimally modified planning problem such that there exists a plan satisfying \(\psi\), whereas a universal counterfactual scenario seeks the minimally modified planning problem such that all valid plans satisfy \(\psi\), with non-emptiness required to avoid vacuity [2508.21521]. For the main concrete edit classes—initial states, goals, and action preconditions—the generation problem is often no harder asymptotically than planning itself [2508.21521].

In optimisation-based infrastructures, the same pattern appears with domain-specific mutable inputs. In DC Optimal Power Flow and Unit Commitment, counterfactual explanations are bilevel optimisation problems that perturb spatial or temporal demand profiles minimally in the \(\ell_1\) norm so that the lower-level optimum enters a user-specified solution region [2512.04833]. The counterfactual scenario thereby identifies not only an alternate optimal solution but also which demand changes and which constraint families—such as congestion or ramping—were operative [2512.04833].

Closed-loop generative control systems add another layer: the scenario must remain realistic while changing risk or intent. CounterScene generates safety-critical driving scenarios by identifying the causally critical agent, modeling inter-agent dependencies with a causal interaction graph, and applying stage-adaptive counterfactual guidance that removes spatial and temporal safety margins from that single agent while allowing the world model to propagate the consequences [2603.21104]. In LLM-based autonomous control, the SCM is explicit:
\[
X \rightarrow A \rightarrow Z \rightarrow Y,
\]
where \(X\) is a user prompt, \(A\) an action sequence, \(Z\) environment feedback, and \(Y\) the report. Conformal Counterfactual Generation then calibrates sets of counterfactual reports so that, with high probability, at least one generated candidate is a good enough approximation of the true counterfactual outcome [2601.20090].

## 6. Counterfactual scenarios in policy, learning, and stress testing

Counterfactual scenarios are also used to learn decision rules or evaluate policy under shifts not observed in the training distribution. In semiparametric counterfactual regression, the observed data are \(Z_i=(Y_i,A_i,X_i)\), the intervention is an incremental shift of treatment odds,
\[
q(X;\delta,\pi)=\frac{\delta\,\pi(X)}{\delta\,\pi(X)+1-\pi(X)},
\]
and the target estimand is the solution of a constrained stochastic optimisation problem for the counterfactual regression risk [2504.02694]. Efficient influence functions convert the unobserved counterfactual objective into an estimable one, and the resulting estimators can achieve \(\sqrt n\)-consistency and asymptotic normality under product-rate nuisance conditions [2504.02694].

In offline reinforcement learning, the Counterfactual Reasoning Decision Transformer augments the factual dataset with generated counterfactual experiences. A Treatment model identifies low-probability alternative actions, an Outcome model predicts the next state and return-to-go under those actions, and uncertainty plus return-improvement filters discard unreliable counterfactual branches before the Decision Transformer is trained jointly on factual and counterfactual data [2505.09114]. The stated motivation is to reason beyond the exact offline dataset, especially when optimal trajectories are scarce [2505.09114].

Macroeconomic counterfactual scenarios can be defined as policy path deviations without specifying a full structural model. In the SVMA-based framework, a hypothetical trajectory sets the policy variable on an alternative path \(\tilde{\boldsymbol r}_{t:t+H}\), whereas a policy intervention forces the policy variable to be unresponsive to a shock by zeroing out the systematic response of the interest rate [2409.09577]. The resulting counterfactual parameters are given analytically in terms of impulse responses and Moore–Penrose inverses, and identified with external instruments in a projection-based method connected to Local Projections [2409.09577].

Stress testing uses a different but related construction. LLM-generated macro-financial scenarios specify country, title, GDP growth, inflation, interest rate, rationale, and risk sectors for severe but plausible Q4 2026 narratives, and are mapped into Value-at-Risk and Expected Shortfall through a three-channel factor-based translator [2512.07867]. The scenario itself is therefore a structured counterfactual macro path rather than a replay of a historical episode.

## 7. Identifiability, evaluation, and recurring controversies

A persistent issue is whether a counterfactual scenario is identifiable from observed data or merely plausible. For high-dimensional outcomes, observational equivalence can support multiple mechanisms with different counterfactuals. One recent resolution uses continuous-time flows and dynamic optimal transport: if the causal mechanism is the unique OT map \(T=\nabla\phi\) for a convex potential \(\phi\), then the induced counterfactual transport
\[
T^*(\mathbf{pa}^*,\mathbf{pa},x)=T(T^{-1}(x;\mathbf{pa});\mathbf{pa}^*)
\]
is unique, monotone, and rank-preserving under stated regularity conditions; the paper extends this identifiability logic to Markovian settings and to IV, backdoor, and frontdoor cases in non-Markovian settings [2510.08294]. This directly addresses the objection that many learned counterfactual maps lack a causal identification story.

Evaluation raises a different problem. In scenario modeling, the realized world usually differs from the modeled scenario, so the raw discrepancy between projection and observation mixes scenario deviation with model miscalibration. The relevant quantity is the counterfactual model error
\[
e^m(x_i)=\mathcal{P}^{m}(y\mid x_i)-\mathcal{P}^{*}(y\mid x_i),
\]
not the difference between the scenario projection and the realized outcome at \(x^*\) [2512.00836]. Three approaches are compared: evaluating only retrospectively plausible scenarios, inferring the error distribution directly by rerunning the model at the realized scenario, and estimating the observations in the modeled scenarios. The paper recommends the latter two over the first, with the preferred choice depending on whether one can model the counterfactual observation well or instead trust the mechanistic model to capture the relevant nonlinearities [2512.00836].

Several controversies recur across domains. One concerns semantics: counterfactuals need not be reducible to interventions, as argued by the counterfactual-spaces framework, which treats counterfactuality as a property of product-world probability spaces and interventions as properties of causal kernels [2601.00507]. Another concerns realism: purely surgical changes may leave the data manifold, motivating natural and backtracking counterfactuals [2402.01607] [2211.00472]. A third concerns competence claims in language systems: models can appear to reason counterfactually by overriding world knowledge, yet much of the effect can be driven by lexical cues, and when both world knowledge and lexical associations are mitigated, only GPT-3 showed some sensitivity to the linguistic nuances of counterfactual marking [2305.16572]. Finally, quantum theory challenges truth-valued classical counterfactual logic. A recent formalism therefore treats measurement settings as antecedents and replaces truth values with counterfactual probabilities, or “supposabilities,” defined by averaging over fixed classical fixtures outside the causal future of the antecedent [2510.01888].

Taken together, these developments show that counterfactual scenarios are not a single technique but a family of formal objects whose meaning depends on how alternate worlds are linked to the factual one: by shared exogenous noise, by backtracked upstream conditions, by product-world probability structure, by optimization constraints, or by learned transport maps. The common scientific demand is that the scenario be not only hypothetical but also structurally interpretable, feasible within the chosen model class, and evaluable against explicit criteria of identifiability, realism, or calibration.

Source: https://www.emergentmind.com/topics/counterfactual-scenarios