- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper uses a federated sampling method for molecular conformer generation. Specifically, given experts with one flow matching based conformer generation, this work trains a router (given a molecular graph, predict which expert "handles" that example), and uses the router at inference time to find the right weightings for the velocity coming from the different experts. This router is trained in a federated way, with updates happening locally for each expert and then combined through some global update.
Critical strengths
The method shows good performance when compared to naive velocity averaging or the single best expert. The soft router (velocities weighted by router probabilities) performs similarly to the top-1 router (velocity of the max probability expert is used). Overall performance appears to be good, and the router is learned correctly from the molecular graph.
Critical weaknesses
The methodological novelty is limited. In some aspects this work closely follows the DDM paper (Decentralized Diffusion Models). The same velocity averaging mechanism through a learned router was proposed there. The differences, from my understanding, are: (a) Application to molecular conformer generation; (b) the router is trained differently, with this work training it on a federated manner, with the updates from each expert being synchronized globally; and (c) the router takes as input a molecular graph (DDM takes noisy images as input to the learned router).
The evaluation and scenarios tested seem to be particularly well suited for the graph based router, since the splits considered come, as I understand, from the molecular graph. The router only taking in the graph may be disfavorable in other settings (e.g. different clients using the same graphs but different conformations). In such cases including the noisy conditioning, as in DDM, could matter. Why was this input removed? [This limitation is acknowledged in the paper.]
Questions for authors
Could this method also be used for other domains in which general labels to condition generation are available? (In this work, molecular graphs represent a strong condition, in other domains, such as protein folding, it could be the protein sequence; or outside of AI for bio, in LLMs the prompt and topic of the prompt, etc).