Related papers: Parallel Tempered Metadynamics
In recent years, various means of efficiently detecting changepoints in the univariate setting have been proposed, with one popular approach involving minimising a penalised cost function using dynamic programming. In some situations, these…
The parallel dynamics of extremely diluted symmetric Q-Ising neural networks is studied for arbitrary Q using a probabilistic approach. In spite of the extremely diluted architecture the feedback correlations arising from the symmetry…
This paper proposes a general formulation for temporal parallelisation of dynamic programming for optimal control problems. We derive the elements and associative operators to be able to use parallel scans to solve these problems with…
We identify the mechanism of slow heterogeneous relaxation in quantum kinetically constrained models (KCMs) in which the potential energy strength is controlled by a coupling parameter. The regime of slow relaxation includes the…
Decoupling approach presents a novel solution/alternative to the highly time-consuming fluid-thermal-structural simulation procedures when thermal effects and resultant displacements on machine tools are analyzed. Using high dimensional…
Microstructures forming during ternary eutectic directional solidification processes have significant influence on the macroscopic mechanical properties of metal alloys. For a realistic simulation, we use the well established…
We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…
In QCD with two flavors of massless quarks, the chiral phase transition is plausibly in the same universality class as the classical four component Heisenberg antiferromagnet. Therefore, renormalization group techniques developed in the…
We present two improvements to our previous dynamical overlap HMC algorithm. We introduce a new method of differentiating the eigenvectors of the Kernel operator, which removes an instability in the fermionic force. Secondly, by simulating…
Federated learning (FL) scenarios inherently generate a large communication overhead by frequently transmitting neural network updates between clients and server. To minimize the communication cost, introducing sparsity in conjunction with…
We model the performance of an ideal closed chain of L processing elements that work in parallel in an asynchronous manner. Their state updates follow a generic conservative algorithm. The conservative update rule determines the growth of a…
Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in HMC simulations. The use of a multiple time-scale integration scheme allows the filtered pseudofermions to be…
Competing phases or interactions in complex many-particle systems can result in free energy barriers that strongly suppress thermal equilibration. Here we discuss how extended ensemble Monte Carlo simulations can be used to study the…
The computational power of mobile robots is currently insufficient to achieve torque level whole-body Model Predictive Control (MPC) at the update rates required for complex dynamic systems such as legged robots. This problem is commonly…
At nonzero quark chemical potential dynamical lattice simulations of QCD are hindered by the sign problem caused by the complex fermion determinant. The severity of the sign problem can be assessed by the average phase of the fermion…
A methodology is given to test the QCD $N_f$=2 chiral transition, presently conjectured to be second order. Scaling forms for the correlation length, susceptibilities and equation of state are given which account for finite lattice spacing.…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
We introduce a modified molecular dynamics algorithm that allows one to freeze the dynamics of parts of a physical system, and thus concentrate the simulation effort on selected, central degrees of freedom. This freezing, in contrast to…
We develop and implement a parallel flatPERM algorithm \cite{G97,PK04} with mutually interacting parallel flatPERM sequences and use it to sample self-avoiding walks in 2 and 3 dimensions. Our data show that the parallel implementation…
We seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent that achieves linear speedup. We focus on asynchronous coordinate descent (ACD) algorithms on convex functions which consist of the sum of…