It's All Connected: Topology-Aware Structural Graph Encoding Improves Performance on Polymer Prediction

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Erdogan, H. Ibrahim, Raviswamy, Punith, Agrawal, Nikita, Köster, Yannik, Zechel, Stefan, Schubert, Ulrich S., Mayer, Ruben, Kuenneth, Christopher
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918494590730240
author Erdogan, H. Ibrahim
Raviswamy, Punith
Agrawal, Nikita
Köster, Yannik
Zechel, Stefan
Schubert, Ulrich S.
Mayer, Ruben
Kuenneth, Christopher
author_facet Erdogan, H. Ibrahim
Raviswamy, Punith
Agrawal, Nikita
Köster, Yannik
Zechel, Stefan
Schubert, Ulrich S.
Mayer, Ruben
Kuenneth, Christopher
contents Graph Neural Networks (GNNs) have achieved strong results in molecular property prediction, but polymers present distinct challenges: labeled datasets are scarce and small (typically in the order of hundreds of polymers) due to the need for expensive experimentation, and complex polymer chain distributions influence polymer properties. Established practice in polymer prediction represents polymers solely by graphs of their repeat units, discarding the chain-scale morphology that governs key properties such as the glass transition temperature ($T_g$). In this work, we propose a principled graph construction that addresses this gap. Given a polymer's molecular mass distribution (MMD), we sample representative chains from the Schulz-Zimm distribution and construct representative sets of large graphs encoding chain-scale topology directly, with atoms and bonds featurized using rich chemical descriptors. We further pretrain GNN encoders via masked graph modeling on 100,000 unlabeled PSMILES strings before fine-tuning on labeled data. On a dataset of 381 polymers (180 homopolymers and 201 copolymers), we show that graph construction and self-supervised pretraining are jointly necessary: without pretraining, the large graph method matches the repeat-unit baseline (28.40 K vs. 28.36 K RMSE); with pretraining, it achieves 24.76 K +/- 3.30 K, a 5.1% reduction in mean error over the pretrained repeat-unit baseline (26.08 K +/- 4.20 K, p < 0.001, 30 runs). An ablation removing chemical features degrades performance to 36.65 K, confirming both components are essential. Results are architecture-agnostic, holding for both GINE and GATv2 encoders.
format Preprint
id arxiv_https___arxiv_org_abs_2605_10551
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle It's All Connected: Topology-Aware Structural Graph Encoding Improves Performance on Polymer Prediction
Erdogan, H. Ibrahim
Raviswamy, Punith
Agrawal, Nikita
Köster, Yannik
Zechel, Stefan
Schubert, Ulrich S.
Mayer, Ruben
Kuenneth, Christopher
Machine Learning
I.2.6; J.2
Graph Neural Networks (GNNs) have achieved strong results in molecular property prediction, but polymers present distinct challenges: labeled datasets are scarce and small (typically in the order of hundreds of polymers) due to the need for expensive experimentation, and complex polymer chain distributions influence polymer properties. Established practice in polymer prediction represents polymers solely by graphs of their repeat units, discarding the chain-scale morphology that governs key properties such as the glass transition temperature ($T_g$). In this work, we propose a principled graph construction that addresses this gap. Given a polymer's molecular mass distribution (MMD), we sample representative chains from the Schulz-Zimm distribution and construct representative sets of large graphs encoding chain-scale topology directly, with atoms and bonds featurized using rich chemical descriptors. We further pretrain GNN encoders via masked graph modeling on 100,000 unlabeled PSMILES strings before fine-tuning on labeled data. On a dataset of 381 polymers (180 homopolymers and 201 copolymers), we show that graph construction and self-supervised pretraining are jointly necessary: without pretraining, the large graph method matches the repeat-unit baseline (28.40 K vs. 28.36 K RMSE); with pretraining, it achieves 24.76 K +/- 3.30 K, a 5.1% reduction in mean error over the pretrained repeat-unit baseline (26.08 K +/- 4.20 K, p < 0.001, 30 runs). An ablation removing chemical features degrades performance to 36.65 K, confirming both components are essential. Results are architecture-agnostic, holding for both GINE and GATv2 encoders.
title It's All Connected: Topology-Aware Structural Graph Encoding Improves Performance on Polymer Prediction
topic Machine Learning
I.2.6; J.2
url https://arxiv.org/abs/2605.10551