Certified Neural Ritz Solver
Implementation & benchmark of arXiv:2607.04247 — Guaranteed Lower Eigenvalue Bounds for Spectral Galerkin Methods with Application to Schrödinger Operators
Source paper: Guaranteed Lower Eigenvalue Bounds for Spectral Galerkin Methods with Application to Schrödinger Operators arXiv:2607.04247 ⓘ · analyzed Aug 29, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Parameterize candidate eigenfunctions with a neural network, project them into a finite spectral trial space, and compute Ritz eigenvalues from the resulting Galerkin matrices. Train against the paper's rigorous lower-bound transform rather than trusting the raw Ritz values, producing a certificate that the predicted eigenvalues do not underestimate the exact eigenvalues under the projection-error assumptions.
Formulas
Mathematical statement
For the generalized eigenproblem a(u,v)=lambda b(u,v), let a and b be symmetric bilinear forms on a Hilbert space, with b positive definite, and let V_h be the neural or spectral trial space. The Ritz projection P_h is defined by a(P_h v,w)=a(v,w) for every w in V_h. If the explicit projection estimate ||(I-P_h)v||_b <= C_h ||(I-P_h)v||_a holds for the relevant v, where ||v||_a=sqrt(a(v,v)) and ||v||_b=sqrt(b(v,v)), then the paper's unconditional lower bound is lambda_k >= lambda_{k,h}/(1+C_h^2 lambda_{k,h}). Here lambda_k is the exact kth eigenvalue and lambda_{k,h} is the kth eigenvalue of the Galerkin/Ritz matrix restricted to V_h. For a trial space consisting of the first M exact eigenfunctions, the optimal constant is C_N=lambda_{M+1}^{-1/2}, with lambda_{M+1} the first omitted exact eigenvalue. In a neural implementation, the theorem's assumptions are enforced or approximated by choosing a known spectral basis and using the network only to generate coefficients or corrections inside that basis; C_h is then computed analytically when the omitted spectrum is known, or conservatively estimated.
Implementation notes
Integrate this as a differentiable spectral-eigensolver head for a neural PDE model, not as a generic classifier loss. Choose a self-adjoint operator such as -Delta+V on a bounded domain and a known basis {phi_j}_{j=1}^M satisfying the boundary conditions. Let the MLP receive the potential V, geometry parameters, or a problem instance and output M candidate coefficient vectors c_1,...,c_K. Form the candidate functions u_k=sum_j c_{k,j} phi_j. Compute the stiffness and mass matrices by quadrature, A_{ij}=a(phi_i,phi_j) and B_{ij}=b(phi_i,phi_j), or use the network outputs directly to assemble a compressed K-dimensional pair A_c=C^TAC and B_c=C^TBC, where C=[c_1,...,c_K]. Solve A_c q=lambda B_c q, orthogonalizing with respect to B_c; these are the neural Ritz values lambda_{k,h}. For each k compute the certified target lambda_cert[k]=lambda_h[k]/(1+C_h^2*lambda_h[k]) and optimize an ordering-aware loss such as sum_k(lambda_cert[k]-target_k)^2 plus eigenvector residuals ||A_c q_k-lambda_h[k]B_c q_k||^2 and B-orthogonality penalties. The paper's mathematics supplies the projection inequality and the lower-bound transform. For a Fourier or Laplacian eigenbasis, set C_h=lambda_{M+1}^{-1/2}; otherwise estimate a conservative C_h from a validated approximation-space bound or deliberately use an inflated value alpha*C_est with alpha>1. Do not backpropagate through an uncertified estimate while claiming a certificate. First test on 1D and 2D Schrödinger operators with analytic Laplacian spectra, comparing a neural Ritz solver trained with raw eigenvalue loss against the certified loss at identical basis size and FLOPs. Measure actual eigenvalue error, violation rate of lambda_cert<=lambda_exact, residual norms, and the number of basis modes needed to reach a fixed accuracy. Success means zero lower-bound violations and comparable or improved eigenvalue accuracy, with the certificate remaining useful under distribution shift in V.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.