- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces MolFiber, a molecular property prediction framework that leverages Morgan fingerprints as a global reference anchor while utilizing GraphGrid and MolFormer as local refiners within Morgan-similar neighborhoods. By decomposing auxiliary evidence into local contrast and fiber-level signals, the framework offers two main variants, MolFiber-G and MolFiber-L, along with their high-performing ensemble, MolFiber-ENS. Extensive evaluations across 24 benchmark datasets demonstrate that this asymmetric, anchor-relative organization significantly outperforms traditional global fusion strategies.
Critical strengths
This paper starts from the traditional multi-view fusion methods and clearly distinguishes the roles of different representations: Morgan fingerprints provide a stable reference for global prediction, while GraphGrid and MolFormer offer additional information by comparing local similar molecules. This asymmetric design is intuitive and has potential value, as it provides a principled method that can introduce auxiliary representations without relying on unrestricted feature fusion. The control experiments further support the importance of the proposed neighborhood mechanism.
The evaluation covers 24 molecular property prediction benchmarks and is compared with representative fingerprint-based, graph-structured, pre-trained, and hybrid methods. In addition to overall performance, the authors also conducted ablation experiments on neighborhood construction, neighborhood size, and alternative context correction strategies. These analyses help verify the robustness of the empirical results and provide valuable insights, indicating under what circumstances retaining the neighborhood hierarchy information or emphasizing relative molecular differences is more beneficial for prediction. The complementary behavior of the two variants also prompted the proposal of an integrated design.
Critical weaknesses
The innovation of this method and the underlying concepts it contributes have not been fully verified. Although MolFiber introduces a neighborhood-based strategy to combine molecular representations, its main components still rely on existing concepts, including nearest neighbor retrieval based on similarity, pairwise feature interaction, residual prediction correction, and ensemble learning. Therefore, the main contribution of this paper lies in how these components are organized around an anchor point based on Morgan, rather than proposing a significantly novel learning principle. Although ablation experiments show that local conditioning is beneficial, they do not fully prove why the proposed model is essentially superior to traditional similarity-weighted local models or other neighborhood-based correction mechanisms. This limits the strength of the methodological contribution of the paper.
The experimental results are not yet convincing enough to prove the practical significance and universality of this method. Although this evaluation covers 24 molecular property prediction benchmarks, the overall improvement of MolFiber-ENS compared to existing strong methods is relatively limited. The summary results alone cannot determine whether these improvements are statistically reliable or consistent across different datasets. More importantly, the core motivation of this method is to assist representations in resolving the ambiguity within the neighborhood defined by Morgan. However, the current evaluation does not fully prove that these improvements are mainly concentrated in such challenging cases, nor does it directly quantify the degree to which local ambiguity is resolved. Since this method relies on Morgan fingerprints to define these neighborhood structures, it is necessary to provide stronger evidence to verify the core claim and clearly identify under what circumstances the proposed method can bring meaningful advantages.
Questions for authors
-
In Appendix A.3, the authors note that for a fiber containing members, the pair encoder evaluates all ordered pairs, yielding a training complexity of . While offers a good trade-off and maintains linear scaling with respect to dataset size for fixed small , Appendix Table 7 shows that training time increases significantly as dataset size grows (e.g., from ~11s for BACE with to ~607s for HIV with ). Furthermore, scaling to 16 or 24 causes a quadratic jump in pair computations ( and , respectively). The authors should explicitly discuss the scalability limitations of this pair-based approach on ultra-large molecular datasets (e.g., million-scale ZINC or PubChem subsets). Does this pairwise local computation hit severe GPU memory or time bottlenecks in industrial or ultra-large pretraining scenarios?
-
The entire MolFiber architecture relies heavily on Morgan fingerprints (ECFP4) to define both the global coordinate space and the -NN "approximate fibers." However, different fingerprints or representations can define molecular similarity in vastly different ways. If the Morgan anchor fails in certain chemical spaces (e.g., activity cliffs where structurally similar molecules have vastly different properties, or hash collisions distorting ECFP similarity), does the local refinement mechanism misfire? The authors should discuss the sensitivity of their framework to the quality of the global anchor. Would MolFiber remain robust if substituted with alternative global anchors (such as 3D conformation skeletons, different graph kernels, or different fingerprint radii)? Are there specific datasets where a poor Morgan performance severely restricts MolFiber's correction space?
-
The authors candidly acknowledge (in Section 4.1 and Appendix E.2) that CLAMP performs exceptionally well on TDC datasets because it was pretrained via supervised contrastive learning on ChEMBL bioactivity assay data, leading to domain overlap. However, MolFiber also relies on a frozen pretrained MolFormer (ibm/MoLFormer-XL-both-10pct) and a Morgan predictor. The authors need to further clarify whether the auxiliary views (MolFormer) introduce similar domain overlap or data leakage risks. Specifically, when fine-tuning the projection heads and , does the model implicitly harvest downstream-task-related priors from the pretraining representations? Providing controlled discussions or experiments on pretraining-to-downstream domain gaps would strengthen this point.
7 comments
Responses to Reviewer Fn2n - part 2
W2: Experimental results
The experimental results are not yet convincing enough to prove the practical significance and universality of this method.
We thank the reviewer. This raises three concerns — statistical reliability and consistency, whether the gains concentrate on the hard cases, and when the method helps — and we address each with evidence beyond the summary table.
Reliability and consistency. We do not rely on summary numbers alone. Per-dataset results with standard deviations over n=5 seeds are reported in full (App. F.1–F.2), and significance is tested directly (App. D.1): MolFiber-ENS is significantly better than the fusion controls under Welch's test with Holm–Bonferroni correction and a Fisher omnibus. Consistency is in fact one of MolFiber's clearest advantages: every MolFiber variant stays within ±1.4 AUC across seeds, whereas strong baselines swing by ±3–6 and occasionally ±10–17 (e.g., GROVER on ClinTox, CDDD on HIA). Low, stable variance is what makes the ranking trustworthy rather than an artifact of a lucky seed.
The "limited" overall margin is limited only against one outlier. MolFiber-ENS (82.10) edges CLAMP (82.01) — but CLAMP is a specially-pretrained outlier standing nearly a full point above every other baseline. Against the rest of the field the margin is decisive: +1.13 AUC over the next-best method and average rank 6.46 → 4.77. The gain is also intentionally bounded — MolFiber refines a strong anchor, it does not replace it — so a large aggregate jump is not the right expectation; a reliable, broad improvement with rare regressions is.
Does it concentrate on the hard cases, and by how much? We measure it directly (App. E.1). This is the core of the reviewer's concern, and rather than infer it from aggregate AUC we go molecule-level and count. We isolate the Morgan-ambiguous molecules — activity cliffs, where a near-identical training neighbor carries the opposite label — across all 24 datasets (5,222 of them). On exactly these cases the Morgan anchor errs 1,557 times; MolFiber corrects 287 (18.4% of its cliff errors) and breaks only 178 of the 3,665 it had right (4.9%), net +109, raising cliff accuracy 70.2% → 72.3% (sign test p<10⁻⁶). This directly quantifies the degree of local-ambiguity resolution the reviewer asks for, and App. E.2 shows it molecule by molecule.
When does it help? The same analysis tells us. The benefit concentrates where Morgan-ambiguous cliffs are common (e.g., hERG_Karim +30 net, CYP2C19 +17) and is flat where cliffs or anchor errors are few (BACE, ClinTox) — net-positive on 15 datasets, tied on 7, negative on 2. We report this in full rather than omit it. The other condition is the anchor itself: the anchor-sensitivity ablation (App. D.4) shows the method helps across strong fingerprint anchors and weakens only with one lacking a meaningful similarity geometry. The circumstances under which MolFiber brings an advantage are therefore explicit and tested: a strong fingerprint anchor, applied to property spaces where Morgan-local ambiguity is present.
Revision: added the cliff-level correction analysis across all 24 datasets quantifying local-ambiguity resolution (App. E.1) with molecule-level examples (App. E.2); per-dataset results and significance tests are in App. F.1–F.2 and D.1, and the anchor-sensitivity boundary in App. D.4.
Responses to Reviewer Fn2n - part 3
Q1: Scalability
The authors should explicitly discuss the scalability limitations of this pair-based approach on ultra-large molecular datasets (e.g., million-scale ZINC or PubChem subsets).
We thank the reviewer. The worry is natural — "pairwise" suggests quadratic cost — but the pairwise computation here is local: each molecule compares only against its own K = 8 neighbors, never against the dataset. Concretely, MolFiber's cost splits into a one-time stage computed once per dataset and cached, and a lightweight training stage that reuses it (Table 7, App. C.4).
One-time cached stage. Fingerprints and the Morgan anchor, GraphGrid tensors, frozen MolFormer embeddings, and the Morgan–Tanimoto fibers are each computed once and reused across all variants, seeds, and baselines. On HIV (n ≈ 41k) this is 4,699 s, of which the MolFormer embedding is 84% (3,930 s) — a cost the MolFormer baseline and the fusion controls pay identically. The only MolFiber-specific part, fiber construction, is just 134 s (2.8%).
Training stage: linear in N. With cached inputs, training requires O(NK²) pair-encoder evaluations, and since K is a small fixed constant, this is linear in dataset size. The runtimes confirm it: MolFiber-G/-L trains in 11 s (BACE), 56 s (Tox21), and 298 s (HIV) — about 7.2 ms per molecule across a 27× range in dataset size, i.e., a per-molecule cost independent of N. This is only 5–8% of the one-time cost. MolFiber-ENS is exactly twice a single model (G and L train independently and in parallel), and each extra seed or variant adds only this marginal amount.
GPU memory is independent of N. We never materialize a dataset-wide pairwise matrix. Each fiber is (K+1)² = 81 pairs, processed one minibatch at a time (batch 64), so peak memory is a fixed footprint set by batch × K² — it does not grow with dataset size. The only quadratic factor is K², and K is a knob we never scale up: App. D.3 (Table 4) shows K = 8 captures essentially all the benefit (K = 16, 24 cost ~4× and ~9× the pairwise computation for at most +0.05 AUC).
At million-scale (ZINC/PubChem). The two dominant costs are one-time feature extraction — the same embedding any method using these representations pays — and nearest-neighbor retrieval. For the latter, exact scanning can be replaced by approximate NN search on the binary fingerprints (HNSW, or MinHash-based LSH for Tanimoto): an index built once over the training pool lets each query examine a small candidate set. Retrieval is label-free and cached, so this swap leaves the linear, fixed-memory O(NK²) training stage unchanged. We have evaluated up to n ≈ 41k rather than 10⁶, so we present this as a scalability analysis, but the method has no inherent super-linear-time or N²-memory bottleneck.
Revision: we added a scalability discussion (App. A.3/C.4) noting the one-time cached stage vs. the linear, fixed-memory training stage (observed ~7.2 ms/molecule across a 27× dataset range), that peak GPU memory is independent of N, and that million-scale retrieval can use approximate-NN indices while leaving the O(NK²) training unchanged.
Responses to Reviewer Fn2n - part 1
We thank the reviewer for their careful and constructive feedback. We have revised the paper accordingly (updated PDF) and summarize the main changes in our general response above; we address each point individually below.
W1: Novelty
We thank the reviewer for raising this concern. We agree the components — similarity-based nearest-neighbor retrieval, pairwise feature interaction, residual correction, ensembling — are individually established, and we claim none as a new primitive. The contribution is the organizing principle, and the reviewer's sharper question — why this is superior to a traditional similarity-weighted local model or another neighborhood-correction mechanism — is the one we can answer concretely.
The key distinction: the neighborhood and its resolution come from different representations. A traditional similarity-weighted local model (e.g., weighted k-NN) predicts from neighbor labels on the same representation that defines the neighborhood. On this benchmark that representation is Morgan — and that is exactly the model that fails on activity cliffs: when a query's Morgan-nearest neighbors carry conflicting labels, label-weighting predicts the neighborhood consensus and gets the cliff wrong. MolFiber breaks this circularity. The neighborhood is defined by Morgan, but the resolution comes from different views — GraphGrid and MolFormer — that see distinctions invisible to the Morgan geometry, and retrieval is label-free: the readout never uses neighbor labels, only fiber-relative comparisons of the auxiliary embeddings (App. A.2). A similarity-weighted local model on Morgan cannot do this, because it has only Morgan.
This is not a conceptual claim alone — it is what the cliff analysis shows. The frozen Morgan anchor is itself a similarity-based global model; on activity cliffs it errs on 1,557 molecules, and MolFiber corrects 287 of them (18.4%) while breaking only 4.9% of those it had right (net +109, p<10⁻⁶; App. E.1), using the auxiliary views to separate molecules Morgan places together. No Morgan-only local model could produce these corrections.
We also control against the alternatives directly. Replacing the Morgan neighborhood with a random one of the same size collapses the gain (App. D.5), so it is the Morgan-confused neighborhood specifically that matters, not generic locality. Removing the fiber entirely while keeping the anchor, views, and bounded residual (Anchor-MLP) drops OGB AUC from 80.15 to 77.68 (App. D.1). And alternative neighborhood-correction mechanisms — learned per-task or per-molecule retention, and per-view routing — do not beat the simple design (App. D.2).
These choices are domain-specific, not generic: Morgan is the anchor because fair benchmarking shows it is cheap and hard to beat (Praski et al.); the fibers are Morgan–Tanimoto neighborhoods because that is the medicinal-chemistry definition of an activity cliff; and the bounded, zero-initialized residual encodes the prior that a weaker view should refine, not overturn, a strong anchor. The result is a modular recipe — swapping the anchor for Atom Pair or MACCS keeps MolFiber-ENS at 79.3–80.2 AUC (App. D.4).
We are glad to state explicitly that our contribution is a domain-motivated, empirically validated framework — a fusion method engineered for the activity-cliff structure of MPP, in which the neighborhood and its resolution come from different representations — rather than a new ML primitive. That is the right level at which to judge the novelty.
Revision: We added the controls and evidence that distinguish MolFiber from single-representation local models and other neighborhood-correction mechanisms — the cliff-correction analysis (App. E.1), the random-neighborhood control (App. D.5), the Anchor-MLP/fusion controls (App. D.1), the learned-variant comparison (App. D.2), and the anchor-sensitivity ablation (App. D.4).