- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes MolPFN, a graph-level prior-data fitted network for molecular property prediction without task-specific fine-tuning. The method extends a pretrained tabular PFN, LimiX, to molecular graphs by introducing molecular tokenization and graph adapters. The graph adapters are interleaved with frozen Transformer blocks to incorporate molecular connectivity while leveraging in-context learning. To pretrain these modules, the authors construct a synthetic graph-level prior that generates molecular-like graphs, atom features, and target labels. Experimental results demonstrate competitive performance on molecular regression tasks and the potential to transfer to classification and few-shot prediction settings.
Critical strengths
1. Graph-aware Extension of Tabular PFNs
The paper presents an interesting approach to extending tabular PFNs to molecular graph prediction. By integrating graph adapters between Transformer blocks, the proposed method enables repeated interaction between molecular structural information and context-dependent representations. This architecture provides a meaningful alternative to approaches that compress molecular graphs into fixed-dimensional representations before PFN inference.
2. Competitive Performance Without Task-specific Fine-tuning
The proposed method achieves competitive performance on molecular property prediction tasks without updating model parameters for each new task. This is an important advantage because it allows the model to leverage labeled context examples for prediction without requiring additional task-specific fine-tuning. The use of a synthetic graph-level prior for pretraining without experimentally measured molecular property labels is also an interesting aspect of the approach.
Critical weaknesses
1. Insufficient Justification for the Synthetic Graph-level Prior
The proposed method generates synthetic graphs and labels using randomly constructed structural causal models (SCMs). However, it is unclear why the relationships learned from these synthetic tasks should transfer effectively to real molecular property prediction. Although the generated graphs are designed to resemble molecular structures, similarity in graph topology does not necessarily imply similarity in the relationships between molecular features and target properties. The paper would benefit from a clearer explanation or experimental analysis of why the proposed prior is appropriate for molecular prediction.
2. Insufficient Analysis of the Graph Adapter's Contribution
The proposed method repeatedly integrates graph adapters between LimiX Transformer blocks to incorporate molecular connectivity. Although comparisons with approaches using pretrained molecular encoders are provided, it remains unclear whether this interleaved architecture provides substantial benefits over simpler approaches that encode molecular graphs before PFN inference. A more direct ablation study would help clarify whether repeated graph processing is necessary and how much it contributes to the overall performance improvement.
Questions for authors
1. Transferability of the Synthetic Graph-level Prior
What characteristics of the synthetic feature–label relationships enable effective transfer to real molecular property prediction? Could the authors provide additional analysis demonstrating how the proposed synthetic prior relates to real molecular prediction tasks?
2. Classification Performance
Although MolPFN achieves competitive classification performance despite regression-only pretraining, could the authors clarify whether classification-specific graph adapter pretraining would be expected to further improve these results?
3. Necessity of Interleaved Graph Processing
How much does repeatedly inserting graph adapters between LimiX Transformer blocks contribute to prediction performance? Would a simpler architecture that applies graph encoding only before PFN inference achieve comparable results?
4. Sensitivity to Synthetic Data Generation
How sensitive is the performance of MolPFN to the design of the synthetic graph-level prior? In particular, how do different graph generation strategies or SCM-based label generation mechanisms affect downstream prediction performance?
3 comments
Response to question 3
Question 3: Necessity of Interleaved Graph Processing
How much does repeatedly inserting graph adapters between LimiX Transformer blocks contribute to prediction performance? Would a simpler architecture that applies graph encoding only before PFN inference achieve comparable results?
We thank the reviewer for this important question. To directly investigate the necessity of interleaved graph processing and address Weakness 2, we have substantially extended our architectural ablation study. Specifically, we introduced a simpler architecture that retains the initial GNN and multi-view pooling but removes the interleaved graph adapters, encoding each molecule only once before inference with the frozen LimiX backbone. We additionally evaluated simplified message-passing and pooling configurations, resulting in six architectural ablations summarized in Table A9 of the revised manuscript.
Molecular-property prediction. Across nine benchmarks and three input configurations (atom features alone or combined with Mole-BERT or MolDeBERTa embeddings), removing interleaved adapters yields broadly comparable performance to the full MolPFN architecture, with generally modest, dataset-dependent differences and no consistent advantage for either approach (Tables A10–A12).
The additional ablations further clarify the role of individual architectural components. Simplifying message passing (variants A and B in Table A9) has relatively little impact on performance. For graph-level pooling, retaining mean, min, and max aggregation while removing attention largely preserves performance (variant E), whereas mean-only or attention-only pooling (variants C and D) generally performs worse, particularly on regression benchmarks (Tables A10–A12). These results highlight the benefit of combining complementary pooling operations, while suggesting that attention pooling is not essential for conventional molecular-property prediction.
FS-Mol few-shot prediction. The contribution of interleaving becomes more apparent when generalizing to previously unseen biological assays. Without assay-level meta-training, full MolPFN generally performs better than the encode-once variant, particularly with larger support sets, although the differences remain modest (Figure A2 left, Table A14). After meta-training across FS-Mol assays, removing interleaved adapters reduces ΔAUPRC by 0.054–0.084 across all five support sizes (Figure A2 right, Table A15). Further simplifications of message passing and pooling do not recover the performance of the full architecture, with removing message passing leading to additional deterioration.
Together, these results demonstrate that the contribution of interleaved graph processing depends on the prediction setting. For conventional molecular-property benchmarks, the synthetic prior may already provide a sufficiently strong learning signal for effective prediction using initial graph encoding alone. Our prior sensitivity ablations discussed below (Appendix E) support this interpretation: simplified architectures retain strong performance under the same graph-dependent synthetic prior, whereas disrupting the SCM-based feature–target relationship substantially degrades performance even with the full architecture. In contrast, interleaving provides a clear advantage for few-shot generalization to unseen assays, particularly after meta-training. This may reflect the ability to progressively refine molecular representations within the PFN using task-specific information from labelled support examples.
We have incorporated these additional experiments and their discussion into the revised manuscript (Appendix D, Tables A9–A14 and Figure A2), sections 5.2-5.3, subsections Architectural ablations and Evaluation results respectively, as well as section 6, fourth paragraph.
Response to question 4
Question 4: Sensitivity to Synthetic Data Generation.
How sensitive is the performance of MolPFN to the design of the synthetic graph-level prior? In particular, how do different graph generation strategies or SCM-based label generation mechanisms affect downstream prediction performance?
We thank the reviewer for raising this question. We investigated sensitivity to the synthetic prior through two complementary ablations: (i) changing the graph-generation strategy while retaining the SCM mechanism, and (ii) removing graph dependence from SCM-based feature and label generation. Across these experiments, we retained the MolPFN architecture and optimization procedure and selected checkpoints using ZINC validation performance.
1. Sensitivity to graph-generation strategy (Tables A16-A17). We compared the molecular-skeleton prior with two alternative graph families: random trees, which contain no rings or chemical valence constraints, and degree-corrected stochastic block models (SBMs), which generate heterogeneous connectivity and community structure without molecular valence constraints or calibrated ring-size preferences. The SCM-based feature and label generation mechanism remained unchanged.
All three priors achieve broadly comparable downstream performance, with modest, task-dependent differences and no consistently superior topology. Without a molecular encoder, the tree prior improves six of nine benchmarks, including ESOL (RMSE: 1.114 → 1.061), FreeSolv (RMSE: 2.130 → 2.024), and BACE (ROC-AUC: 0.827 → 0.839). Conversely, the baseline performs better on ZINC (MAE: 0.316 versus 0.319), ClinTox (ROC-AUC: 0.936 versus 0.918), and SIDER (ROC-AUC: 0.660 versus 0.652). The SBM prior similarly improves ESOL (RMSE: 1.057) but yields larger degradations on ZINC (MAE: 0.343) and ClinTox (ROC-AUC: 0.904). The preferred topology also depends on the molecular embeddings: trees achieve the best mean rank without an encoder and with Mole-BERT, whereas SBM achieves the best mean rank with MolDeBERTa (Table A16). These findings demonstrate that MolPFN transfers effectively across different synthetic graph families without requiring a particular molecularly calibrated topology.
2. Sensitivity to graph dependence in the SCM (Tables A18-A19). We constructed an edge-independent, purely tabular variant by disabling SCM message passing, removing degree and PageRank inputs, and assigning the virtual readout node its own non-zero sampled cause. This variant performs worse than the baseline in all 27 comparisons across nine datasets and three prediction pipelines. Without a molecular encoder, ZINC MAE increases from 0.316 to 1.583, and BACE ROC-AUC decreases from 0.827 to 0.558. Adding molecular embeddings does not eliminate the gap.
This comparison requires a specific interpretation: with these changes, the virtual-node label depends only on its own cause and is no longer predictable from atom features. Thus, the experiment demonstrates the importance of preserving a learnable relationship between node features and graph-level labels in our SCM construction, although it does not establish that graph-based SCMs outperform every possible tabular label-generation mechanism or isolate the contribution of each modified setting.
Together, these findings support flexibility in the choice of synthetic graph topology, but a strong dependence on a learnable graph-level supervision mechanism. Full experimental results are provided in Appendix E (Tables A16–A19). We have also amended the main text of the manuscript accordingly at the end of the sections 4.1 and 4.2, section 5.2 "Prior sensitivity", section 6, fourth paragraph.
Response to questions 1 and 2
We thank the reviewer for their insightful comments and for highlighting the value of graph-aware in-context learning without task-specific fine-tuning. In response to their questions, we have further examined the transferability and sensitivity of our synthetic graph-level prior, investigated the contribution of interleaved graph processing through additional ablations, and clarified the potential role of classification-specific pretraining. We discuss these findings below.
Question 1: Transferability of the Synthetic Graph-level Prior
What characteristics of the synthetic feature–label relationships enable effective transfer to real molecular property prediction? Could the authors provide additional analysis demonstrating how the proposed synthetic prior relates to real molecular prediction tasks
We thank the reviewer for this question. The key characteristic of our synthetic prior is that it constructs graph-level labels from node features through graph-dependent computation. This reflects the structure of molecular property prediction, where atom attributes and molecular connectivity jointly inform a molecule-level target.
Specifically, our GNN-based SCM propagates information between connected nodes, while a virtual readout node connected to all nodes aggregates information to generate the graph-level label. Degree and PageRank values are also included as structural inputs in a sampled subset of synthetic datasets. These components provide a learnable relationship between node-level information, graph structure, and the target. The intended correspondence to molecular tasks is therefore in the structure of the prediction problem; we do not assume that the sampled SCMs reproduce specific physical or chemical mechanisms.
Our additional ablations (Appendix E) provide empirical support for this interpretation. Competitive downstream performance across different graph generators (Table A16) suggests that transfer does not require precisely matching molecular topology. Conversely, the substantially weaker performance of the edge-independent SCM variant (Tables A18-19) highlights the importance of preserving meaningful node-feature-to-graph-label relationships. Together, these findings support the relevance of the synthetic prior's graph-level prediction structure for transfer to real molecular tasks.
Question 2: Classification Performance
Although MolPFN achieves competitive classification performance despite regression-only pretraining, could the authors clarify whether classification-specific graph adapter pretraining would be expected to further improve these results?
Classification-specific graph adapter pretraining could potentially improve performance; however, our additional evaluation suggests that regression-only pretraining already learns representations that transfer effectively to classification. We believe that this transfer is plausible because threshold-based classification preserves the ordering of the underlying continuous targets, allowing a regression-trained model to distinguish classes without explicitly learning a classification objective.
Specifically, we sampled eight synthetic datasets from the training prior and converted their regression targets into binary classification labels. Without classification-specific adapter training, MolPFN achieved a mean ROC-AUC of 0.9139 across these datasets, with individual results reported in the table. This supports the ability of the regression-pretrained adapters to capture information useful for classification.
The table displayed below shows the calssification based synthetically generated datasets.
We have included the experiment in the manuscript, please see section 5.2, end of "Evaluation results", Table A4.