Related papers: Metropolis Algorithms in Generalized Ensemble
Ensembles of artificial neural networks show improved generalization capabilities that outperform those of single networks. However, for aggregation to be effective, the individual networks must be as accurate and diverse as possible. An…
In this paper, we introduce a dynamical Monte Carlo algorithm for spin models in which the number of the spins fluctuates from zero to a given number by addition and deletion of spins with a probabilistic rule. Such simulations are realized…
This paper presents a general neural network framework for solving quantum few-body systems, extending prior methods to handle diverse particle masses, interaction types, and system configurations. Our architecture, which combines an…
An optimization algorithm is presented which consists of cyclically heating and quenching by Metropolis and local search procedures, respectively. It works particularly well when it is applied to an archive of samples instead of to a single…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
In the distributed optimization problem for a multi-agent system, each agent knows a local function and must find a minimizer of the sum of all agents' local functions by performing a combination of local gradient evaluations and…
A powerful way to improve performance in machine learning is to construct an ensemble that combines the predictions of multiple models. Ensemble methods are often much more accurate and lower variance than the individual classifiers that…
Ensemble Decision Systems offer a unique form of decision making that allows a collection of algorithms to reason together about a problem. Each individual algorithm has its own inherent strengths and weaknesses, and often it is difficult…
I propose a numerical simulation algorithm for statistical systems which combines a microcanonical transfer of energy with global changes in clusters of spins. The advantages of the cluster approach near a critical point augment the speed…
Urban street networks of unplanned or self-organized cities typically exhibit astonishing scale-free patterns. This scale-freeness can be shown, within the maximum entropy formalism (MaxEnt), as the manifestation of a fluctuating system…
Population Monte Carlo simulations in the form commonly referred to as population annealing can serve as a useful meta-algorithm for simulating systems with complex free-energy landscapes. In the present paper we provide an easily…
For a macroscopic, isolated quantum system in an unknown pure state, the expectation value of any given observable is shown to hardly deviate from the ensemble average with extremely high probability under generic equilibrium and…
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\ell_1$ norm regularized optimization, and $\ell_0$ norm regularized…
The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…
We consider versions of the Metropolis algorithm which avoid the inefficiency of rejections. We first illustrate that a natural Uniform Selection Algorithm might not converge to the correct distribution. We then analyse the use of Markov…
We discuss modern ideas in Monte Carlo algorithms in the simplified setting of the one-dimensional anharmonic oscillator. After reviewing the connection between molecular dynamics and Monte Carlo, we introduce to the Metropolis and the…
Approximate Bayes Computations (ABC) are used for parameter inference when the likelihood function of the model is expensive to evaluate but relatively cheap to sample from. In particle ABC, an ensemble of particles in the product space of…
Markov Chain Monte Carlo methods are widely used in signal processing and communications for statistical inference and stochastic optimization. In this work, we introduce an efficient adaptive Metropolis-Hastings algorithm to draw samples…
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…
Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and…