GFFMERGE: Efficient Merging of Graph Neural Force Fields and Beyond

πŸ“… 2026-06-02
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF

career value

207K/year
πŸ€– AI Summary
Existing graph neural network (GNN)-based force field models require costly retraining when transferred to new chemical systems and lack efficient training-free fusion strategies. This work proposes the first closed-form model fusion framework tailored for GNNs, which formulates model combination as a convex embedding alignment problem by exploiting the linear structure of message-passing layers, thereby enabling highly efficient, fine-tuning-free integration. The approach overcomes the limitations of conventional fusion methods from vision and language domains when applied to force field regression tasks and facilitates modular composition of specialized models. Experiments demonstrate that the proposed framework achieves 5–27Γ— acceleration across molecular, solid-state, and large-scale graph datasets, with fused performance approaching that of the joint-training gold standard and significantly outperforming all training-free baselines.
πŸ“ Abstract
Graph Neural Networks (GNNs) have revolutionized Neural Force Fields for atomistic simulations, achieving near-quantum accuracy at reduced cost, yet adapting these models to new chemical systems requires expensive retraining of foundation models. Inspired by model merging in vision and language processing, we introduce GFFMERGE, the first principled framework for closed-form model merging in GNNs. We exploit the linear structure of message-passing layers and formulate merging as a convex embedding-alignment problem with an analytical solution. Through the first systematic benchmarking of model merging for GNNs, we show that existing methods designed for vision and language catastrophically fail on force field regression, while GFFMERGE recovers performance approaching gold standard joint training. Across molecular (MD17, MD22), solid-state (LiPS20), and large-scale graph benchmarks, GFFMERGE and GNNMERGE (its generic GNN counterpart) achieve 5-27$\times$ speedups while enabling modular composition of specialized models. Remarkably, our closed-form solution alone outperforms all baseline methods before fine-tuning and provides superior initialization for faster, data-efficient convergence.
Problem

Research questions and friction points this paper is trying to address.

Graph Neural Networks
Neural Force Fields
Model Merging
Atomistic Simulations
Chemical Systems
Innovation

Methods, ideas, or system contributions that make the work stand out.

Graph Neural Networks
Model Merging
Neural Force Fields
Closed-form Solution
Message Passing
πŸ”Ž Similar Papers
No similar papers found.
P
Parth Verma
Department of Computer Science, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India
P
Parv P. Singh
Yardi School of Artificial Intelligence, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India
V
Vipul Garg
Department of Computer Science, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India
I
Ishita Thakre
Department of Computer Science, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India
N. M. Anoop Krishnan
N. M. Anoop Krishnan
Associate Professor, Indian Institute of Technology Delhi
AI for MaterialsAI4ScienceMachine LearningAtomistic ModelingGlass
Sayan Ranu
Sayan Ranu
IIT Delhi
Machine learning for graphs