Efficient implementation of Monte Carlo Cluster Algorithms in Python. In ising.py the Metropolis, Wolff and Swedsen-Wang (SW) algorithms are implemented. In the animation below you can see the ...

The Annals of Applied Probability, Vol. 7, No. 1 (Feb., 1997), pp. 110-120 (11 pages) This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis ...

This paper is devoted to the AMOR algorithm, a provably consistent variant of AM that can cope with the label-switching problem. The idea is to nest relabeling steps within the MCMC algorithm based on ...

The balance between exploration and exploitation is one of the key problems of action selection in Q-learning. Pure exploitation causes the agent to reach the locally optimal policies quickly, whereas ...