Related papers: A Growth-based Optimization Algorithm for Lattice …
Two improved versions of the pruned-enriched-Rosenbluth method (PERM) are proposed and tested on simple models of lattice heteropolymers. Both are found to outperform not only the previous version of PERM, but also all other stochastic…
In this review, we describe applications of the pruned-enriched Rosenbluth method (PERM), a sequential Monte Carlo algorithm with resampling, to various problems in polymer physics. PERM produces samples according to any given prescribed…
We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P.~Grassberger, Phys.~Rev.~{\bf E 56} (1997) 3682) leads to very efficient algorithms for the folding of simple model proteins. We test it on several models…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P. Grassberger, Phys. Rev. E, in press (1997)) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
We describe a general strategy, PERM (Pruned-Enriched Rosenbluth Method), for sampling configurations from a given Gibbs-Boltzmann distribution. The method is not based on the Metropolis concept of establishing a Markov process whose…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method (P. Grassberger, Phys. Rev. E 56 (1997) 3682) leads to extremely efficient algorithms for the folding of simple model proteins. We test them on several models for…
In this letter we present a flat histogram algorithm based on the pruned and enriched Rosenbluth method (PERM). This algorithm incorporates in a straightforward manner microcanonical reweighting techniques, leading to "flat histogram"…
We study numerically a lattice model of semiflexible homopolymers with nearest neighbor attraction and energetic preference for straight joints between bonded monomers. For this we use a new algorithm, the "Pruned-Enriched Rosenbluth…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use…
We perform numerical simulations of the lattice-animal problem at the upper critical dimension d=8 on hypercubic lattices in order to investigate logarithmic corrections to scaling there. Our stochastic sampling method is based on the…
We describe a class of growth algorithms for finding low energy states of heteropolymers. These polymers form toy models for proteins, and the hope is that similar methods will ultimately be useful for finding native states of real proteins…
Latent class model (LCM), which is a finite mixture of different categorical distributions, is one of the most widely used models in statistics and machine learning fields. Because of its non-continuous nature and the flexibility in shape,…
Sampling with the Generalised Atmospheric Rosenbluth Method (GARM) is a technique for estimating the distributions of lattice polymer models that has had some success in the study of linear polymers and lattice polygons. In this paper we…
Recent work explored the potential of large-scale Transformer-based pre-trained models, especially Pre-trained Language Models (PLMs) in natural language processing. This raises many concerns from various perspectives, e.g., financial costs…
This paper advocates a new paradigm Personalized Empirical Risk Minimization (PERM) to facilitate learning from heterogeneous data sources without imposing stringent constraints on computational resources shared by participating devices. In…
Variational hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been…
We study the conformational properties of heteropolymers containing two types of monomers A and B, modeled as self-avoiding random walks on a regular lattice. Such a model can describe in particular the sequences of hydrophobic and…