Lune

ICML2026Top-tier venue

GFFMERGE: Efficient Merging of Graph Neural Force Fields and Beyond

Parth Verma, Parv P Singh, Vipul Garg, Ishita Thakre, N M Anoop Krishnan, Sayan Ranu

2026Year

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 GNN force fields, and GNNs in general. 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 GNN force fields, 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), solidstate (LiPS20), and large-scale graph benchmarks, GFFMERGE and GNNMERGE (its generic GNN counterpart) achieve 5-27× speedups while enabling modular composition of specialized models. Remarkably, our closed-form solution alone outperforms all baseline methods before finetuning and provides superior initialization for faster, data-efficient convergence.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

lune papers fulltext 74baee4d-9ae9-4513-8078-bd4bad451186

Builds on22

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines