Learning Repetition-Invariant Representations for Polymer Informatics

Gang Liu (Idiap Research Institute) · Yihan Zhu (University of Notre Dame) · Eric Inae (University of Notre Dame) · Tengfei Luo (University of Notre Dame) · Meng Jiang (University of Notre Dame)
augmentation requirementscopolymer benchmarksgeneralizationgraph neural networksgraph repetition invariancehomopolymer benchmarksinvariant representation learningmaximum spanning tree alignmentpolymersrepeat-unit augmentationrepetition-invariancestable representationsstructural consistencytheoretical guaranteesvector representations

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.