Monte Carlo Methods and Grid Computing

Slides:



Advertisements
Similar presentations
Computer Vision Lab. SNU Young Ki Baik An Introduction to MCMC for Machine Learning (Markov Chain Monte Carlo)
Advertisements

Introduction to Sampling based inference and MCMC Ata Kaban School of Computer Science The University of Birmingham.
BAYESIAN INFERENCE Sampling techniques
FIN 685: Risk Management Topic 5: Simulation Larry Schrenk, Instructor.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lectures 18, 19: Monte Carlo Integration Ravi Ramamoorthi Acknowledgements.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
Computational statistics, course introduction Course contents  Monte Carlo Methods  Random number generation  Simulation methodology  Bootstrap  Markov.
Programme in Statistics (Courses and Contents). Elementary Probability and Statistics (I) 3(2+1)Stat. 101 College of Science, Computer Science, Education.
1 Lecture 12 Monte Carlo methods in parallel computing Parallel Computing Fall 2008.
Chapter 14 Simulation. Monte Carlo Process Statistical Analysis of Simulation Results Verification of the Simulation Model Computer Simulation with Excel.
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
The Monte Carlo Method: an Introduction Detlev Reiter Research Centre Jülich (FZJ) D Jülich
Monte Carlo Methods in Partial Differential Equations.
Random Number Generation Fall 2013
Introduction to Monte Carlo Methods D.J.C. Mackay.
Buffon’s Needle Todd Savage. Buffon's needle problem asks to find the probability that a needle of length ‘l’ will land on a line, given a floor with.
Analysis of Monte Carlo Integration Fall 2012 By Yaohang Li, Ph.D.
Advanced methods of molecular dynamics Monte Carlo methods
Random Number Generators CISC/QCSE 810. What is random? Flip 10 coins: how many do you expect will be heads? Measure 100 people: how are their heights.
Overview G. Jogesh Babu. Probability theory Probability is all about flip of a coin Conditional probability & Bayes theorem (Bayesian analysis) Expectation,
Monte Carlo Methods: Basics
Short Resume of Statistical Terms Fall 2013 By Yaohang Li, Ph.D.
General Principle of Monte Carlo Fall 2013
Australian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN Monte Carlo Optimization to Solve a Two-Dimensional Inverse Heat.
Introduction to Monte Carlo Simulation. What is a Monte Carlo simulation? In a Monte Carlo simulation we attempt to follow the `time dependence’ of a.
General Principle of Monte Carlo Fall 2013 By Yaohang Li, Ph.D.
Monte Carlo I Previous lecture Analytical illumination formula This lecture Numerical evaluation of illumination Review random variables and probability.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Stochastic Monte Carlo methods for non-linear statistical inverse problems Benjamin R. Herman Department of Electrical Engineering City College of New.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
P T A typical experiment in a real (not virtual) space 1.Some material is put in a container at fixed T & P. 2.The material is in a thermal fluctuation,
Monte Carlo for PDEs Fall Review Last Class – Monte Carlo Linear Solver von Neumann and Ulam method Randomize Stationary iterative methods Variations.
Monte Carlo Methods1 T Special Course In Information Science II Tomas Ukkonen
Monte Carlo Methods So far we have discussed Monte Carlo methods based on a uniform distribution of random numbers on the interval [0,1] p(x) = 1 0  x.
Radiation Shielding and Reactor Criticality Fall 2012 By Yaohang Li, Ph.D.
, Patrik Huber.  One of our goals: Evaluation of the posterior p(Z|X)  Exact inference  In practice: often infeasible to evaluate the posterior.
Quasi-Monte Carlo Methods Fall 2012 By Yaohang Li, Ph.D.
Monté Carlo Simulation  Understand the concept of Monté Carlo Simulation  Learn how to use Monté Carlo Simulation to make good decisions  Learn how.
INFSO-RI Enabling Grids for E-sciencE SALUTE – Grid application for problems in quantum transport E. Atanassov, T. Gurov, A. Karaivanova,
Lesson 4: Computer method overview
Application of the MCMC Method for the Calibration of DSMC Parameters James S. Strand and David B. Goldstein The University of Texas at Austin Sponsored.
Reducing MCMC Computational Cost With a Two Layered Bayesian Approach
Review Session BS123A/MB223 UC-Irvine Ray Luo, MBB, BS.
Variance Reduction Fall 2012
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
Gil McVean, Department of Statistics Thursday February 12 th 2009 Monte Carlo simulation.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
Computational Physics (Lecture 8) PHY4061. Inverse of a matrix The inverse of a matrix A using linear equating approach: A −1 i j = x i j, – for i, j.
Overview G. Jogesh Babu. R Programming environment Introduction to R programming language R is an integrated suite of software facilities for data manipulation,
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
The Monte Carlo Method/ Markov Chains/ Metropolitan Algorithm from sec in “Adaptive Cooperative Systems” -summarized by Jinsan Yang.
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Introduction to Sampling based inference and MCMC
Lesson 8: Basic Monte Carlo integration
Markov Chain Monte Carlo methods --the final project of stat 6213
Optimization of Monte Carlo Integration
Basic simulation methodology
Green’s Function Monte Carlo Fall 2013
4. Numerical Integration
High Performance Computing and Monte Carlo Methods
Assoc. Prof. Dr. Peerapol Yuvapoositanon
Maria Okuniewski Nuclear Engineering Dept.
Markov chain monte carlo
Professor S K Dubey,VSM Amity School of Business
Lecture 2 – Monte Carlo method in finance
Large Time Scale Molecular Paths Using Least Action.
Monte Carlo I Previous lecture Analytical illumination formula
Lecture 4 - Monte Carlo improvements via variance reduction techniques: antithetic sampling Antithetic variates: for any one path obtained by a gaussian.
Statistical Methods for Data Analysis Random number generators
Presentation transcript:

Monte Carlo Methods and Grid Computing Yaohang Li Department of Computer Science North Carolina A&T State University

Textbook Monte Carlo Methods Markov Chain Monte Carlo in Practice By J. M. Hammersley and D. C. Handscomb Markov Chain Monte Carlo in Practice By Gilks, Richardson, and Spiegelhalter

Course Goals Let the students master the theory of the Monte Carlo methods in Computational Science Enable the students to apply the Monte Carlo methods to simulate and solve real-life problems Allow the students to use the parallel and distributed platform such as the grid to perform large-scale Monte Carlo simulation

Course Design Methods Simulation Applications Applications on the Grid Basic Monte Carlo Methods Analysis of Monte Carlo Methods Simulation Applications Biology Nuclear Physics Materials Engineering Chemistry Applications on the Grid Course Projects Understand the theory behind Monte Carlo methods Apply Monte Carlo methods to solve real-life problems Using the Grid as the computational platform Term Papers Survey of the development of Monte Carlo methods

Course Outline Simulation Applications Monte Carlo Methods Nuclear Physics Radiation Shielding and Reactor Criticality Polymer Science Long Polymer Molecules Statistical Mechanics Markov Chain Computational Biology Protein Folding Protein Docking Material Science Ab initio Monte Carlo Grid Computing Characteristics of Grid Computing Grid-based Monte Carlo Applications Monte Carlo Methods The General Nature of Monte Carlo Methods Short Resume of Statistical Terms Random Number Generation Pseudorandom Number Generation Quasirandom Number Generation General Principles of the Monte Carlo Methods Conditional Monte Carlo Direct Simulation Solution of Linear Operator Equations Metropolis Method

Introduction to Monte Carlo Methods What is Monte Carlo method? Experimental mathematics Experiments on random numbers General Nature of Monte Carlo Methods Understand sophisticated problems Extensive use in Simulation Operational research Nuclear physics Chemistry Biology Medicine Engineering According to word of mouth, about 50% of CPU time of Department of Energy is spent on Monte Carlo Computation

Short Resume of Statistical Terms Recall the basic terms and theories in statistics and probability Random events and probability Random variables Discrete random variable Continuous random variable Distribution Probability density function Cumulative distribution function Various Distributions Uniform distribution Rectangular distribution Binomial distribution Poisson distribution Normal Distribution Expectation

Random Number Generation (I) Generating high-quality random numbers is critical in Monte Carlo applications How random numbers will affect the accuracy of Monte Carlo applications Generating Pseudorandom Numbers Requirement of Pseudorandom Numbers Randomness Reproducibility Efficiency Uniformity Pseudorandom Number Generator LCG LFG ICG Test of Pseudorandom Number Generator Quasirandom Number Generator What are the advantages of quasirandom number generator? Types of Quasirandom Number Generators Van der Corput Generator Halton Generator Faure Generator Sobol’ Generator

Random Number Generator (II) Sampling from non-rectangular distributions Using the inverse function Using the acceptance-rejection method Class Project 1 Build a Pseudorandom Number Generator Test the Randomness of this Random Number Generator Generating Gaussian Samples using the Pseudorandom Number Generator Build a Quasirandom Number Generator

Direct Simulation Direct Simulation Methods Base on a probabilistic problem Build a Monte Carlo model Simple general structure Miscellaneous examples of Direct Simulations Operational research problem Comparative Simulation Course Project II Develop a Buffon’s Needle Applet to calculate 

General Principles of the Monte Carlo Method Crude Monte Carlo Method Integral Estimation Expectation and variance Convergence rate O(cN-1) Error estimation Avoiding the curse of dimentionality Compare with the deterministic numerical methods Compare with hit-or-miss Monte Carlo

Variance Reduction Techniques Theory Behind Variance Reduction Techniques Reduce the constant c of the convergence rate O(cN-1) of crude Monte Carlo Variance Reduction Techniques Importance Sampling Control Variates Antithetic Variates Regression Methods Use of Orthonormal Functions

Course Project III Develop a program using Crude Monte Carlo to estimate an integral Compare with deterministic methods as dimension increases Apply a variance reduction technique to compare the convergence rate

Conditional Monte Carlo Theory of Conditional Monte Carlo A special case of the foregoing theory Conditional Monte Carlo Compare Conditional Monte Carlo with direct simulation

Solution of Linear Operation Equation Simultaneous Linear Equations x = a + Hx Condition of convergence von Neumann and Ulam’s random walk method Sequential Monte Carlo Fredholm integral equations of the second kind The Dirichlet Problem Eigenvalue problems Course Project IV Use the random walk method to develop a program to simulate the Google search for finding the eigenvector corresponding to largest eigenvalue

Radiation Shielding and Reactor Criticality The Shielding Problem When a thick shield of absorbing material is exposed to -radiation (photons), of specified energy and angle of incidence, what is the intesity and energy-distribution of the radiation that penetrates the shield? Special Handling The Criticality Problem When a pulse of neutrons is injected into a reactor assembly, will it cause a multiplying chain reaction or will it be absorbed, and, in particular, what is the size of the assembly at which the reaction is just able to sustain itself? Eigenvalue Problem Matrix Method

Problems in Statistical Mechanics Markov Chains Definition of Markov Chains Characteristics of Markov Chains Categorizing Markov Chains Problems in equilibrium statistical mechanics Thermal equilibrium Statistical mechanics system Order-disorder phenomena Quantum statistics

Exploring the Equilibrium States Global Minimum and Local Minimum Equilibrium States Markov Chain Monte Carlo (MCMC) Metropolis-Hastings Method Simulated Annealing Simulated Tempering Accelerated Simulated Tempering (AST) Developed by Yaohang Li et al. Parallel Tempering Accelerated Parallel Tempering (APT)

Course Project V Develop a Program using Metropolis-Hastings Method to Explore a rough 1-dimensional energy landscape Extend the program using a simulated annealing method Extend the program using a simulated tempering method Analyze the algorithms when dimension increases Analyze the algorithms when the landscape becomes rougher

Long Polymer Molecules Self-avoiding Random Walks Walks on a mesh Walks in continuous space Crude Sampling Generation of very long walks Recent development Protein Folding and Docking

Monte Carlo Method in Material Science Monte Carlo Process resembles a Physical Process Ab initio Monte Carlo Ising Model Complex System

High Performance Monte Carlo Simulation Characteristics of Monte Carlo Simulation Parallel Random Number Generation Natural Parallel Monte Carlo Simulation High Performance Monte Carlo Simulation

Monte Carlo Applications and Grid Computing Widely distributed Large-scale resource sharing Issues Performance Trustworthiness Monte Carlo Applications Approximate solutions to a variety of mathematical problems Performing statistical sampling experiments Slow convergence rate, approximately O(N-1/2) Computationally intensive and naturally parallel

Grid-based Monte Carlo Applications Issues in Grid Computing From application point of view Performance Trustworthiness Our Approaches Address issues from application level Analyze characteristics of Monte Carlo applications Statistical nature Cryptographic aspect of underlying random number generator Develop strategies and tools

Techniques for Grid-based Monte Carlo Applications Improve Performance N-out-of-M Strategy Bio-inspired Scheduling Lightweight Checkpoint Improve Trustworthiness Partial Result Validation Scheme Intermediate Value Checking

Conclusion Stimulate the students’ interest in computational science Allow the students to master the methods and techniques of high performance statistical simulation Develop interdisciplinary research and educational areas Encourage the students to apply the computational techniques to real-life applications