Pith. sign in

REVIEW 2 cited by

Gold-standard solutions to the Schr\"odinger equation using deep learning: How much physics do we need?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09438 v3 pith:HIB4HNL6 submitted 2022-05-19 cs.LG physics.chem-phphysics.comp-ph

classification cs.LGphysics.chem-phphysics.comp-ph
keywords accuratecomputationalaccuracyarchitecturecostdeepenergiesequation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Finding accurate solutions to the Schr\"odinger equation is the key unsolved challenge of computational chemistry. Given its importance for the development of new chemical compounds, decades of research have been dedicated to this problem, but due to the large dimensionality even the best available methods do not yet reach the desired accuracy. Recently the combination of deep learning with Monte Carlo methods has emerged as a promising way to obtain highly accurate energies and moderate scaling of computational cost. In this paper we significantly contribute towards this goal by introducing a novel deep-learning architecture that achieves 40-70% lower energy error at 6x lower computational cost compared to previous approaches. Using our method we establish a new benchmark by calculating the most accurate variational ground state energies ever published for a number of different atoms and molecules. We systematically break down and measure our improvements, focusing in particular on the effect of increasing physical prior knowledge. We surprisingly find that increasing the prior knowledge given to the architecture can actually decrease accuracy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 6 citations worldwide. Full citation record

  1. Is Variational Monte Carlo Robust? Sharp Moment Thresholds and Heavy-tailed Stochastic Optimization

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    VMC's gradient estimators are generically heavy-tailed (no 3/2 moment for Slater–Jastrow); PS-Clip-VMC, which clips energies and per-sample gradients, is provably convergent under weak moments and stabilizes FermiNet ...

  2. Computational Math with Neural Networks is Hard

    math.NA 2025-05 conditional novelty 7.0 of 10

    Under SETH, approximating integrals, Poisson solutions, or matrix-vector products for neural network inputs requires runtime at least accuracy^{-1+o(1)}.

Pith tools