paper-with-me

홈 › Papers

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

2026-05-11 · H. Ibrahim Erdogan, Punith Raviswamy, Nikita Agrawal, Yannik Köster, Stefan Zechel, Ulrich S. Schubert, Ruben Mayer, Christopher Kuenneth arxiv

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.

📄 PDF Abstract BibTeX arXiv:2605.10551

Code (0)

등록된 구현이 없습니다.

Tasks

Molecular Property Prediction

Similar Papers 제목 키워드 기반

Topology-Aware Graph Reinforcement Learning for Dynamic Routing in Cloud Networks

2025-09-05 · Yuxi Wang, Heyao Liu, Guanzi Yao, Nyutian Long 외 arxiv

This paper proposes a topology-aware graph reinforcement learning approach to address the routing policy optimization problem in cloud server environments. The method builds a unified framework for state representation a…

Reinforcement Learning

FairGT: A Fairness-aware Graph Transformer

2024-04-26 · Renqiang Luo, Huafei Huang, Shuo Yu, Xiuzhen Zhang 외

The design of Graph Transformers (GTs) generally neglects considerations for fairness, resulting in biased outcomes against certain sensitive subgroups. Since GTs encode graph information without relying on message-passi…

Fairnessfeature selectionGraph Learning

Trie-Aware Transformers for Generative Recommendation

2026-02-25 · Zhenxiang Xu, Jiawei Chen, Sirui Chen, Yong He 외 arxiv

Generative recommendation (GR) aligns with advances in generative AI by casting next-item prediction as token-level generation rather than score-based ranking. Most GR methods adopt a two-stage pipeline: (i) \textit{item…

Rethinking Graph Convolution for 2D-to-3D Hand Pose Lifting

2026-05-13 · Chanyoung Kim, Donghyun Kim, Dong-Hyun Sim, Seong Jae Hwang 외 arxiv

Graph convolutional networks (GCNs) are widely used for 3D hand pose estimation, where the hand skeleton is encoded as a fixed adjacency graph. We revisit whether this is the most effective way to incorporate hand topolo…

3D Hand Pose Estimation

X-LogSMask: Expand Transformer for Graph-Structured Data

2026-07-02 · Leyan Li, Rennong Yang, Zhenxing Zhang, Liping Hu arxiv

Transformers have become general-purpose architectures, but their all-to-all self-attention is poorly matched to graph data, whose interactions are sparse, structured and multi-scale. Existing Graph Transformers address …