Related papers: Improving the dynamical overlap algorithm
An algorithm is proposed to solve robust control problems constrained by partial differential equations with uncertain coefficients, based on the so-called MG/OPT framework. The levels in this MG/OPT hierarchy correspond to discretization…
We compare the efficiency of four different algorithms to compute the overlap Dirac operator, both for the speed, i.e., time required to reach a desired numerical accuracy, and for the adaptability, i.e., the scaling of speed with the…
This is a brief note on 'A better conditioned Domain Wall Operator', which provides a more detailed explanation of the domain wall-to-overlap transformation with the inclusion of the alpha parameter.
Improvements of various methods to compute the sign function of the hermitian Wilson-Dirac matrix within the overlap operator are presented. An optimal partial fraction expansion (PFE) based on a theorem of Zolotarev is given. Benchmarks…
We discuss our implementation of dynamical Ginsparg-Wilson type fermions using a stout-smeared chirally improved Dirac operator. Such operators have been studied extensively in quenched calculations within the Bern-Graz-Regensburg (BGR)…
Most models in machine learning contain at least one hyperparameter to control for model complexity. Choosing an appropriate set of hyperparameters is both crucial in terms of model accuracy and computationally challenging. In this work we…
Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techniques in practice,…
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the…
The main question concerns another recent advance in sequential Monte Carlo, the use of a mixture transition kernel that automatically adapts to the target distribution (Douc et al. 2006). Is there a class of static inference problems for…
In this paper, we propose a fast proximal gradient algorithm for multiobjective optimization, it is proved that the convergence rate of the accelerated algorithm for multiobjective optimization developed by Tanabe et al. can be improved…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present iterative Krylov subspace approximations, with deflation of critical…
We summarize our recent investigations of lattice QCD with dynamical overlap fermions. We sketch algorithmic issues and our approach to solving them. We show our measurement of the topological susceptibility. We describe a computation of…
We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023)], aimed at identifying the optimal working point of the algorithm. We observe an optimal mixing Hamiltonian strength and analyze the…
We introduce a framework to accelerate the convergence of gradient-based methods with online learning. The framework learns to scale the gradient at each iteration through an online learning algorithm and provably accelerates gradient-based…
The overlap operator is a lattice discretization of the Dirac operator of quantum chromodynamics, the fundamental physical theory of the strong interaction between the quarks. As opposed to other discretizations it preserves the important…
Integer and mixed-integer nonlinear programming (INLP, MINLP) are central to logistics, energy, and scheduling, but remain computationally challenging. This survey examines how machine learning and reinforcement learning can enhance exact…
We construct Monte Carlo methods for the $L^2$-approximation in Hilbert spaces of multivariate functions sampling no more than $n$ function values of the target function. Their errors catch up with the rate of convergence and the…
In this talk I propose a new computational scheme with overlap fermions and a fast algorithm to invert the corresponding Dirac operator.
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper,…
The improvement of simulations of QCD with dynamical Wilson fermions by combining the Hybrid Monte Carlo algorithm with parallel tempering is studied. As an indicator for decorrelation the topological charge is used.