GraphBPE: Molecular Graphs Meet Byte-Pair Encoding

Yuchen Shen, Barnabás Póczos
7/26/2024
cs.LGcs.AIphysics.chem-ph

No official code found. Best implementation: A-Chicharito-S/GraphBPE (2 stars, MIT, last commit 2024-08-29).

Abstract

With the increasing attention to molecular machine learning, various innovations have been made in designing better models or proposing more comprehensive benchmarks. However, less is studied on the data preprocessing schedule for molecular graphs, where a different view of the molecular graph could potentially boost the model's performance. Inspired by the Byte-Pair Encoding (BPE) algorithm, a subword tokenization method popularly adopted in Natural Language Processing, we propose GraphBPE, which tokenizes a molecular graph into different substructures and acts as a preprocessing schedule independent of the model architectures. Our experiments on 3 graph-level classification and 3 graph-level regression datasets show that data preprocessing could boost the performance of models for molecular graphs, and GraphBPE is effective for small classification datasets and it performs on par with other tokenization methods across different model architectures.

View on arXivView PDF

Code Implementations(1)

MIT
21Shell, PythonJul 1, 20242 years agoMIT

Cite this paper

@article{shen2024graphbpe,
  title  = {GraphBPE: Molecular Graphs Meet Byte-Pair Encoding},
  author = {Yuchen Shen and Barnabás Póczos},
  year   = {2024},
  eprint = {2407.19039},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.19039v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.19039.svg)](https://codeofpaper.com/paper/2407.19039)

Discussion