Related papers: On the validity of complex Langevin method for pat…
Long-tailed instance segmentation is a challenging task due to the extreme imbalance of training samples among classes. It causes severe biases of the head classes (with majority samples) against the tailed ones. This renders "how to…
We show how the Hamiltonian lattice loop representation can be cast straightforwardly in the path integral formalism. The procedure is general for any gauge theory. Here we present in detail the simplest case: pure compact QED. We also…
Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided.…
We investigate lattice simulations of scalar and nonabelian gauge fields in Minkowski space-time. For SU(2) gauge-theory expectation values of link variables in 3+1 dimensions are constructed by a stochastic process in an additional (5th)…
The unadjusted Langevin algorithm is widely used for sampling from complex high-dimensional distributions. It is well known to be biased, with the bias typically scaling linearly with the dimension when measured in squared Wasserstein…
The technique of modifying the geometry of a problem from Euclidean to Hessian metric has proved to be quite effective in optimization, and has been the subject of study for sampling. The Mirror Langevin Diffusion (MLD) is a sampling…
Cross-Correlation random matrices have emerged as a promising indicator of phase transitions in spin systems. The core concept is that the evolution of magnetization encapsulates thermodynamic information [R. da Silva, Int. J. Mod. Phys. C,…
We discuss the design of state-of-the-art numerical methods for molecular dynamics, focusing on the demands of soft matter simulation, where the purposes include sampling and dynamics calculations both in and out of equilibrium. We discuss…
While Contrastive Learning (CL) has revolutionized self-supervised representation learning, its latent representations remain highly entangled and opaque, limiting their interpretability in safety-critical applications. We identify that a…
Langevin (stochastic differential) equations are routinely used to describe particle-laden flows. They predict Gaussian probability density functions (PDFs) of a particle's trajectory and velocity, even though experimentally observed…
Langevin equations are used to model many processes of physical interest, including low-energy nuclear collisions. In this paper we develop a general method for computing probabilities of very rare events (e.g. small fusion cross-sections)…
In our recent work [Phys. Rev. Lett. 102, 230502 (2009)] we showed that the partition function of all classical spin models, including all discrete standard statistical models and all Abelian discrete lattice gauge theories (LGTs), can be…
We propose a path optimization method (POM) to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method…
In this work, we provide a refinement of the selective CLT result of Tian and Taylor (2015), which allows for selective inference in non-parametric settings by adjusting for the asymptotic Gaussian limit for selection. Under some regularity…
We study the convergence to equilibrium of an underdamped Langevin equation that is controlled by a linear feedback force. Specifically, we are interested in sampling the possibly multimodal invariant probability distribution of a Langevin…
We present a simulation strategy for the real-time dynamics of quantum fields, inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information, a necessary prerequisite…
We consider stochastic approximations of sampling algorithms, such as Stochastic Gradient Langevin Dynamics (SGLD) and the Random Batch Method (RBM) for Interacting Particle Dynamcs (IPD). We observe that the noise introduced by the…
Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…
Langevin algorithms are gradient descent methods with additive noise. They have been used for decades in Markov chain Monte Carlo (MCMC) sampling, optimization, and learning. Their convergence properties for unconstrained non-convex…
We show that the partition function of all classical spin models, including all discrete Standard Statistical Models and all abelian discrete Lattice Gauge Theories (LGTs), can be expressed as a special instance of the partition function of…