Learning Repetition-Invariant Representations for Polymer Informatics

Yihan Zhu, Gang Liu, Eric Inae, Tengfei Luo, Meng Jiang
5/15/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{zhu2025learning,
  title  = {Learning Repetition-Invariant Representations for Polymer Informatics},
  author = {Yihan Zhu and Gang Liu and Eric Inae and Tengfei Luo and Meng Jiang},
  year   = {2025},
  eprint = {2505.10726},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.10726v3},
  journal = {NEURIPS 2025 2025}
}

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/2505.10726.svg)](https://codeofpaper.com/paper/2505.10726)

Discussion