- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper introduces PROXIMALFM, a prior-data fitted network for proximal causal inference under hidden confounding, trained on synthetic structural causal models with proxy variables to directly predict a posterior over the CATE in a single forward pass. The key idea is to adapt the PFN prior to the proxy setting-specific SCM. Empirically, PROXIMALFM is competitive with existing proximal estimators while avoiding dataset-specific retraining and hyperparameter tuning.
Critical strengths
Relevant and timely problem. The paper addresses causal effect estimation under hidden confounding, a practically important setting where standard unconfoundedness-based methods can fail, and connects this with the rapidly growing literature on causal foundation models.
Practical motivation. Proximal methods can be computationally demanding and sensitive to tuning, whereas PROXIMALFM provides amortized inference in a single forward pass without dataset-specific optimization.
Experimental evaluation. The paper compares against several proximal and non-proximal baselines across diverse semi-synthetic settings and additionally considers posterior calibration and a physical-system benchmark.
Critical weaknesses
-
Limited novelty. The main idea is essentially to apply existing ideas combining causal inference and PFNs (e.g., CausalPFN, do-PFN, CausalFM) to a different identification setting. While this is in principle interesting, the authors seem to omit key challenges in the proxy setting (see below) and the contribution seems to be a rather straightforward adaption of a different causal graph. Previous work such as CausalFM explicitly mentions that their approach could be straightforwardly adapted to different causal graphs/ identification settings. The contribution here therefore seems to be more in implementing the actual model for the proxy setting than in introducing a new conceptual idea.
-
Identification issues. While PROXIMALFM does encode the proximal graph, exclusion restrictions, and positivity, it does not guarantee the key proxy-specific completeness condition, relying instead on heuristics. Bridge-function existence is also assumed in the theory but not clearly guaranteed by the prior. This creates a gap between the theoretical identification result and the actual training distribution. Typically this either yields large posterior uncertainty for a flexible prior, or informative intervals come at the cost of a misspecified prior. Neither is quantified as far as I can tell.
-
On a positive note, these two points may have a common remedy. If the authors could construct a reliable prior that is guaranteed to satisfy the proxy-spcific identifiability conditions, this would both address the identification concern and strengthen the novelty. Alternatively, partial identification approaches could potentially also be explored as in e.g., https://arxiv.org/abs/2605.12924. This could lead to contributions genuinely specific to the proximal setting, rather than simply encoding a different causal graph within the existing frameworks. I encourage the authors to explore this direction.
Questions for authors
- What is different compared to just adapting the existing causal PFNs to the proxy graph? (which could also be considered potential baselines for the experiments)
- What are we loosing by ignoring part of the identifiability assumptions in the prior construction? Are there partial identification results?
3 comments
Thank you for your response. I am still trying to understand the methodological novelty of ProximalFM and would appreciate further clarification on which challenges specific to proximal causal inference the paper addresses beyond what existing causal PFNs already propose. Candidates:
- Different causal graph: Adapting the SCM prior to the proximal graph seems to be a relatively straightforward extension of CausalFM, which explicitly proposes this approach for different identification settings.
- Targeting causal estimands: This also seems to offer limited novelty, as CausalPFN already learns posterior distributions over conditional expected potential outcomes.
- Partial identification: This would be a genuinely interesting proximal-specific contribution. However, the review concerns the current submission rather than planned future work.
- Monte Carlo noise correction: This seems to leave the noise-aware loss as the main methodological contribution. Could the authors elaborate on its novelty beyond standard measurement-error correction?
Overall, could the authors clarify which methodological challenges specific to the proximal setting they solve that go beyond straightforward adaptations of existing causal-PFN approaches?
We thank Reviewer MRXS for their prompt follow-up.
We agree that earlier causal PFNs already provide a framework for adapting priors to new identification assumptions. In proximal inference, specifying the DAG still leaves open how to construct a prior that spans a range of proxy informativeness and confounding strengths, and how to leverage the proxy variables in the observational context while targeting a CATE conditional on X alone.
Differences with CausalFM and CausalPFN.
CausalFM provides a framework to build PFN under different causal identification settings. However, its posterior is over individual treatment effect, whose uncertainty is generally not identifiable, leading to deceptive uncertainty interpretability. CausalPFN proposes a PFN for backdoor inference, targeting the conditional expected potential outcomes (CEPOs). We are interested in the CATE whose uncertainty cannot be retrieved from the CEPOs posterior alone. One could train directly on their difference when both CEPOs are available for each simulated SCM (as they are under CausalPFN’s backdoor prior). In our proximal simulator, the same latent confounder generates the proxies, treatment assignment, and outcomes. We obtain CATE labels by averaging paired counterfactual differences at fixed . This gives us an approximate CATE target with an estimated Monte Carlo error, which we account for in our noise-aware loss.
Synthetic prior challenges.
We agree that it is straightforward to adapt an existing prior to be compliant with the proximal DAG. But the proximal DAG only specifies which dependencies are allowed, while the prior determines how much those dependencies vary across simulated datasets. As widely acknowledged in the literature, the prior must provide diverse SCMs. For example, providing every features W into the outcome mechanism can give wider W blocks more influence on Y because they occupy more of the input. This would undersample compliant SCMs with wide W but having little influence on Y. We subsample features along (W to Y) and (Z to A) edges to correct this. We also vary the share of U in the inputs to the treatment and outcome mechanisms, allowing a low-dimensional U to induce substantial confounding (Appendix B.2.3). These choices allow proxy influence and confounding strength to vary more independently of block width, improving prior diversity. These are essential and novel prior adjustments we developed throughout this paper and find worthwhile sharing in the literature.
Architectural challenges.
One difference with current causal PFNs is that proximal inference has more distinct variable roles. The context and the query do not consist of the same variables: we observe (X,W,Z) but want to predict a CATE quantity depending on (X) alone. This requires specific role embedding for X,W,Z, as well as an appropriate masking at inference, a crucial extension for the proximal setting.
Learning conditional expectations from noisy Monte Carlo targets.
We provide a simple framework: generate replicates of individual draws, estimate the conditional mean by Monte Carlo average, estimate the approximation noise and account for it in the loss. That simple principle allows to train a PFN on conditional expectations when its simulator generates individual draws. For example, a tabular prior that can generate repeated outcomes at fixed X=x (e.g. slightly adjusted TabICL or TabPFN priors) can supervise a posterior over E[Y | X=x]. For ProximalFM, the procedure is applied to the CATE by averaging paired counterfactual differences. In Appendix F.2, we observe that this correction reduces the overcoverage caused by training on a small number of draws, an extension that we find necessary to be discussed in the causal PFN literature.
Limits of proxy adjustment with pretrained causal PFNs.
It is a natural starting point to apply an existing pretrained causal PFN to proximal inference. We evaluated CausalPFN by supplying (X,W,Z) in the observational context, and then averaging its predicted contrasts over nearest neighbours of pairs (W,Z) from the point X=x. This yields a CATE estimate depending on x alone. CausalPFN with proxy marginalization is competitive in some settings. However, in the nonlinear setting with strong latent confounding and low proxy reliability, increasing the context size improves its estimates of effect heterogeneity while leaving substantial error in the average effect (Figure D.2). ProximalFM has lower normalized squared ATE error, and additional training on longer contexts reduces this error further on these large context sizes. We adapted earlier causal PFN frameworks to train a model on a proximal prior. ProximalFM as far as we know is the first model that gives practitioners a pretrained model for this setting, so they can estimate a CATE posterior from data with treatment and outcome proxies without designing their own simulator, pretraining a model, or tuning it for each dataset.
We thank the reviewer MRXS for their thoughtful comments on the novelty of ProximalFM and for raising the questions of completeness, bridge-function existence, and partial identification.
Novelty and Relevance.
We agree that existing work, such as CausalPFN or CausalFM, has already applied PFNs to causal effect estimation under other causal assumptions. Naturally, ProximalFM builds on existing architecture (TabICLv2) by adjusting its inputs and prediction head for the proximal causal inference problem. Our main contributions lie in proposing and studying solutions to the challenges that specifically relate to the proximal causal inference setting.
For example, we introduce a simple training strategy to estimate a posterior over a conditional average rather than a distribution of individual-level outcomes. We use it to target the CATE rather than individual treatment effects (ITEs), but the strategy is broadly applicable to other estimands, such as the conditional mean E[Y∣X=x].
Furthermore, PFN priors typically need to generate noisy individual data, as they need to imitate observational context on which the PFN will later be applied to. In causal inference, this is individual potential outcomes. However, if one trains the PFN directly on these values (e.g. on ITE = difference of potential outcomes), the PFN will learn the posterior distribution of the individual effect. This individual effect has the right mean, but its uncertainty is wider than the one of the quantity of interest (ITE = CATE + noise). That is why we introduce a novel CATE approximation using a Monte Carlo average of ITEs. This approximation is then used as target in a newly introduced noise-aware loss, with which we account for Monte Carlo approximation noise.
The new ablation in Appendix F.2 shows that the noise-aware loss behaves as expected. When the Monte Carlo count is high, the need to account for noise is negligible. However, for small Monte Carlo repetitions, one needs to account for the approximation noise otherwise the learned posterior distribution is too wide.
Finally, we would like to emphasize the relevance of the problem: Nonparametric proximal methods typically require solving an ill-posed bridge estimation problem, which may require an appropriate regularization against weak proxy informativeness. This problem is notably difficult, especially for small sample sizes. Our PFN approach does not require any dataset-specific training or tuning. And the pretraining of ProximalFM is also simplified as it leverages the oracle quantities provided by the simulator, therefore not requiring to explicitly solve for the bridge function at any time. Finally, the SCM prior also provides an implicit regularization, avoiding the need to select a regularization parameter for each dataset.
Completeness and Partial Identification.
We agree that potential misspecifications in the prior may lead to loss of performance (larger posterior uncertainty and informative, but misspecified intervals). We choose a prior specification that trades off feasibility, compute and performance. ProximalFM is very competitive across different settings, in particular for the relevant case of high confounding and low proxy informativeness (Figure 4).
More importantly, we are excited to see reviewer MRXS recognise the importance of partially identifying the CATE in the proximal learning setting, e.g. when the full identification criteria are not guaranteed to be fulfilled. Naturally, we have started parallel work that addresses this exact question of partial identification, which will form part of a separate publication.
Indeed, it will also take inspiration from the work done in Balazadeh et al. (2026), and combine this with initial closed-form solutions into bounding of proximal causal effects by Ghassami et al. (2023).
Crucially, we found that identifying the challenges of misspecification that appear during the development of ProximalFM to be indispensable first step towards developing bounding solutions of those causal effects. We are looking forward to presenting and discussing partial identification results in our upcoming submission, for which ProximalFM serves as a foundation.
Balazadeh, V., Kamkari, H., Barath, M., Silva, R., & Krishnan, R. G. (2026). IV-ICL: Bounding Causal Effects with Instrumental Variables via In-Context Learning. arXiv preprint arXiv:2605.12924.
Ghassami, A., Zhang, Y., Shpitser, I., & Tchetgen Tchetgen, E. (2023). Partial identification of causal effects using proxy variables. arXiv preprint arXiv:2304.04374.