Applications of Extended Ensemble Monte Carlo Yukito IBA The Institute of Statistical Mathematics, Tokyo, Japan.

Slides:



Advertisements
Similar presentations
PRAGMA – 9 V.S.S.Sastry School of Physics University of Hyderabad 22 nd October, 2005.
Advertisements

Introduction to Monte Carlo Markov chain (MCMC) methods
Monte Carlo Methods and Statistical Physics
Efficient Cosmological Parameter Estimation with Hamiltonian Monte Carlo Amir Hajian Amir Hajian Cosmo06 – September 25, 2006 Astro-ph/
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Gibbs Sampling Qianji Zheng Oct. 5th, 2010.
Modern Monte Carlo Methods: (2) Histogram Reweighting (3) Transition Matrix Monte Carlo Jian-Sheng Wang National University of Singapore.
Bayesian Methods with Monte Carlo Markov Chains III
Introduction to Sampling based inference and MCMC Ata Kaban School of Computer Science The University of Birmingham.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Bayesian Reasoning: Markov Chain Monte Carlo
Bayesian statistics – MCMC techniques
BAYESIAN INFERENCE Sampling techniques
Optimization methods Morten Nielsen Department of Systems biology, DTU.
Lecture 14: Advanced Conformational Sampling
1 CE 530 Molecular Simulation Lecture 8 Markov Processes David A. Kofke Department of Chemical Engineering SUNY Buffalo
Visual Recognition Tutorial
Computing the Posterior Probability The posterior probability distribution contains the complete information concerning the parameters, but need often.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
1 Cluster Monte Carlo Algorithms & softening of first-order transition by disorder TIAN Liang.
End of Chapter 8 Neil Weisenfeld March 28, 2005.
Parallel Flat Histogram Simulations Malek O. Khan Dept. of Physical Chemistry Uppsala University.
Lecture II-2: Probability Review
Binary Variables (1) Coin flipping: heads=1, tails=0 Bernoulli Distribution.
Introduction to Monte Carlo Methods D.J.C. Mackay.
1 CE 530 Molecular Simulation Lecture 7 David A. Kofke Department of Chemical Engineering SUNY Buffalo
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Relating computational and physical complexity Computational complexity: How the number of computational steps needed to solve a problem scales with problem.
Monte Carlo Methods: Basics
Classical and Quantum Monte Carlo Methods Or: Why we know as little as we do about interacting fermions Erez Berg Student/Postdoc Journal Club, Oct
Monte Carlo Simulation of Interacting Electron Models by a New Determinant Approach Mucheng Zhang (Under the direction of Robert W. Robinson and Heinz-Bernd.
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
Priors, Normal Models, Computing Posteriors
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Outline Review of extended ensemble methods (multi-canonical, Wang-Landau, flat-histogram, simulated tempering) Replica MC Connection to parallel tempering.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
1 Gil McVean Tuesday 24 th February 2009 Markov Chain Monte Carlo.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
1 M.Sc. Project of Hanif Bayat Movahed The Phase Transitions of Semiflexible Hard Sphere Chain Liquids Supervisor: Prof. Don Sullivan.
Exploring the connection between sampling problems in Bayesian inference and statistical mechanics Andrew Pohorille NASA-Ames Research Center.
Pavel Stránský Complexity and multidiscipline: new approaches to health 18 April 2012 I NTERPLAY BETWEEN REGULARITY AND CHAOS IN SIMPLE PHYSICAL SYSTEMS.
1 Cluster Monte Carlo Algorithms: Jian-Sheng Wang National University of Singapore.
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
13. Extended Ensemble Methods. Slow Dynamics at First- Order Phase Transition At first-order phase transition, the longest time scale is controlled by.
An Introduction to Markov Chain Monte Carlo Teg Grenager July 1, 2004.
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
The Markov Chain Monte Carlo Method Isabelle Stanton May 8, 2008 Theory Lunch.
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
A tutorial on Markov Chain Monte Carlo. Problem  g (x) dx I = If{X } form a Markov chain with stationary probability  i  I  g(x ) i  (x ) i  i=1.
Generalized van der Waals Partition Function
Graduate School of Information Sciences, Tohoku University
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
Introduction to Sampling Methods Qi Zhao Oct.27,2004.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
CS Statistical Machine learning Lecture 25 Yuan (Alan) Qi Purdue CS Nov
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
Lecture 14: Advanced Conformational Sampling Dr. Ronald M. Levy Statistical Thermodynamics.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Computational Physics (Lecture 10)
Statistical-Mechanical Approach to Probabilistic Image Processing -- Loopy Belief Propagation and Advanced Mean-Field Method -- Kazuyuki Tanaka and Noriko.
Advanced Statistical Computing Fall 2016
Jun Liu Department of Statistics Stanford University
Markov Chain Monte Carlo
14. TMMC, Flat-Histogram and Wang-Landau Method
Haim Kaplan and Uri Zwick
Markov Networks.
Presentation transcript:

Applications of Extended Ensemble Monte Carlo Yukito IBA The Institute of Statistical Mathematics, Tokyo, Japan

Extended Ensemble MCMC A Generic Name which indicates : Parallel Tempering, Simulated Tempering, Multicanonical Sampling, Wang-Landau, … Umbrella Sampling Valleau and Torrie 1970s

Contents 1. Basic Algorithms Parallel Tempering.vs Multicanonical 2. Exact Calculation with soft Constraints Lattice Protein / Counting Tables 3. Rare Events and Large Deviations Communication Channels Chaotic Dynamical Systems

Basic Algorithms Parallel Tempering Multicanonical Monte Carlo

References in physics Iba (2001) Extended Ensemble Monte Carlo Int. J. Mod. Phys. C12 p.623. A draft version will be found at Landau and Binder (2005) A Guide to Monte Carlo Simulations in Statistical Physics (2nd ed., Cambridge) A number of preprints will be found in Los Alamos Arxiv on the web. # This slide is added after the talk

Slow mixing by multimodal dist.×× ×

Bridging fast mixing high temperature slow mixing low temperature

Path Sampling 1.Facilitate Mixing 2.Calculate Normalizing Constant (“free energy”) In Physics: from 2. to s  1990s “Path Sampling” Gelman and Meng (1998) stress 2. but 1. is also important

Parallel Tempering a.k.a. Replica Exchange MC Metropolis Coupled MCMC Simulate Many “Replica”s in Parallel MCMC in a Product Space Geyer (1991), Kimura and Taki (1991) Hukushima and Nemoto (1996) Iba(1993, in Japanese)

Examples Gibbs Distributions with different temperatures Any Family parameterized by a hyperparameter

Exchange of Replicas K=4

Accept/Reject Exchange Calculate Metropolis Ratio Generate a Uniform Random Number in [0,1) and accept exchange iff

Detailed Balance in Extended Space Combined Distribution

Multicanonical Monte Carlo sufficient statistics Exponential Family Energy not Expectation Berg et al. (1991,1992)

Density of States The number of which satisfy

Multicanonical Sampling

Weight and Marginal Distribution Original (Gibbs) Multicanonical Random

flat marginal distribution Scanning broad range of E

Reweighting Formally, for arbitrary it holds. Practically, is required, else the variance diverges in a large system.

Q. How can we do without knowledge on D(E) Ans . Estimate D(E) in the preliminary runs k th simulation Simplest Method : Entropic Sampling in

Estimation of Density of States 5 k= k= MCS MCS 3 (Ising Model on a random net)

Estimation of D(E) Histogram Piecewise Linear Fitting, Kernel Density Estimation.. Wang-Landau Flat Histogram Entropic Sampling Original Multicanonical Continuous Cases D(E)dE : Non-trivial Task

Parallel Tempering / Multicanonical parallel tempering combined distribution simulated tempering mixture distribution to approximate

disordered ordered Potts model (2-dim, q=10 states)

Phase Coexistence/ 1 st order transition parameter (Inverse Temperature) changes sufficient statistics (Energy) jumps water and ice coexists

disordered ordered Potts model (2-dim, q=10 states) bridging by multicanoncal construction

Simple Liquids, Potts Models.. Multicanonical seems better than Parallel But, for more difficult cases ? ex. Ising Model with three spin Interaction

Soft Constraints Lattice Protein Counting Tables The results on Lattice Protein are taken from joint works with G Chikenji (Nagoya Univ) and Macoto Kikuchi (Osaka Univ) Some examples are also taken from the other works by Kikuchi and coworkers.

Lattice Protein Model Motivation Simplest Models of Protein Lattice Protein : Prototype of “Protein-like molecules” Ising Model : Prototype of “Magnets”

Lattice Protein (2-dim HP)

FIXED sequence of conformation of chain STOCHASTIC VARIABLE SELF AVOIDING (SELF OVERLAP is not allowed) IMPORTANT! andcorresponds to 2-types of amino acids (H and P)

E(X)= - the number of Energy (HP model) in x the energy of conformation x is defined as

Examples Here we do not count the pairs neighboring on the chain but it is not essential because the difference is const. E=0 E= - 1

MCMC Slow Mixing Even Non-Ergodicity with local moves Chikenji et al. (1999) Phys. Rev. Lett. 83 pp Bastolla et al. (1998) Proteins 32 pp

Multicanonical Multicanonical w.r.t. E only NOT SUFFUCIENT Self-Avoiding condition is essential

Soft Constraint Self-Avoiding condition is essential Soft Constraint is the number of monomers that occupy the site i

Multi Self-Overlap Sampling Multi Self-Overlap Ensemble Bivariate Density of States in the (E,V) plane E V (self-overlap) Samples with are used for the calculation of the averages EXACT !!

V=0large V E Generation of Paths by softening of constraints

Comparison with multicanonical with hard self-avoiding constraint conventional (hard constraint) proposed (soft constraint) switching between three groups of minimum energy states of a sequence

optimization

optimization (polymer pairs) Nakanishi and Kikuchi (2006) J.Phys.Soc.Jpn. 75 pp / q-bio/

double peaks An Advantage of the method is that it can use for the sampling at any temperature as well as optimization 3-dim Yue and Dill (1995) Proc. Nat. Acad. Sci. 92 pp

Another Sequence non monotonic change of the structure Chikenji and Kikuchi (2000) Proc. Nat. Acad. Sci 97 pp

Related Works Self-Avoiding Walk without interaction / Univariate Extension Vorontsov-Velyaminov et al. : J.Phys.Chem.,100, (1996) Lattice Protein but not exact / Soft-Constraint without control Shakhnovich et al. Physical Review Letters (1991) Continuous homopolymer -- Relax “core” Liu and Berne J Chem Phys (1993) See References in Extended Ensemble Monte Carlo, Int J Phys C (2001) but esp. for continuous cases, there seems more in these five years

Counting Tables 492 357 816 Pinn et al. (1998) Counting Magic Squares Soft Constraints + Parallel Tempering

Sampling by MCMC Multiple Maxima Parallel Tempering

Normalization Constant calculated by Path sampling (thermodynamic integration)

Latin square (3x3) For column, any given number once and only once For each column, any given number appears once and only once For each raw, any given once and only once For each raw, any given number appears once and only once

Latin square (26x26) # This sample is taken from the web.

Counting Latin Squares MCS x 27 replicas MCS x 49 replicas other 3 trials

Counting Tables Soft Constraints + Extended Ensemble MC “Quick and Dirty” ways of calculating the number of tables that satisfy given constraints. It may not be optimal for a special case, but no case-by-case tricks, no mathematics, and no brain is required.

Rare Events and Large Deviations Communication Channels #1 Chaotic Dynamical Systems #2 # 1 Part of joint works with Koji Hukushima (Tokyo Univ). # 2 Part of joint works with Tatsuo Yanagita (Hokkaido Univ). (The result shown here is mostly due to him )

Applications of MCMC Statistical Physics (1953 ~ ) Statistical Inference ( 1970s, 1980s, 1990~) Solution to any problem on sampling & counting estimation of large deviation generation of rare events

Noisy Communication Channel prior encoded & degraded decodedistance (bit errors) by Viterbi, loopy BP, MCMC

Distribution of Bit Errors Kronecker delta tails of the distribution is not easy to estimate

Introduction of MCMC Sampling noise in channels by the MCMC Given an error-correcting code Some patterns of noise are very harmful difficult to correct Some patterns of noise are safe easy to correct NOT sampling from the posterior

Multicanonical Strategy MCMC sampling of Broad distribution of  Broad distribution of distance and

Multicanonical Sampling MCMC Sampling and with the weight Estimated by the iteration of preliminary runs exactly what we want, but can be..

flat marginal distribution Scanning broad range of bit errors Enable efficient calculation of the tails of the distribution (large deviation)

Example Convolutional Code Binary Symmetric Channel Fix the number of noise (flipped bits) Viterbi decoding

Simplification In this case is independent ofSet Binary Symmetric Channel Fix the number of noise (flipped bits) sum over the possible positions of the noise

Simulation the number of bit errors difficult to calculate by simple sampling

Correlated Channels It will be useful for the study of error- correcting code in a correlated channel. Without assuming models of correlation in the channel we can sample relevant correlation patterns.

Rare events in Dynamical Systems Deterministic Chaos Doll et al. (1994), Kurchan et al. (2005) Sasa, Hayashi, Kawasaki.. (2005 ~) (Mostly) Stochastic Dynamics Chandler Group Frenkel et al. and more … Transition Path Sampling Stagger and Step Method Sweet, Nusse, and Yorke (2001)

Sampling Initial Condition Sampling initial condition of Chaotic dynamical systems  Rare Events

Double Pendulum

control and stop the pendulum one of the three positions Unstable fixed points energy dissipation (friction) is assumed i.e., no time reversal sym.

T is max time Definition of artificial “energy” stop = zero velocity stopping position penalty to long time

Metropolis step Integrate Equation of Motion and Simulate Trajectory Perturb Initial State Evaluate “Energy” Reject or Accept

for given T  Parallel Tempering

An animation by Yanagita is shown in the talk, but might not be seen on the web.

Summary Extended Ensemble + Soft Constraint strategy gives simple solutions to a number of difficult problems The use of MCMC should not be restricted to the standard ones in Physics and Bayesian Statistics. To explore new applications of MCMC extended ensemble MC will play an essential role.

END