- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper tries to make neural eigenfunction solvers (SpIN, NeuralEF and NeuralSVD) cheaper and more accurate in more than one dimension. These methods learn eigenfunctions by optimizing objectives full of integrals, estimated with random mini-batches, which get noisy unless the batch is very large. The authors write each eigenfunction as a sum of products of 1D networks, so every high-dimensional integral splits into a few 1D integrals. Sampling a few hundred points per axis then acts like a full grid, and the cost grows linearly with dimension instead of exponentially. They also approximate the Coulomb potential with a sum of Gaussians to keep it separable. Tests cover the 2D infinite well, harmonic oscillator, 2D and 3D hydrogen, kernel SVD up to 5D and a 2D NTK.
Critical strengths
- The method is simple and general because the same trick plugs into all three existing methods.
- The performance gains are consistent. Errors are lower on every benchmark, especially for excited states, and the learned eigenfunctions look much closer to the true ones. The scaling is pretty good. Memory and speed stay almost flat as dimension grows, while the original NeuralSVD runs out of memory.
Critical weaknesses
- The variance argument only covers part of the objective. The paper's own analysis shows TPQ behaves like a batch only when the 1D factors average close to zero, as for cross-terms between different eigenfunctions. The norms and Rayleigh quotients that set the eigenvalues have positive integrands, and there the same formula gives an error closer to an ordinary batch. So the gains may come mostly from the separable network design rather than the quadrature.
- It depends on the coordinate axes. Separability is defined along the Cartesian axes, so rotating the same problem can make it much harder. Most benchmarks are product functions aligned with the axes, and the kernel test is built exactly that way. Hydrogen is the only real non-separable case, and only up to 3D. Also, the physics extension is limited. The Gaussian trick works for one fixed nucleus but not for electron–electron repulsion, which couples coordinates of two particles. The many-body example only works because its coupling is quadratic. Boundary masks also restrict the method to box-shaped domains.
Questions for authors
- At the same number of network evaluations, how accurate is TPQ on the norm and Rayleigh-quotient terms compared with ordinary sampling?
- What happens if you rotate a benchmark such as the harmonic oscillator by 45°, and how much higher does the rank need to be?
- How would TPQ handle pairwise Coulomb interactions between electrons?
- Does SpIN-TPQ still recover eigenfunctions in the correct order, especially within degenerate levels?
- Could you add results over several seeds for the main experiments?
7 comments
Response To Reviewer 9Sxi
W2: It depends on the coordinate axes. Separability is defined along the Cartesian axes, so rotating the same problem can make it much harder. Most benchmarks are product functions aligned with the axes, and the kernel test is built exactly that way. Hydrogen is the only real non-separable case, and only up to 3D. Also, the physics extension is limited. The Gaussian trick works for one fixed nucleus but not for electron–electron repulsion, which couples coordinates of two particles. The many-body example only works because its coupling is quadratic. Boundary masks also restrict the method to box-shaped domains.
Response: Thank you for this comment. We agree that the efficiency of TPQ depends on the coordinate system and the separability of the operator. To address these concerns, we have added two experiments: a 45° coordinate rotation experiment and a 6D two-electron Schrödinger experiment with Coulomb interaction.
(1) Sensitivity to coordinate rotation. We added a 45° rotation experiment using a 2D anisotropic harmonic oscillator (Section I in the revised manuscript). Unlike the isotropic oscillator, the rotated potential contains a cross-coordinate term , making the eigenfunctions non-separable in the original Cartesian coordinates. We trained NeuralEF-TPQ with CP ranks for both 0° and 45°, using the same random seed and 20,000 training iterations. Table 8 of the revised manuscript reports the energy errors for the first 22 outputs:
| CP rank | 0° energy error | 45° energy error |
|---|---|---|
| 17 | 0.017818 | 0.021846 |
| 21 | 0.015718 | 0.020992 |
| 25 | 0.015806 | 0.020370 |
| 29 | 0.015596 | 0.015937 |
| 33 | 0.015308 | 0.015589 |
The rotation increases the error at smaller ranks. However, increasing the rank to reduces the rotated error to 0.015937, close to the unrotated error of 0.015596. At , the errors are also comparable (0.015589 versus 0.015308). Furthermore, Fig. 10 of the revised manuscript shows that the learned eigenfunctions reproduce the rotated spatial structures. These results indicate that moderately increasing the CP rank can compensate for the additional coordinate coupling in this example.
(2) Extension to electron–electron Coulomb interactions. To address the limitation of the previous quadratic-coupling example, we added a 6D two-electron Schrödinger experiment with the non-quadratic Coulomb interaction (Section L.1 in the revised manuscript). The experiment considers two same-spin electrons in a 3D harmonic trap (resulting in a 6D problem) and learns the lowest 12 antisymmetric states. We extend the Gaussian-mixture approximation to the electron–electron interaction using Gaussian terms. Each Gaussian term is factorized across the three spatial directions, and the coupled coordinates of the two electrons are integrated through three 2D coordinate-pair quadratures, avoiding the full 6D tensor grid. We compare NeuralEF-TPQ () with a NeuralEF-variational Monte Carlo (NeuralEF-VMC) baseline. Both methods optimize the NeuralEF objective for 10,000 iterations with comparable training iterations per second. Table 11 of the revised manuscript reports the physical energies and relative eigenvalue errors, and we paste partial results here:
| Relative eigenvalue error (12 modes) | NeuralEF-TPQ | NeuralEF-VMC |
|---|---|---|
| Mean | 3.4807×10⁻⁴ | 9.3301×10⁻² |
| Maximum | 8.0194×10⁻⁴ | 2.2897×10⁻¹ |
NeuralEF-TPQ achieves lower relative eigenvalue errors. Additionally, Fig. 12 of the revised manuscript presents the energy convergence curves for all 12 states, while Fig. 13 compares the learned eigenfunction slices against the references. These results demonstrate that our extended TPQ approach can handle pairwise Coulomb interactions in this 6D system, beyond the previously studied quadratic interactions.
Moreover, the current separable boundary masks are naturally suited to box-shaped domains. More general geometries would require additional treatments that preserve or approximate separability such as coordinate transformation, and we view this as an interesting future direction.
Response To Reviewer 9Sxi
Q1: At the same number of network evaluations, how accurate is TPQ on the norm and Rayleigh-quotient terms compared with ordinary sampling?
Response: Thank you for this question. To compare the integration accuracy of norm and Rayleigh-quotient terms, we added an experiment using the same frozen CP network trained on 2D hydrogen, comparing TPQ with ordinary MC at matched network evaluation budgets. Each setting is repeated 100 times. Table 9 of the revised manuscript reports the mean absolute relative integration errors against deterministic reference integrals of the frozen network:
| Network evaluations | TPQ norm error (%) | MC norm error (%) | TPQ RQ error (%) | MC RQ error (%) |
|---|---|---|---|---|
| 192 | 20.629 | 34.632 | 10.256 | 10.786 |
| 384 | 13.694 | 27.733 | 3.767 | 7.828 |
| 768 | 10.045 | 20.156 | 3.136 | 5.066 |
| 1,536 | 7.492 | 15.599 | 2.491 | 4.861 |
| 3,072 | 5.646 | 10.087 | 2.228 | 5.584 |
| 6,144 | 3.798 | 8.087 | 1.178 | 3.634 |
TPQ achieves lower errors for both the squared norm and Rayleigh quotient at all six evaluation budgets. For example, at 6,144 evaluations, TPQ reduces the norm error from 8.087% to 3.798% and the RQ error from 3.634% to 1.178%. These results show that TPQ can improve the integration accuracy of both terms at the same network evaluation budget.
Q2: What happens if you rotate a benchmark such as the harmonic oscillator by 45 degrees, and how much higher does the rank need to be?
Response: Thank you for this question. We added a 45° rotation experiment using a 2D anisotropic harmonic oscillator (Section I in the revised manuscript). We trained NeuralEF-TPQ with CP ranks for both the unrotated case (0°) and the rotated case (45°), using the same random seed and 20,000 training iterations. Table 8 of the revised manuscript reports the energy errors for the first 22 outputs:
| CP rank | 0° energy error | 45° energy error |
|---|---|---|
| 17 | 0.017818 | 0.021846 |
| 21 | 0.015718 | 0.020992 |
| 25 | 0.015806 | 0.020370 |
| 29 | 0.015596 | 0.015937 |
| 33 | 0.015308 | 0.015589 |
The rotation increases the error at smaller ranks. However, increasing the rank to reduces the rotated error to 0.015937 for 45°, close to the unrotated error of 0.015596. At , the two errors are also very similar (0.015589 versus 0.015308). Therefore, the rotated benchmark requires only a moderate increase in CP rank to recover accuracy comparable to the axis-aligned case. In addition, Fig. 10 of the revised manuscript shows that the learned eigenfunctions reproduce the rotated spatial structures well. These results indicate that TPQ remains effective under coordinate rotation.
Response To Reviewer 9Sxi
Response To Reviewer 9Sxi
We sincerely thank the reviewer for the thoughtful comments and questions. We have expanded the analysis and clarified the limitations and applicability of our method. The revised part is highlighted in blue in the uploaded revised manuscript. Our point-by-point responses are provided below.
Response: Thank you for this comment. We agree that the variance advantage of TPQ depends on the properties of the integrand. We have clarified this limitation in Appendix Section E.6. Additionally, we added two experiments to evaluate the practical contribution of TPQ.
(1) Integration accuracy of norm and Rayleigh-quotient (RQ) terms. To evaluate these terms, we added an experiment using the same frozen CP network trained on 2D hydrogen, comparing TPQ with ordinary Monte Carlo (MC) at matched network evaluation budgets. Each setting is repeated 100 times. Table 9 of the revised manuscript reports the integration errors. We report the results against deterministic reference integrals below. TPQ achieves lower errors for both the squared norm and Rayleigh quotient at all tested budgets.
(2) Ablation separating CP parameterization from TPQ. To isolate the contribution of quadrature, we additionally compare CP-TPQ and CP-MC using the same CP architecture and Gaussian-mixture potential, with comparable training speeds. We compare four settings: (A) CP-TPQ with Gaussian-mixture model (GMM) potential, (B) CP-Monte Carlo (CP-MC) with GMM potential, (C) CP-MC with the original Coulomb potential, and (D) MLP-MC with the original Coulomb potential. All methods are trained for 30,000 iterations over three seeds. The eigenvalue errors are evaluated under the original Coulomb Hamiltonian. The results are reported in Table 4 of the revised manuscript, and we paste partial results here:
Under the same CP architecture and potential approximation (A vs. B), TPQ reduces the mean relative eigenvalue error from 7.62% to 4.53% over the first 9 modes. The difference is more pronounced over 16 modes, where CP-MC fails to recover the highest mode. These additional experiments show that TPQ improves both integration accuracy and spectral learning, with benefits beyond the separable network architecture alone.