Related papers: Complex Langevin boundary terms in lattice models
The complex Langevin (CL) method is a promising approach to overcome the sign problem, which emerges in real-time formulations of quantum field theories. Over the past decade, stabilization techniques for CL have been developed with…
Self-interacting scalar quantum field theories possessing $PT$-symmetry are physically admissible since their energy spectrum is real and bounded below. However, models with $PT$-invariant potentials can have complex actions in general and…
Non-perturbative formulations of field theories are essential to capture intriguing physical phenomena, including confinement in QCD, spontaneous supersymmetry breaking, and dynamical compactification in superstrings. Lattice regularization…
We consider a problem of risk estimation for large-margin multi-class classifiers. We propose a novel risk bound for the multi-class classification problem. The bound involves the marginal distribution of the classifier and the Rademacher…
This paper is concerned with the problem of policy evaluation with linear function approximation in discounted infinite horizon Markov decision processes. We investigate the sample complexities required to guarantee a predefined estimation…
We provide quantitative bounds on the convergence to stationarity of real-valued Langevin diffusions with symmetric target densities.
Lattice QCD at finite chemical potential is difficult due to the sign problem. We use stochastic quantization and complex Langevin dynamics to study this issue. First results for QCD in the hopping expansion are encouraging. U(1) and SU(3)…
Finite-sum optimization plays an important role in the area of machine learning, and hence has triggered a surge of interest in recent years. To address this optimization problem, various randomized incremental gradient methods have been…
Lattice scalar field theories encounter a sign problem when the coupling constant is complex. This is a close cousin of the real-time sign problems that afflict the lattice Schwinger-Keldysh formalism, and a more distant relative of the…
The exact estimation of latent variable models with big data is known to be challenging. The latents have to be integrated out numerically, and the dimension of the latent variables increases with the sample size. This paper develops a…
Recent works have derived non-asymptotic upper bounds for convergence of underdamped Langevin MCMC. We revisit these bound and consider introducing scaling terms in the underlying underdamped Langevin equation. In particular, we provide…
We explore recently introduced definition modeling technique that provided the tool for evaluation of different distributed vector representations of words through modeling dictionary definitions of words. In this work, we study the problem…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
Langevin diffusion is a commonly used tool for sampling from a given distribution. In this work, we establish that when the target density $p^*$ is such that $\log p^*$ is $L$ smooth and $m$ strongly convex, discrete Langevin diffusion…
We study the data complexity of model-checking for logics with team semantics. We focus on dependence, inclusion, and independence logic formulas under both strict and lax team semantics. Our results delineate a clear…
In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy,…
In this review, I recall the nature and the inevitability of the "sign problem" which plagues attempts to simulate lattice QCD at finite baryon density. I present the main approaches used to circumvent the sign problem at small chemical…
Lattice QCD has reached a mature status. State of the art lattice computations include $u,d,s$ (and even the $c$) sea quark effects, together with an estimate of electromagnetic and isospin breaking corrections for hadronic observables.…
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such…