Semi-Equivariant Continuous Normalizing Flows for Target-Aware Molecule Generation

• URL: http://arxiv.org/abs/2211.04754v1
• Date: Wed, 9 Nov 2022 09:16:39 GMT
• Title: Semi-Equivariant Continuous Normalizing Flows for Target-Aware Molecule Generation
• Authors: Eyal Rozenberg and Daniel Freedman
• Abstract summary: We propose an algorithm for learning a conditional generative model of a molecule given a target. Given a receptor molecule that one wishes to bind to, the conditional model generates candidate ligand molecules that may bind to it. We evaluate our method on the CrossDocked 2020 dataset, attaining a significant improvement in binding affinity over competing methods.
• Score: 14.182657807324999
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We propose an algorithm for learning a conditional generative model of a molecule given a target. Specifically, given a receptor molecule that one wishes to bind to, the conditional model generates candidate ligand molecules that may bind to it. The distribution should be invariant to rigid body transformations that act $\textit{jointly}$ on the ligand and the receptor; it should also be invariant to permutations of either the ligand or receptor atoms. Our learning algorithm is based on a continuous normalizing flow. We establish semi-equivariance conditions on the flow which guarantee the aforementioned invariance conditions on the conditional distribution. We propose a graph neural network architecture which implements this flow, and which is designed to learn effectively despite the vast differences in size between the ligand and receptor. We evaluate our method on the CrossDocked2020 dataset, attaining a significant improvement in binding affinity over competing methods.

Related papers

• Conditional Synthesis of 3D Molecules with Time Correction Sampler [58.0834973489875]
  Time-Aware Conditional Synthesis (TACS) is a novel approach to conditional generation on diffusion models. It integrates adaptively controlled plug-and-play "online" guidance into a diffusion model, driving samples toward the desired properties.
  arXiv  Detail & Related papers  (2024-11-01T12:59:25Z)
• ET-Flow: Equivariant Flow-Matching for Molecular Conformer Generation [3.4146914514730633]
  We introduce Equivariant Transformer Flow (ET-Flow) to predict low-energy molecular conformations. Our approach results in a straightforward and scalable method that operates on all-atom coordinates with minimal assumptions. ET-Flow significantly increases the precision and physical validity of the generated conformers, while being a lighter model and faster at inference.
  arXiv  Detail & Related papers  (2024-10-29T16:44:10Z)
• Derivative-Free Guidance in Continuous and Discrete Diffusion Models with Soft Value-Based Decoding [84.3224556294803]
  Diffusion models excel at capturing the natural design spaces of images, molecules, DNA, RNA, and protein sequences. We aim to optimize downstream reward functions while preserving the naturalness of these design spaces. Our algorithm integrates soft value functions, which looks ahead to how intermediate noisy states lead to high rewards in the future.
  arXiv  Detail & Related papers  (2024-08-15T16:47:59Z)
• Molecule Design by Latent Prompt Transformer [76.2112075557233]
  This work explores the challenging problem of molecule design by framing it as a conditional generative modeling task. We propose a novel generative model comprising three components: (1) a latent vector with a learnable prior distribution; (2) a molecule generation model based on a causal Transformer, which uses the latent vector as a prompt; and (3) a property prediction model that predicts a molecule's target properties and/or constraint values using the latent prompt.
  arXiv  Detail & Related papers  (2024-02-27T03:33:23Z)
• Learning Invariant Molecular Representation in Latent Discrete Space [52.13724532622099]
  We propose a new framework for learning molecular representations that exhibit invariance and robustness against distribution shifts. Our model achieves stronger generalization against state-of-the-art baselines in the presence of various distribution shifts.
  arXiv  Detail & Related papers  (2023-10-22T04:06:44Z)
• Modular Flows: Differential Molecular Generation [18.41106104201439]
  Flows can generate molecules effectively by inverting the encoding process. Existing flow models require artifactual dequantization or specific node/edge orderings. We develop continuous normalizing E(3)-equivariant flows, based on a system of node ODEs and a graph PDE. Our models can be cast as message-passing temporal networks, and result in superlative performance on the tasks of density estimation and molecular generation.
  arXiv  Detail & Related papers  (2022-10-12T09:08:35Z)
• GeoDiff: a Geometric Diffusion Model for Molecular Conformation Generation [102.85440102147267]
  We propose a novel generative model named GeoDiff for molecular conformation prediction. We show that GeoDiff is superior or comparable to existing state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-03-06T09:47:01Z)
• Sparse Communication via Mixed Distributions [29.170302047339174]
  We build theoretical foundations for "mixed random variables" Our framework suggests two strategies for representing and sampling mixed random variables. We experiment with both approaches on an emergent communication benchmark.
  arXiv  Detail & Related papers  (2021-08-05T14:49:03Z)
• Flow Network based Generative Models for Non-Iterative Diverse Candidate Generation [110.09855163856326]
  This paper is about the problem of learning a policy for generating an object from a sequence of actions. We propose GFlowNet, based on a view of the generative process as a flow network. We prove that any global minimum of the proposed objectives yields a policy which samples from the desired distribution.
  arXiv  Detail & Related papers  (2021-06-08T14:21:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.