REVIEW 2 cited by
Convex optimization and contour deformations
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
read the original abstract
We discuss various formal aspects of contour deformations used to alleviate sign problems; most importantly, relating these contour deformations to a certain convex optimization problem. As a consequence of this connection we describe a general method for proving upper bounds on the average phase achievable by the contour deformation method. Using this method we show that Abelian lattice Yang-Mills in two spacetime dimensions possesses, for many values of the complex coupling, an exponential sign problem that cannot be removed via any contour deformation.
Forward citations
Cited by 2 Pith papers
-
Path optimization method for the sign problem caused by fermion determinant
Path optimization with machine learning reproduces analytic results in the 1D lattice Thirring model, and dropping the Jacobian from the learning step still works.
-
Machine-learning approaches to accelerating lattice simulations
A review of unbiased machine-learning acceleration methods for lattice field theory, covering flow-based sampling, contour deformations, control variates, and surrogate observables.
Discussion (0). Continue with ORCID to comment.