Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

DEFactor: Differentiable Edge Factorization-based Probabilistic Graph Generation (1811.09766v1)

Published 24 Nov 2018 in cs.LG and cs.AI

Abstract: Generating novel molecules with optimal properties is a crucial step in many industries such as drug discovery. Recently, deep generative models have shown a promising way of performing de-novo molecular design. Although graph generative models are currently available they either have a graph size dependency in their number of parameters, limiting their use to only very small graphs or are formulated as a sequence of discrete actions needed to construct a graph, making the output graph non-differentiable w.r.t the model parameters, therefore preventing them to be used in scenarios such as conditional graph generation. In this work we propose a model for conditional graph generation that is computationally efficient and enables direct optimisation of the graph. We demonstrate favourable performance of our model on prototype-based molecular graph conditional generation tasks.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Rim Assouel (8 papers)
  2. Mohamed Ahmed (12 papers)
  3. Marwin H Segler (1 paper)
  4. Amir Saffari (11 papers)
  5. Yoshua Bengio (601 papers)
Citations (53)

Summary

We haven't generated a summary for this paper yet.