Pith. sign in

REVIEW 6 cited by

Functional Neural Wavefunction Optimization

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 2507.10835 v1 pith:ILQ2MFLM submitted 2025-07-14 cond-mat.str-el cs.LGmath.OCphysics.comp-phquant-ph

classification cond-mat.str-elcs.LGmath.OCphysics.comp-phquant-ph
keywords algorithmsframeworkoptimizationneuralspacevariationalaccurateanalysis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a framework for the design and analysis of optimization algorithms in variational quantum Monte Carlo, drawing on geometric insights into the corresponding function space. The framework translates infinite-dimensional optimization dynamics into tractable parameter-space algorithms through a Galerkin projection onto the tangent space of the variational ansatz. This perspective unifies existing methods such as stochastic reconfiguration and Rayleigh-Gauss-Newton, provides connections to classic function-space algorithms, and motivates the derivation of novel algorithms with geometrically principled hyperparameter choices. We validate our framework with numerical experiments demonstrating its practical relevance through the accurate estimation of ground-state energies for several prototypical models in condensed matter physics modeled with neural network wavefunctions.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  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 local energy and gradient estimators are generically heavy-tailed for common ansatze due to nodal sets, but a new clipped variant converges in the low-moment regime.

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

    cs.LG 2026-06 conditional 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 ...

  3. Geometry-Induced Long-Range Correlations in Recurrent Neural Network Quantum States

    quant-ph 2026-04 conditional novelty 7.0 of 10

    Dilated RNN wave functions induce power-law correlations for the critical 1D transverse-field Ising model and the Cluster state, unlike the exponential decay of conventional RNN ansatze.

  4. A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms

    cs.LG 2025-08 conditional novelty 6.0 of 10

    For linear least squares, SNGD and SPRING are proved equivalent to accelerated regularized Kaczmarz methods, yielding the first fast rates and first SPRING guarantee; the general quadratic analysis holds under strong ...

  5. Momentum Stability and Adaptive Control in Stochastic Reconfiguration

    math.OC 2026-04 unverdicted novelty 5.0 of 10

    Convergence holds for momentum μ less than 1 in SPRING under mild assumptions, but μ=1 risks divergence; PRIME-SR adapts momentum via spectral dimension and subspace overlap to match tuned performance with better robustness.

  6. Curvature-Aware Optimization for High-Accuracy Physics-Informed Neural Networks

    cs.LG 2026-04 unverdicted novelty 4.0 of 10

    Curvature-aware optimizers such as natural gradient and self-scaling BFGS/Broyden accelerate PINN convergence and accuracy on PDEs including Helmholtz, Stokes, Burgers, and Euler equations plus stiff ODEs, with new mo...

Pith tools