Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.12162 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913100472516608 |
|---|---|
| author | Javaid, Muhammad bin Hussain, Hasham Khanna, Ashima Kisin, Berke Pirnay, Jonathan Mitsos, Alexander Grimm, Dominik G. Grohe, Martin |
| author_facet | Javaid, Muhammad bin Hussain, Hasham Khanna, Ashima Kisin, Berke Pirnay, Jonathan Mitsos, Alexander Grimm, Dominik G. Grohe, Martin |
| contents | In structurally constrained molecular optimization, state-of-the-art methods restart an expensive oracle-driven search from scratch for every new input structure, scaling poorly to settings with many starting structures or expensive oracles. While amortized approaches that learn a transferable policy could in principle remove this bottleneck, existing methods struggle to generalize to diverse structural constraints at inference time. We present AMORTIX, an amortized Graph Transformer model that natively supports such constraints, optimizing molecular structures in a single forward pass with zero inference-time oracle calls. A central challenge for amortized training in this domain is that optimization difficulty varies drastically across starting structures. We show that, under this heterogeneity, standard reinforcement learning methods fail to stabilize training, and address this by normalizing rewards within groups of completions sharing the same starting structure. We evaluate on structurally constrained single- and multi-target kinase inhibitor design, and on a few-shot prodrug case study. AMORTIX outperforms both amortized and instance-optimization baselines on goal-directed scaffold decoration and ranks first among amortized methods on the PMO benchmark; the prodrug case study further demonstrates transfer of a learned modification rule to unseen drug structures. Code is available at https://github.com/Hash-hh/AMORTIX/. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_12162 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Amortized Molecular Optimization via Group Relative Policy Optimization Javaid, Muhammad bin Hussain, Hasham Khanna, Ashima Kisin, Berke Pirnay, Jonathan Mitsos, Alexander Grimm, Dominik G. Grohe, Martin Machine Learning I.2.6; I.2.1 In structurally constrained molecular optimization, state-of-the-art methods restart an expensive oracle-driven search from scratch for every new input structure, scaling poorly to settings with many starting structures or expensive oracles. While amortized approaches that learn a transferable policy could in principle remove this bottleneck, existing methods struggle to generalize to diverse structural constraints at inference time. We present AMORTIX, an amortized Graph Transformer model that natively supports such constraints, optimizing molecular structures in a single forward pass with zero inference-time oracle calls. A central challenge for amortized training in this domain is that optimization difficulty varies drastically across starting structures. We show that, under this heterogeneity, standard reinforcement learning methods fail to stabilize training, and address this by normalizing rewards within groups of completions sharing the same starting structure. We evaluate on structurally constrained single- and multi-target kinase inhibitor design, and on a few-shot prodrug case study. AMORTIX outperforms both amortized and instance-optimization baselines on goal-directed scaffold decoration and ranks first among amortized methods on the PMO benchmark; the prodrug case study further demonstrates transfer of a learned modification rule to unseen drug structures. Code is available at https://github.com/Hash-hh/AMORTIX/. |
| title | Amortized Molecular Optimization via Group Relative Policy Optimization |
| topic | Machine Learning I.2.6; I.2.1 |
| url | https://arxiv.org/abs/2602.12162 |