2018
DOI: 10.1093/ptep/ptx191
|View full text |Cite
|
Sign up to set email alerts
|

Application of a neural network to the sign problem via the path optimization method

Abstract: We introduce the feedforward neural network to attack the sign problem via the path optimization method. The variables of integration is complexified and the integration path is optimized in the complexified space by minimizing the cost function which reflects the seriousness of the sign problem. For the preparation and optimization of the integral path in multi-dimensional systems, we utilize the feedforward neural network. We examine the validity and usefulness of the method in the two-dimensional complex λφ… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
47
0
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 74 publications
(48 citation statements)
references
References 41 publications
0
47
0
1
Order By: Relevance
“…Here, we use the analytic continuation from the real to imaginary chemical potentials. The RW periodicity is induced by the factor cos(N c θ) in Equation (8); this factor comes from the baryonic fugacity;…”
Section: Rw Periodicity In the Confined Phasementioning
confidence: 99%
See 1 more Smart Citation
“…Here, we use the analytic continuation from the real to imaginary chemical potentials. The RW periodicity is induced by the factor cos(N c θ) in Equation (8); this factor comes from the baryonic fugacity;…”
Section: Rw Periodicity In the Confined Phasementioning
confidence: 99%
“…[1] as an example, but the applicable regions are still limited in µ R /T < 1. It should be noted that there are some attempts to overcome the limitation: famous methods are the complex Langevin method [2,3], the Lefschetz thimble method [4][5][6], the path optimization method [7,8] and so on. However, these methods still have serious problems.…”
Section: Introductionmentioning
confidence: 99%
“…Note: While this work was prepared the papers [24][25][26] appeared, in which some similar ideas were presented. Our approach shares with [26] the low computational complexity and the ability to use a relatively small number of parameters, while generalising the ansatz for the contour in a way that enables taking into account the interaction between nearby lattice points.…”
Section: Localitymentioning
confidence: 99%
“…Recent contributions in the field more generally involve complex manifolds close to Lefschetz thimbles that are optimized such that they ameliorate the sign problem, see e.g. [27][28][29][30].…”
Section: Introductionmentioning
confidence: 99%