Related papers: Settling an old story: solution of the Thirring mo…
We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
The quantum Monte Carlo method on asymptotic Lefschetz thimbles is a numerical algorithm devised specifically for alleviation of the sign problem appearing in the simulations of quantum many-body systems. In this method, the sign problem is…
Over-parameterized deep models usually over-fit to a given training distribution, which makes them sensitive to small changes and out-of-distribution samples at inference time, leading to low generalization performance. To this end, several…
I discuss some of the difficulties with formulating chiral symmetry on the lattice and review a recently proposed scheme for a fully finite and exactly gauge invariant lattice regularization of the standard model.
In this paper we investigate an adaptive discretization strategy for ill-posed linear prob- lems combined with a regularization from a class of semiiterative methods. We show that such a discretization approach in combination with a…
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many…
The sign problem is a major obstacle to our understanding of the phase diagram of QCD at finite baryon density. Several numerical methods have been proposed to tackle this problem, but a full solution to the sign problem is still elusive.…
We analyze to what extent the complex Langevin method, which is in principle capable of solving the so-called sign problems, can be considered as reliable. We give a formal derivation of the correctness and then point out various…
Lattice Monte Carlo calculations of interacting systems on non-bipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to…
Mathematically characterizing the implicit regularization induced by gradient-based optimization is a longstanding pursuit in the theory of deep learning. A widespread hope is that a characterization based on minimization of norms may…
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…
We apply constant imaginary offsets to the path integral for a reduction of the sign problem in the Hubbard model. These simple transformations enhance the quality of results from HMC calculations without compromising the speed of the…
The canonical approach, which was developed for solving the sign problem, may suffer from a new type of sign problem. In the canonical approach, the grand partition function is written as a fugacity expansion: $Z_G(\mu,T) = \sum_n Z_C(n,T)…
Semidefinite programs can be constructed to provide a non-perturbative view of the zero-temperature behavior of quantum systems. This paper examines the properties of these semidefinite programs when applied to lattice-regulated field…
New type III and type N approximate solutions which are regular in the linear approximation are shown to exist. For that, we use complex transformations on self-dual Robinson-Trautman metrics rather then the classical approach. The…
Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical…
This paper is concerned with recovering the solution of a final value problem associated with a parabolic equation involving a non linear source and a non-local term, which to the best of our knowledge has not been studied earlier. It is…
We study one-dimensional QCD at finite quark density by using the sign optimization framework. The fermion sign problem is mitigated by deforming the path integral domain, $SU(3)$ to a complexified one ${\cal M} \subset SL(3)$, explicitly…
We prove some regularity results for a connected set S in the planar domain O, which minimizes the compliance of its complement O\S, plus its length. This problem, interpreted as to find the best location for attaching a membrane subject to…