Related papers: Reweighting Lefschetz Thimbles
We develop a way of improving complex Langevin dynamics motivated by the Lefschetz-thimble decomposition of integrals. In our method, arbitrary observables of an original model with multiple Lefschetz thimbles are computed by a modified…
Lefschetz thimbles have been proposed recently as a possible solution to the complex action problem (sign problem) in Monte Carlo simulations. Here we discuss pure abelian gauge theory with a complex coupling $\beta$ and apply the concept…
The complex Langevin (CL) method shows significant potential in addressing the numerical sign problem. Nonetheless, it often produces incorrect results when used without any stabilization techniques. Leveraging insights from previous…
Complex Langevin (CL) is a computational method to circumvent the numerical sign problem with applications in finite-density quantum chromodynamics and the real-time dynamics of quantum field theories. It has long been known that, depending…
The complexification of field variables is an elegant approach to attack the sign problem. In one approach one integrates on Lefschetz thimbles: over them, the imaginary part of the action stays constant and can be factored out of the…
Lefschetz thimbles and complex Langevin dynamics both provide a means to tackle the numerical sign problem prevalent in theories with a complex weight in the partition function, e.g. due to nonzero chemical potential. Here we collect some…
The Picard-Lefschetz theory has been attracting much attention as a tool to evaluate a multi-variable integral with a complex weight, which appears in various important problems in theoretical physics. The idea is to deform the integration…
We show that complex Langevin simulation converges to a wrong result, by relating it to the Lefschetz-thimble path integral, when the path-integral weight has different phases among dominant complex saddle points. Equilibrium solution of…
Recently there has been remarkable progress in solving the sign problem, which occurs in investigating statistical systems with a complex weight. The two promising methods, the complex Langevin method and the Lefschetz thimble method, share…
The QCD at finite density is not well understood yet, where standard Monte Carlo simulation suffers from the sign problem. In order to overcome the sign problem, the method of Lefschetz thimble has been explored. Basically, the original…
We consider a hybrid Monte Carlo algorithm which is applicable to lattice theories defined on Lefschetz thimbles. In the algorithm, any point (field configuration) on a thimble is parametrized uniquely by the flow-direction and the…
The complex Langevin method and the generalized Lefschetz-thimble method are two closely related approaches to the sign problem, which are both based on complexification of the original dynamical variables. The former can be viewed as a…
The numerical sign problem has long been a major obstacle to first-principles calculations in various important fields of physics. We report that the recently proposed algorithm, tempered Lefschetz thimble method (TLTM), and its worldvolume…
Recent progress of the complex Langevin method and the Lefschetz thimble in connection with the sign problem is reviewed. These methods rely on the complexification of the original field manifold and they allow direct simulations of…
The Lefschetz thimble method, i.e., the integration along the steepest descent cycles, is an idea to evade the sign problem by complexifying the theory. We discuss that such steepest descent cycles can be identified as ground-state…
A simple reweighting scheme is proposed for Monte Carlo simulations of interacting particle systems, permitting one to study various parameter values in a single study, and improving efficiency by an order of magnitude. Unlike earlier…
The worldvolume tempered Lefschetz thimble method (WV-TLTM) is an algorithm towards solving the sign problem, where hybrid Monte Carlo updates are performed on a continuous accumulation of flowed surfaces foliated by the anti-holomorphic…
The computational cost of solving an inverse problem governed by PDEs, using multiple experiments, increases linearly with the number of experiments. A recently proposed method to decrease this cost uses only a small number of random linear…
l1 reweighting algorithms are very popular in sparse signal recovery and compressed sensing, since in the practice they have been observed to outperform classical l1 methods. Nevertheless, the theoretical analysis of their convergence is a…
We present a generalized formulation for reweighted least squares approximations. The goal of this article is twofold: firstly, to prove that the solution of such problem can be expressed as a convex combination of certain interpolants when…