Generalization Error Estimates of Machine Learning Methods for Solving High Dimensional Schrödinger Eigenvalue Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914922443571200 |
|---|---|
| author | Yu, Hao Guo, Yixiao Ming, Pingbing |
| author_facet | Yu, Hao Guo, Yixiao Ming, Pingbing |
| contents | We propose a machine learning method for computing eigenvalues and eigenfunctions of the Schrödinger operator on a $d$-dimensional hypercube with Dirichlet boundary conditions. The cut-off function technique is employed to construct trial functions that precisely satisfy the homogeneous boundary conditions. This approach eliminates the error caused by the standard boundary penalty method, improves the overall accuracy of the method, as demonstrated by the typical numerical examples. Under the assumption that the eigenfunctions belong to a spectral Barron space, we derive an explicit convergence rate of the generalization error of the proposed method, which does not suffer from the curse of dimensionality. We verify the assumption by proving a new regularity shift result for the eigenfunctions when the potential function belongs to an appropriate spectral Barron space. Moreover, we extend the generalization error bound to the normalized penalty method, which is widely used in practice. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_13511 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Generalization Error Estimates of Machine Learning Methods for Solving High Dimensional Schrödinger Eigenvalue Problems Yu, Hao Guo, Yixiao Ming, Pingbing Numerical Analysis We propose a machine learning method for computing eigenvalues and eigenfunctions of the Schrödinger operator on a $d$-dimensional hypercube with Dirichlet boundary conditions. The cut-off function technique is employed to construct trial functions that precisely satisfy the homogeneous boundary conditions. This approach eliminates the error caused by the standard boundary penalty method, improves the overall accuracy of the method, as demonstrated by the typical numerical examples. Under the assumption that the eigenfunctions belong to a spectral Barron space, we derive an explicit convergence rate of the generalization error of the proposed method, which does not suffer from the curse of dimensionality. We verify the assumption by proving a new regularity shift result for the eigenfunctions when the potential function belongs to an appropriate spectral Barron space. Moreover, we extend the generalization error bound to the normalized penalty method, which is widely used in practice. |
| title | Generalization Error Estimates of Machine Learning Methods for Solving High Dimensional Schrödinger Eigenvalue Problems |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2408.13511 |