Optimizing the Optimizer: Language Models Discover Faster Molecular Relaxation

Artem Tsypin, Vladimir Deshchenya, Kuzma Khrabrov, Denis Potapov, Maxim Radchenko, Artur Kadurin, Michael G. Medvedev

AXXX · ITMO University · N. D. Zelinsky Institute of Organic Chemistry of Russian Academy of Sciences

Published October 5, 2026 · on the feed October 6, 2026 · ▲ 24 · arXiv 2610.06577

Science & medicineTheory & statistics Code arXiv ↗Hugging Face ↗

The abstract

Geometry optimization is a major cost in many quantum-chemical workflows: each optimization step requires one force evaluation, and at the density-functional level that evaluation dominates the wall time. Research in this area has produced a broad range of optimization methods, and we ask whether a language model can improve on the best of them through autoresearch. An agent rewrites the optimizer itself to minimize force-call counts, restrained by two admission gates that reject premature stopping and improvements that do not generalize to unseen molecules. Starting from Sella, the fastest open-source optimizer available, the search produces AutoSella, a family of two optimizers. Both of them deliver consistent force-call reductions relative to Sella across held-out molecular benchmarks and potentials not used during the search. Most notably, at the r2SCAN-3c DFT level, the best variant requires only 40.2--77.2% of Sella's force calls while achieving the same energy reduction, even though agent used no DFT gradients.

The Brief

2:01

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Optimizing the Optimizer. Language Models Discover Faster Molecular Relaxation. By Artem Tsypin and six others, from AXXX, ITMO University, and one other institution. Published on the fifth of October. Its code repository is public and real: about twenty-five source files.

Geometry optimization is a major cost in many quantum-chemical workflows. Every optimization step needs one force evaluation, and at the density-functional level that evaluation dominates the wall time. Count the force calls and you have, near enough, counted the bill. Research in this area has already produced a broad range of optimization methods, so the question is a pointed one: can a language model improve on the best of them, through autoresearch?

The move is to put the optimizer itself up for revision. An agent rewrites the optimizer's code with a single objective, fewer force calls, and two admission gates restrain what it is allowed to keep. One gate rejects premature stopping, a saving that comes from quitting early rather than converging faster. The other rejects improvements that do not generalize to unseen molecules.

The search starts from Sella, described as the fastest open-source optimizer available. What comes out is AutoSella, a family of two optimizers. One detail shapes how the results should be heard: the agent used no DFT gradients during the search, so it never touched the expensive level of theory on which the headline is measured.

Both AutoSella variants deliver consistent force-call reductions relative to Sella, on held-out molecular benchmarks and on potentials that were not used during the search. The most notable result is at the r2SCAN-3c DFT level. There the best variant needs only forty point two to seventy-seven point two percent of Sella's force calls, while achieving the same energy reduction.

Put plainly, a language model started from the fastest open-source baseline and wrote an optimizer that reaches the same energy with fewer of the most expensive steps. The gates are what make that believable: they keep the agent from gaming its own metric, and the held-out tests show the savings travel.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.