Towards learning optimized kernels for complex Langevin
From MaRDI portal
Abstract: We present a novel strategy aimed at restoring correct convergence in complex Langevin simulations. The central idea is to incorporate system-specific prior knowledge into the simulations, in order to circumvent the NP-hard sign problem. In order to do so, we modify complex Langevin using kernels and propose the use of modern auto-differentiation methods to learn optimal kernel values. The optimization process is guided by functionals encoding relevant prior information, such as symmetries or Euclidean correlator data. Our approach recovers correct convergence in the non-interacting theory on the Schwinger-Keldysh contour for any real-time extent. For the strongly coupled quantum anharmonic oscillator we achieve correct convergence up to three-times the real-time extent of the previous benchmark study. An appendix sheds light on the fact that for correct convergence not only the absence of boundary terms, but in addition the correct Fokker-Plank spectrum is crucial.
Recommendations
- Rademacher Chaos Complexities for Learning the Kernel Problem
- Optimal learning rates for kernel partial least squares
- Stochastic quantization using a kerneled Langevin equation
- Conjugate gradients for kernel machines
- Multiple spectral kernel learning and a Gaussian complexity computation
- The Augmented Complex Kernel LMS
- Optimizing Kernel Methods: A Unifying Variational Principle
Cites work
- Adaptive methods for stochastic differential equations via natural embeddings and rejection sampling with memory
- Adjoint Sensitivity Analysis for Differential-Algebraic Equations: The Adjoint DAE System and Its Numerical Solution
- Approaches to the sign problem in lattice field theory
- Comment on the subtlety of defining a real-time path integral in lattice gauge theories
- Complex Langevin and other approaches to the sign problem in quantum many-body physics
- Density of states method for the \(\mathbb{Z}_3\) spin model
- Gauge cooling in complex Langevin for lattice QCD with heavy quarks
- scientific article; zbMATH DE number 4068038 (Why is no real title available?)
- scientific article; zbMATH DE number 6982909 (Why is no real title available?)
- Justification of the complex Langevin method with the gauge cooling procedure
- Least squares shadowing sensitivity analysis of chaotic limit cycle oscillations
- Minkowski stochastic quantization
- Numerical Integration of Multiplicative-Noise Stochastic Differential Equations
- Optimisation of thimble simulations and quantum dynamics of multiple fields in real time
- Positive representations of a class of complex measures
- Positive representations of complex distributions on groups
- Real-time gauge theory simulations from stochastic quantization with optimized updating
- Sensitivity analysis on chaotic dynamical systems by non-intrusive least squares shadowing (NILSS)
- Stability of complex Langevin dynamics in effective models
- Stable solvers for real-time complex Langevin
Cited in
(9)- Stabilizing complex Langevin for real-time gauge theories with an anisotropic kernel
- Diffusion models as stochastic quantization in lattice field theory
- Preconditioned flow as a solution to the hierarchical growth problem in the generalized Lefschetz thimble method
- Combining complex Langevin dynamics with score-based and energy-based diffusion models
- Necessary and sufficient conditions for correctness of complex Langevin
- Super-resolving normalising flows for lattice field theories
- Lefschetz thimble-inspired weight regularizations for complex Langevin simulations
- Reducing the sign problem with line integrals
- A novel arctic fox survival strategy inspired optimization algorithm
This page was built for publication: Towards learning optimized kernels for complex Langevin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6105622)
