- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a diffusion-based SBI framework to address three challenges: combining multiple observations, handling hierarchical latent variables, and simulator misspecification. The authors extend existing compositional sampling methods with an observation-count-dependent diffusion coefficient (F-NPSE-SDE). They also introduce HBDS to infer shared and group-specific parameters using a single pretrained model. To address simulator misspecification, they develop a fine-tuning method and use path-space divergence to measure model adaptation. The methods are evaluated on synthetic benchmarks and a biological model with 940 observations across four cell lines.
Critical strengths
-
This paper extends existing compositional sampling methods with a new diffusion coefficient and introduces HBDS for hierarchical inference. These methods allow a single pretrained model to handle different observation sets and hierarchical structures, while avoiding some of the computational costs of existing sampling methods.
-
The paper evaluates the proposed framework on a biological signaling model with 940 observations across four cell lines. The results show improvements in predictive performance in several experimental settings and demonstrate the potential of the framework for real-world scientific inference.
Critical weaknesses
-
Limited improvements and comparisons with existing methods. Although F-NPSE-SDE improves upon F-NPSE on SLCP, the improvement is relatively modest, and it remains less accurate than GAUSS and JAC (Table 1). Moreover, HBDS is mainly compared with pooled sampling, rather than existing hierarchical SBI methods. These results make it difficult to assess whether the proposed methods offer substantial improvements over existing approaches.
-
Limited theoretical guarantees. Although the paper derives a new diffusion coefficient and provides a path-space analysis using Girsanov's theorem, it lacks theoretical guarantees for the accuracy of the proposed inference algorithms. In particular, it is unclear whether F-NPSE-SDE and HBDS converge to the correct target posterior, even with exact scores and sufficiently small sampling steps. The absence of convergence or approximation error guarantees limits the theoretical support for the proposed methods.
Questions for authors
- Can the authors provide stronger comparisons with existing hierarchical SBI methods for HBDS? Also, given the limited accuracy improvement of F-NPSE-SDE on SLCP, could the authors clarify its advantages in terms of posterior accuracy versus computational cost?
- Can the authors provide theoretical justification for the correctness of F-NPSE-SDE and HBDS? In particular, under exact scores and vanishing discretization steps, do these methods converge to the target posterior? If not, can the authors characterize the approximation error?
3 comments
Thank you for the detailed responses and additional experiments. I appreciate the new comparisons and theoretical analysis, which address most of my concerns. While the theoretical guarantees are still limited, I think the revised experimental results provide stronger support for the proposed methods. I will raise my rating from 2 to 3.
Additional Analysis of Score and Conditioning Errors in HBDS
We thank the reviewer for their time and appreciate their updated assessment of the revised experiments and theoretical analysis. Following their question about approximation error, we were also curious about this relationship between error in the score and conditioning values. Thus, we investigated this and added Corollary B.2 after Proposition B.1 to examine how Tweedie conditioning affects a single-observation HBDS block update.
The corollary separates score estimation error, error in the supplied denoising estimate, and the remaining gap from replacing uncertainty about the clean global state with a single conditioning value via a telescoping decomposition. The ideal HBDS update in Proposition B.1 uses the exact mixed-time score, which averages clean-conditioned scores over plausible clean global states given the noisy global state, the current local state, and the observation. Corollary B.2 bounds the discrepancy between the learned Tweedie-conditioned score and this exact score, making the score-error term in Proposition A.2’s one-step Wasserstein bound explicit for a local HBDS correction.
This helps distinguish several cases where different improvements may be useful:
- Concentrated conditional posterior and accurate denoising. When the Tweedie estimate is close to the conditional mean and the remaining spread is small, the conditioning approximation can be accurate. Improving the learned score then addresses the remaining score estimation error.
- Inaccurate denoising. Even an accurate clean-conditioned score model can receive a poor conditioning value. Moving the estimate closer to the relevant conditional mean tightens the denoising contribution to the bound, with the size of the improvement controlled by the score’s sensitivity to that value.
- Broad or multimodal conditional posterior. Even the exact mean can lie between modes. If the clean score varies nonlinearly across plausible global states, evaluating it at the mean can differ from averaging those scores. This motivates exploring multiple conditioning values and their conditional weights during sampling.
These cases suggest concrete directions for improving HBDS. Flow maps could make this exploration more practical by reducing the cost of generating multiple candidate clean conditioning states within each HBDS update. We leave this for future work.
Finally, we are also revising the notation throughout the HBDS derivation and algorithm to represent group-specific latent variables generically as , reserving receptor-specific notation for the BMP application. This clarification emphasizes that HBDS is applicable to hierarchical SBI problems beyond receptor inference, with the BMP model serving as one scientific application.
We thank the reviewer for their time and thoughtful review, and are glad they found the paper clear and easy to follow. We believe the revised manuscript addresses the main concerns and substantially strengthens both the experimental and theoretical contributions.
Response to weaknesses:
RjX1, we corrected a sampling implementation bug and substantially improved F-NPSE-SDE's performance. It now achieves accuracy comparable to GAUSS and JAC on the Gaussian and SLCP benchmarks, with improvements on some sW and MMD metrics. We also added comparisons with CSM-Damped from Arruda et al. (2026) and a computational complexity analysis in section A.8, demonstrating the practical advantages of avoiding Jacobian and covariance calculations.Response to questions:
We implemented the hierarchical AR(1) benchmark of Arruda et al. (2026), finding that HBDS achieves lower global parameter NRMSE than the published Hierarchical-CSM result, although local parameter inference remains less accurate. As discussed in the main rebuttal, HBDS's main advantage is introducing hierarchical structure at sampling time using a single pretrained joint model. F-NPSE-SDE now achieves competitive posterior accuracy without the Jacobian or covariance estimation costs of GAUSS and JAC, as demonstrated by the complexity analysis and BMP runtimes in section A.8.
The new theoretical results in sections A.4 and B.1 clarify the guarantees and remaining approximations. Proposition B.1 shows that idealized HBDS recovers the correct hierarchical posterior under exact conditional flows, whereas practical HBDS uses learned scores and finite sampling steps. For F-NPSE-SDE, our Wasserstein bounds characterize how composed-score approximation and numerical error affect the intermediate marginals, but do not establish general convergence to the exact posterior under vanishing step size alone. Extending these bounds to the alternating global and local updates of practical HBDS is an important direction for future work.