Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2106.15098v2

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2106.15098v2 (cs)
[Submitted on 29 Jun 2021 (v1) , revised 19 Dec 2021 (this version, v2) , latest version 17 Dec 2022 (v4) ]

Title: Graph Piece: Efficiently Generating High-Quality Molecular Graphs with Substructures

Title: 图片段:通过子结构高效生成高质量分子图

Authors:Xiangzhe Kong, Zhixing Tan, Yang Liu
Abstract: Molecule generation, which requires generating valid molecules with desired properties, is a fundamental but challenging task. Recent years have witnessed the rapid development of atom-level auto-regressive models, which usually construct graphs following sequential actions of adding atom-level nodes and edges. However, these atom-level models ignore high-frequency substructures, which not only capture the regularities of atomic combination in molecules but are also often related to desired chemical properties, and therefore may be sub-optimal for generating high-quality molecules. In this paper, we propose a method to automatically discover such common substructures, which we call graph pieces, from given molecular graphs. We also present a graph piece variational autoencoder (GP-VAE) for generating molecular graphs based on graph pieces. Experiments show that our GP-VAE models not only achieve better performance than the state-of-the-art baseline for distribution-learning, property optimization, and constrained property optimization tasks but are also computationally efficient.
Abstract: 分子生成需要生成具有所需特性的有效分子,这是一个基本但具有挑战性的任务。近年来,原子级自回归模型迅速发展,这些模型通常通过添加原子级节点和边的顺序操作来构建图。然而,这些原子级模型忽略了高频子结构,这些子结构不仅捕捉分子中原子组合的规律,而且通常与所需的化学性质有关,因此可能在生成高质量分子方面不是最优的。在本文中,我们提出了一种方法,可以从给定的分子图中自动发现此类常见子结构,我们称之为图块。我们还提出了一种基于图块的图块变分自编码器(GP-VAE)用于生成分子图。实验表明,我们的GP-VAE模型不仅在分布学习、属性优化和约束属性优化任务中优于最先进的基线,而且计算效率也较高。
Comments: 19 pages, 12 figures, under review
Subjects: Machine Learning (cs.LG) ; Quantitative Methods (q-bio.QM)
Cite as: arXiv:2106.15098 [cs.LG]
  (or arXiv:2106.15098v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2106.15098
arXiv-issued DOI via DataCite

Submission history

From: Xiangzhe Kong [view email]
[v1] Tue, 29 Jun 2021 05:26:18 UTC (795 KB)
[v2] Sun, 19 Dec 2021 07:59:46 UTC (769 KB)
[v3] Sat, 1 Oct 2022 02:56:19 UTC (799 KB)
[v4] Sat, 17 Dec 2022 13:44:00 UTC (800 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2021-06
Change to browse by:
cs
q-bio
q-bio.QM

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号