Learning Repetition-Invariant Representations for Polymer Informatics
Not on the map. Why?
Abstract (arXiv)
Polymers are large macromolecules composed of repeating structural units known as monomers and are widely applied in fields such as energy storage, construction, medicine, and aerospace. However, existing graph neural network methods, though effective for small molecules, only model the single unit of polymers and fail to produce consistent vector representations for the true polymer structure with varying numbers of units. To address this challenge, we introduce Graph Repetition Invariance (GRIN), a novel method to learn polymer representations that are invariant to the number of repeating units in their graph representations. GRIN integrates a graph-based maximum spanning tree alignment with repeat-unit augmentation to ensure structural consistency. We provide theoretical guarantees for repetition-invariance from both model and data perspectives, demonstrating that three repeating units are the minimal augmentation required for optimal invariant representation learning. GRIN outperforms state-of-the-art baselines on both homopolymer and copolymer benchmarks, learning stable, repetition-invariant representations that generalize effectively to polymer chains of unseen sizes.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 39 references that are in the map. First posted on arXiv 15 May 2025.
Builds on
26 of 39 references.
References · 26
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2019Invariant Risk Minimizationcited by 1,854
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
- 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2022Discovering Invariant Rationales for Graph Neural Networkscited by 188
- 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
- 2019What Can Neural Networks Reason About?cited by 159
14 more
- 2019Relational Pooling for Graph Representationscited by 150
- 2021Geometric Deep Learning on Molecular Representationscited by 113
- 2022The CLRS Algorithmic Reasoning Benchmarkcited by 106
- 2021Neural Algorithmic Reasoningcited by 94
- 2021Few-Shot Graph Learning for Molecular Property Predictioncited by 81
- 2022Graph Rationalization with Environment-based Augmentationscited by 70
- 2022Graph Neural Networks are Dynamic Programmerscited by 55
- 2022Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunitiescited by 52
- 2024Graph Diffusion Transformers for Multi-Conditional Molecular Generationcited by 45
- 2023Does Invariant Graph Learning via Environment Augmentation Learn Invariance?cited by 42
- 2022SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networkscited by 37
- 2022A graph representation of molecular ensembles for polymer property predictioncited by 20
- 2023Neural Algorithmic Reasoning for Combinatorial Optimisationcited by 19
- 2024Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learningcited by 7
Built on by
Not cited yet.