- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper presents a framework for Bayesian inference over ancestral recombination graphs (ARGs) with generative flow networks (GFlowNets). The model samples ARGs using an acyclic sequential decision process over backward-time coalescence and recombination events. The state retains the chronological history of ancestral events constructed so far, the current backward time and the set of active ancestral lineages. The policy is parameterized by a transformer model and at each step predicts first the event type, then the event parameters (either a pair of lineages to coalesce or a lineage and breakpoint for recombination), and finally the waiting time to the next ancestral event. The GFlowNet reward is the unnormalized Bayesian posterior probability, and the model is trained via Subtrajectory Balance loss. The presented approach achieves competitive reconstruction against ARGInfer and SINGER baselines on simulated datasets.
Critical strengths
The paper presents a methodologically solid and straightforward application of the GFlowNet framework to a new domain of problems, namely sampling ARGs from Bayesian posteriors. I have almost no prior knowledge on the genomic domain and ARGs themselves, but I checked all parts related to the application of GFlowNets, namely the environment construction, the model parameterization and the training objective, and everything looks solid to me. I appreciated the detailed derivation and discussion of all methodological details in Appendix that are needed to implement the approach.
The novelty is clearly there, and the application itself bears scientific importance, as no prior works developed amortized sampling approaches for Bayesian posteriors over ARGs.
I also appreciated the honest reporting of numerical results, faithfully showing where the approach falls behind the baselines. And, despite this, I find the experimental results solid as the paper presents the first amortized learning-based approach, compared to prior MCMC-based methods. The only minor issue I want to point out is the choice to highlight in bold the results of the proposed method in Table 2, rather than conventionally highlighting the best results, which can mislead some readers in my opinion.
Critical weaknesses
The paper is missing some important references. The source paper for one of the baselines, namely ARGInfer, is not cited [1]. The paper that developed methodology for GFlowNets for working with continuous variables is not cited [2]. In addition, there is another prior work on sampling discrete graphs together with continuous parameters with GFlowNets [3]. There is also a work that applies deep reinforcement learning to generate ARGs [4], while GFlowNets themselves are known to be equivalent to specific regularized RL methods [5], so I think it is worth a small discussion.
The method is evaluated only on simulated data, while prior works, e.g. SINGER, are also evaluated on real-world genomic data.
While the paper generally has good writing, I would suggest adding a section to Appendix explaining the background on the mathematical model for ARGs. Since I had no prior knowledge on them, some specifics of the task and the methodology were very hard to grasp on the first read.
References:
[1] Mahmoudi et al. Bayesian inference of ancestral recombination graphs. PLOS Computational Biology 2022.
[2] Lahlou et al. A theory of continuous generative flow networks. ICML 2023.
[3] Deleu et al. Joint Bayesian Inference of Graphical Structure and Parameters with a Single Generative Flow Network. NeurIPS 2023.
[4] Raymond et al. Constructing ancestral recombination graphs through reinforcement learning. Frontiers in Genetics 2025.
[5] Tiapkin et al. Generative Flow Networks as Entropy-Regularized RL. AISTATS 2024.
Questions for authors
I think that this is a borderline yet solid paper, so I recommend acceptance, given that my concerns related to presentation and references would be fixed. I do not need additional clarification on any questions from the authors.