AIHugging Face

Heuristic editor, no API keyVerdict: Routine

Optimizing the Optimizer: Language Models Discover Faster Molecular Relaxation

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.

By Tsypin, Deshchenya, Khrabrov +4arXiv

Score█████░░░░░4.6

Key numbers

  • 77.2% of Sella

VerdictCompetent work. Briefs at most.

Read the originalPDFCode

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.

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

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude██░░░ 218%Solid incremental gain on a meaningful problem.
Evidence███░░ 314%Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
Novelty██░░░ 216%A new combination of known ideas.
Trajectory███░░ 318%A clear path to scale.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: breadth (wide range); verification (held-out test, code released); scale (efficient); stakes (general AI).

How the score was computed

rank-2026-09-29

Score█████░░░░░4.6

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
5.1 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.4 / 10
Shrunk toward the desk prior by editor confidence (38%).
Attention
45%
Citations, upvotes, points, mentions.
Freshness
56%
Half-life decay since publication.
  • Hugging Face upvotes17 (reference 25, via hf-daily, Oct 7, 2026, 01:27 UTC)
  • GitHub stars3 (reference 250, via hf-daily, Oct 7, 2026, 01:27 UTC)

The record

  • Reviewed by heuristic-v2 on Oct 6, 2026, 13:49 UTC. Paper type: empirical.
  • BRIEF, No.10 in the Artificial Intelligence edition of October 7, 2026.