Monte Carlo: Naïve Lecture #19 Rigoberto Hernandez. Monte Carlo Methods 3
|
|
- Samantha Ward
- 5 years ago
- Views:
Transcription
1 Major Concepts Naïve Monte Carlo E.g., calculating π" Metropolis Monte Carlo Detailed Balance Improved Sampling Techniques Importance Sampling Umbrella Sampling Torrie and Valleau (1977) The Wolff Algorithm PRL 62, 361 (1989) Parallel Tempering & Replica Exchange Swendsen & Wang (1986) Wang-Landau (PRL 2001) Monte Carlo of Polymers Monte Carlo Methods 1
2 Monte Carlo: Naïve Monte Carlo Methods 3
3 Naïve MC: Calculating π" Numerics of π: N circ, N sq, 4*N circ /N sq (1 digit) (2 digits) (3 digits) (4 digits) ,, (8 digits) Monte Carlo Methods 4
4 Monte Carlo: Detailed Balance Metropolis Monte Carlo: x x P(x) = Probability that trajectory resides in a given state W(x x ) = Probability per unit time that if the system is in state x, it will make a transition to state x ( ΔE x x' = E(x') E(x) ) Let Monte Carlo Methods 6
5 Monte Carlo: Detailed Balance Metropolis Monte Carlo: x x P(x) = Probability that trajectory resides in a given state W(x x ) = Probability per unit time that if the system is in state x, it will make a transition to state x N. Metropolis, A. Rosenbluth, M.Rosenbluth, A. Teller and E. Teller, J. Chem. Phys. 21, 1087 (1953). Importance Sampling (using loaded dice): Choose a good distribution from which to simulate the random variables of choice. Monte Carlo Methods 7
6 Monte Carlo: Metropolis N. Metropolis, A. Rosenbluth, M.Rosenbluth, A. Teller and E. Teller, J. Chem. Phys. 21, 1087 (1953) Monte Carlo Methods 8
7 Monte Carlo A sample of representative states or configurations is created by performing a random walk through configuration space. A Monte Carlo trajectory in the Ising magnet model would involve picking a random spin in the system and flipping the direction of the spin. The energy of the new configuration is calculated and compared to the energy of the old configuration: If the new energy is lower, the move is accepted. If the energy is higher, a random number is generated and compared to the Boltzmann distribution. It is rejected if the random number is greater than the Boltzmann distribution Monte Carlo Methods 9
8 E(x) Monte Carlo: Umbrella Sampling? x Note hyperdynamics... Monte Carlo Methods 12
9 Monte Carlo: Umbrella Sampling What if E(x) x OK. Let s write: Monte Carlo Methods 13
10 Monte Carlo: Umbrella Sampling Thus, < f > can be calculated from another distribution which corresponds to E 1 (x): as if P(x) = P 0 (x) P 1 (x). Monte Carlo Methods 14
11 Monte Carlo: Umbrella Sampling Monte Carlo Methods 15
12 Parallel Tempering & Replica Exchange Problem: How do you sample all of the space on a corrugated energy landscape? (barriers greater than target T.) Answer: run N many replicas using MC at N different temperatures, T i, in parallel Every so often, attempt exchanges between replicas according to probability = min( 1, exp([1/kt i - 1/kT j ][E i - E j ])) Satisfies detailed balance RH Swendsen and JS Wang, Replica Monte Carlo simulation of spin glasses, Phys. Rev. Lett. 57, (1986) " C. J. Geyer, in Computing Science and Statistics Proceedings of the 23rd Symposium on the Interface, American Statistical Association, New York, 1991, p Monte Carlo Methods 16
13 1-phase system Wang-Landau 2-phase system E E If we know ρ(e), then we know p(e) at any T! If we know p(e), then we know all the thermodynamics! Monte Carlo Methods 17
14 Wang-Landau A Monte Carlo approach for obtaining the density of states, ρ(e), directly Rather than computing g(r) or other observables A random walk through energy space! Algorithm: Initialize ρ(e)=1 for all E Accept moves according to: probability = min[ 1, ρ(e initial )/ρ(e trial move ) ] Let E' be the energy of the state at the end of the trial Update ρ(e') = f ρ(e') & the histogram H( Set(E') )+=1 Stop once the histogram is flat, [error in ρ(e) = O{ln(f)} ] Iterate, now using smaller f F. Wang & D.P. Landau, Phys. Rev. Lett. 86, 205 (2001). [original version for spin Hamiltonian] Monte Carlo Methods 18
15 Monte Carlo of Polymers Example: Metropolis Monte Carlo with the following types of moves: monomer diffusion: randomly selected monomer is displaced it a random small distance; reptation: randomly selected monomer from either end of the chain is reattached to the opposite end of the chain; crank-shaft: the portion of the chain between two randomly selected non-bonded monomers is rotated by a small random angle; random pivot: randomly selects a single monomer and the portion of the connected chain on either side of the monomer. A random direction is then chosen and the selected portion of the chain is then rotated around this axis by a small random angle. D. T. Seaton, S. J. Mitchell, and D. P. Landau Brazilian Journal of Physics, vol. 36, no. 3A, September, 2006, p. 623 Monte Carlo Methods 19
Monte Carlo: Naïve Lecture #14 Rigoberto Hernandez. Monte Carlo Methods 3
Major Concepts Naïve Monte Carlo E.g., calculating π" Metropolis Monte Carlo Detailed Balance Improved Sampling Techniques Importance Sampling Umbrella Sampling Torrie and Valleau (1977) The Wolff Algorithm
More informationThe Monte Carlo Method in High Performance Computing
The Monte Carlo Method in High Performance Computing Dieter W. Heermann Monte Carlo Methods 2015 Dieter W. Heermann (Monte Carlo Methods)The Monte Carlo Method in High Performance Computing 2015 1 / 1
More informationDown-Up Metropolis-Hastings Algorithm for Multimodality
Down-Up Metropolis-Hastings Algorithm for Multimodality Hyungsuk Tak Stat310 24 Nov 2015 Joint work with Xiao-Li Meng and David A. van Dyk Outline Motivation & idea Down-Up Metropolis-Hastings (DUMH) algorithm
More informationHeckmeck am Bratwurmeck or How to grill the maximum number of worms
Heckmeck am Bratwurmeck or How to grill the maximum number of worms Roland C. Seydel 24/05/22 (1) Heckmeck am Bratwurmeck 24/05/22 1 / 29 Overview 1 Introducing the dice game The basic rules Understanding
More informationExam in TFY4275/FY8907 CLASSICAL TRANSPORT THEORY Feb 14, 2014
NTNU Page 1 of 5 Institutt for fysikk Contact during the exam: Professor Ingve Simonsen Exam in TFY4275/FY8907 CLASSICAL TRANSPORT THEORY Feb 14, 2014 Allowed help: Alternativ D All written material This
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 2 Random number generation January 18, 2018
More informationA Markov Chain Monte Carlo Approach to Estimate the Risks of Extremely Large Insurance Claims
International Journal of Business and Economics, 007, Vol. 6, No. 3, 5-36 A Markov Chain Monte Carlo Approach to Estimate the Risks of Extremely Large Insurance Claims Wan-Kai Pang * Department of Applied
More informationApplication of Importance Sampling using Contaminated Normal Distribution to Multidimensional Variation Analysis
1, 2 1 3, 4 1 3 1 Monte Carlo g(x) g(x) g(x) g(x) g(x) / 6-24 SRAM Monte Carlo 2 5 Application of Importance Sampling using Contaminated Normal Distribution to Multidimensional Variation Analysis Shiho
More informationCOS 513: Gibbs Sampling
COS 513: Gibbs Sampling Matthew Salesi December 6, 2010 1 Overview Concluding the coverage of Markov chain Monte Carlo (MCMC) sampling methods, we look today at Gibbs sampling. Gibbs sampling is a simple
More informationChapter 9. Idea of Probability. Randomness and Probability. Basic Practice of Statistics - 3rd Edition. Chapter 9 1. Introducing Probability
Chapter 9 Introducing Probability BPS - 3rd Ed. Chapter 9 1 Idea of Probability Probability is the science of chance behavior Chance behavior is unpredictable in the short run but has a regular and predictable
More informationComplete Wetting in the Potts Model
Master Thesis Complete Wetting in the Potts Model Daliah Maurer 2012 Supervisor Prof. Uwe-Jens Wiese Institute for Theoretical Physics, University of Bern Abstract The topic of this thesis is the three-dimensional
More informationOverview. Transformation method Rejection method. Monte Carlo vs ordinary methods. 1 Random numbers. 2 Monte Carlo integration.
Overview 1 Random numbers Transformation method Rejection method 2 Monte Carlo integration Monte Carlo vs ordinary methods 3 Summary Transformation method Suppose X has probability distribution p X (x),
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 3 Importance sampling January 27, 2015 M. Wiktorsson
More informationExtracting Information from the Markets: A Bayesian Approach
Extracting Information from the Markets: A Bayesian Approach Daniel Waggoner The Federal Reserve Bank of Atlanta Florida State University, February 29, 2008 Disclaimer: The views expressed are the author
More informationarxiv: v2 [physics.soc-ph] 4 Jul 2010
Consequence of reputation in the Sznajd consensus model arxiv:6.2456v2 [physics.soc-ph] 4 Jul 2 Abstract Nuno Crokidakis,2 and Fabricio L. Forgerini 2,3 Instituto de Física - Universidade Federal Fluminense
More informationLecture 17: More on Markov Decision Processes. Reinforcement learning
Lecture 17: More on Markov Decision Processes. Reinforcement learning Learning a model: maximum likelihood Learning a value function directly Monte Carlo Temporal-difference (TD) learning COMP-424, Lecture
More informationOptimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing
Optimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing Prof. Chuan-Ju Wang Department of Computer Science University of Taipei Joint work with Prof. Ming-Yang Kao March 28, 2014
More informationChapter 2 Uncertainty Analysis and Sampling Techniques
Chapter 2 Uncertainty Analysis and Sampling Techniques The probabilistic or stochastic modeling (Fig. 2.) iterative loop in the stochastic optimization procedure (Fig..4 in Chap. ) involves:. Specifying
More informationEE266 Homework 5 Solutions
EE, Spring 15-1 Professor S. Lall EE Homework 5 Solutions 1. A refined inventory model. In this problem we consider an inventory model that is more refined than the one you ve seen in the lectures. The
More informationProblem A Grade x P(x) To get "C" 1 or 2 must be 1 0.05469 B A 2 0.16410 3 0.27340 4 0.27340 5 0.16410 6 0.05470 7 0.00780 0.2188 0.5468 0.2266 Problem B Grade x P(x) To get "C" 1 or 2 must 1 0.31150 be
More informationMonte Carlo Based Reliability Analysis
Monte Carlo Based Reliability Analysis Martin Schwarz 15 May 2014 Martin Schwarz Monte Carlo Based Reliability Analysis 15 May 2014 1 / 19 Plan of Presentation Description of the problem Monte Carlo Simulation
More informationStatistical Computing (36-350)
Statistical Computing (36-350) Lecture 16: Simulation III: Monte Carlo Cosma Shalizi 21 October 2013 Agenda Monte Carlo Monte Carlo approximation of integrals and expectations The rejection method and
More informationMath 361. Day 8 Binomial Random Variables pages 27 and 28 Inv Do you have ESP? Inv. 1.3 Tim or Bob?
Math 361 Day 8 Binomial Random Variables pages 27 and 28 Inv. 1.2 - Do you have ESP? Inv. 1.3 Tim or Bob? Inv. 1.1: Friend or Foe Review Is a particular study result consistent with the null model? Learning
More informationExperimental Probability - probability measured by performing an experiment for a number of n trials and recording the number of outcomes
MDM 4U Probability Review Properties of Probability Experimental Probability - probability measured by performing an experiment for a number of n trials and recording the number of outcomes Theoretical
More informationCalibration of Interest Rates
WDS'12 Proceedings of Contributed Papers, Part I, 25 30, 2012. ISBN 978-80-7378-224-5 MATFYZPRESS Calibration of Interest Rates J. Černý Charles University, Faculty of Mathematics and Physics, Prague,
More informationEstimation of a Ramsay-Curve IRT Model using the Metropolis-Hastings Robbins-Monro Algorithm
1 / 34 Estimation of a Ramsay-Curve IRT Model using the Metropolis-Hastings Robbins-Monro Algorithm Scott Monroe & Li Cai IMPS 2012, Lincoln, Nebraska Outline 2 / 34 1 Introduction and Motivation 2 Review
More informationSection 8.1 Distributions of Random Variables
Section 8.1 Distributions of Random Variables Random Variable A random variable is a rule that assigns a number to each outcome of a chance experiment. There are three types of random variables: 1. Finite
More informationA selection of MAS learning techniques based on RL
A selection of MAS learning techniques based on RL Ann Nowé 14/11/12 Herhaling titel van presentatie 1 Content Single stage setting Common interest (Claus & Boutilier, Kapetanakis&Kudenko) Conflicting
More informationLecture Data Science
Web Science & Technologies University of Koblenz Landau, Germany Lecture Data Science Statistics Foundations JProf. Dr. Claudia Wagner Learning Goals How to describe sample data? What is mode/median/mean?
More informationReinforcement Learning 04 - Monte Carlo. Elena, Xi
Reinforcement Learning 04 - Monte Carlo Elena, Xi Previous lecture 2 Markov Decision Processes Markov decision processes formally describe an environment for reinforcement learning where the environment
More informationyuimagui: A graphical user interface for the yuima package. User Guide yuimagui v1.0
yuimagui: A graphical user interface for the yuima package. User Guide yuimagui v1.0 Emanuele Guidotti, Stefano M. Iacus and Lorenzo Mercuri February 21, 2017 Contents 1 yuimagui: Home 3 2 yuimagui: Data
More informationTheoretical Foundations
Theoretical Foundations Probabilities Monia Ranalli monia.ranalli@uniroma2.it Ranalli M. Theoretical Foundations - Probabilities 1 / 27 Objectives understand the probability basics quantify random phenomena
More informationMonte Carlo Methods (Estimators, On-policy/Off-policy Learning)
1 / 24 Monte Carlo Methods (Estimators, On-policy/Off-policy Learning) Julie Nutini MLRG - Winter Term 2 January 24 th, 2017 2 / 24 Monte Carlo Methods Monte Carlo (MC) methods are learning methods, used
More informationSection 3.1 Distributions of Random Variables
Section 3.1 Distributions of Random Variables Random Variable A random variable is a rule that assigns a number to each outcome of a chance experiment. There are three types of random variables: 1. Finite
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 5 Sequential Monte Carlo methods I January
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2019 Last Time: Markov Chains We can use Markov chains for density estimation, d p(x) = p(x 1 ) p(x }{{}
More information"Pricing Exotic Options using Strong Convergence Properties
Fourth Oxford / Princeton Workshop on Financial Mathematics "Pricing Exotic Options using Strong Convergence Properties Klaus E. Schmitz Abe schmitz@maths.ox.ac.uk www.maths.ox.ac.uk/~schmitz Prof. Mike
More information4.2 Probability Distributions
4.2 Probability Distributions Definition. A random variable is a variable whose value is a numerical outcome of a random phenomenon. The probability distribution of a random variable tells us what the
More informationTime-to-Default Analysis of Mortgage Portfolios
Time-to-Default Analysis of Mortgage Portfolios M. Galloway, A. Johnson and A. Shemyakin Abstract Fluctuation in mortgage defaults provides vital information to financial institutions and a key indicator
More informationSTOCHASTIC COST ESTIMATION AND RISK ANALYSIS IN MANAGING SOFTWARE PROJECTS
Full citation: Connor, A.M., & MacDonell, S.G. (25) Stochastic cost estimation and risk analysis in managing software projects, in Proceedings of the ISCA 14th International Conference on Intelligent and
More informationF19: Introduction to Monte Carlo simulations. Ebrahim Shayesteh
F19: Introduction to Monte Carlo simulations Ebrahim Shayesteh Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example
More informationLecture Slides. Elementary Statistics Tenth Edition. by Mario F. Triola. and the Triola Statistics Series. Slide 1
Lecture Slides Elementary Statistics Tenth Edition and the Triola Statistics Series by Mario F. Triola Slide 1 Chapter 6 Normal Probability Distributions 6-1 Overview 6-2 The Standard Normal Distribution
More informationGibbs Fields: Inference and Relation to Bayes Networks
Statistical Techniques in Robotics (16-831, F10) Lecture#08 (Thursday September 16) Gibbs Fields: Inference and Relation to ayes Networks Lecturer: rew agnell Scribe:ebadeepta ey 1 1 Inference on Gibbs
More informationEnventive Monte Carlo Analysis Tutorial Version 4.1.x
Enventive Monte Carlo Analysis Tutorial Version 4.1.x Copyright 2017 Enventive, Inc. All rights reserved. Table of Contents Welcome to the Monte Carlo Analysis Tutorial 1 Getting started 1 Complete the
More informationProbability mass function; cumulative distribution function
PHP 2510 Random variables; some discrete distributions Random variables - what are they? Probability mass function; cumulative distribution function Some discrete random variable models: Bernoulli Binomial
More informationSECTION 4.4: Expected Value
15 SECTION 4.4: Expected Value This section tells you why most all gambling is a bad idea. And also why carnival or amusement park games are a bad idea. Random Variables Definition: Random Variable A random
More informationRandom Variables. 6.1 Discrete and Continuous Random Variables. Probability Distribution. Discrete Random Variables. Chapter 6, Section 1
6.1 Discrete and Continuous Random Variables Random Variables A random variable, usually written as X, is a variable whose possible values are numerical outcomes of a random phenomenon. There are two types
More informationWeek 4 Assignment 4 detailed answers
Week 4 Assignment 4 detailed answers Due date for this assignment: 2017-08-23, 23:59 IST. Click only the correct answers. There is no negative marking. In all cases of gear Hobbing assume (i) that the
More informationNumerical Methods in Option Pricing (Part III)
Numerical Methods in Option Pricing (Part III) E. Explicit Finite Differences. Use of the Forward, Central, and Symmetric Central a. In order to obtain an explicit solution for the price of the derivative,
More informationValue (x) probability Example A-2: Construct a histogram for population Ψ.
Calculus 111, section 08.x The Central Limit Theorem notes by Tim Pilachowski If you haven t done it yet, go to the Math 111 page and download the handout: Central Limit Theorem supplement. Today s lecture
More informationGENERATION OF STANDARD NORMAL RANDOM NUMBERS. Naveen Kumar Boiroju and M. Krishna Reddy
GENERATION OF STANDARD NORMAL RANDOM NUMBERS Naveen Kumar Boiroju and M. Krishna Reddy Department of Statistics, Osmania University, Hyderabad- 500 007, INDIA Email: nanibyrozu@gmail.com, reddymk54@gmail.com
More informationExample 1: Identify the following random variables as discrete or continuous: a) Weight of a package. b) Number of students in a first-grade classroom
Section 5-1 Probability Distributions I. Random Variables A variable x is a if the value that it assumes, corresponding to the of an experiment, is a or event. A random variable is if it potentially can
More information23.1 Probability Distributions
3.1 Probability Distributions Essential Question: What is a probability distribution for a discrete random variable, and how can it be displayed? Explore Using Simulation to Obtain an Empirical Probability
More informationImplementing Models in Quantitative Finance: Methods and Cases
Gianluca Fusai Andrea Roncoroni Implementing Models in Quantitative Finance: Methods and Cases vl Springer Contents Introduction xv Parti Methods 1 Static Monte Carlo 3 1.1 Motivation and Issues 3 1.1.1
More informationROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices
ROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices Bachelier Finance Society Meeting Toronto 2010 Henley Business School at Reading Contact Author : d.ledermann@icmacentre.ac.uk Alexander
More informationEmpirical and Average Case Analysis
Empirical and Average Case Analysis l We have discussed theoretical analysis of algorithms in a number of ways Worst case big O complexities Recurrence relations l What we often want to know is what will
More informationPROBABILITY. Wiley. With Applications and R ROBERT P. DOBROW. Department of Mathematics. Carleton College Northfield, MN
PROBABILITY With Applications and R ROBERT P. DOBROW Department of Mathematics Carleton College Northfield, MN Wiley CONTENTS Preface Acknowledgments Introduction xi xiv xv 1 First Principles 1 1.1 Random
More informationTo acquaint yourself with the practical applications of simulation methods.
Unit 5 SIMULATION THEORY Lesson 40 Learning objectives: To acquaint yourself with the practical applications of simulation methods. Hello students, Now when you are aware of the methods of simulation and
More informationUnit 04 Review. Probability Rules
Unit 04 Review Probability Rules A sample space contains all the possible outcomes observed in a trial of an experiment, a survey, or some random phenomenon. The sum of the probabilities for all possible
More informationRandomness and Fractals
Randomness and Fractals Why do so many physicists become traders? Gregory F. Lawler Department of Mathematics Department of Statistics University of Chicago September 25, 2011 1 / 24 Mathematics and the
More informationSTOCHASTIC COST ESTIMATION AND RISK ANALYSIS IN MANAGING SOFTWARE PROJECTS
STOCHASTIC COST ESTIMATION AND RISK ANALYSIS IN MANAGING SOFTWARE PROJECTS Dr A.M. Connor Software Engineering Research Lab Auckland University of Technology Auckland, New Zealand andrew.connor@aut.ac.nz
More informationCorso di Identificazione dei Modelli e Analisi dei Dati
Università degli Studi di Pavia Dipartimento di Ingegneria Industriale e dell Informazione Corso di Identificazione dei Modelli e Analisi dei Dati Central Limit Theorem and Law of Large Numbers Prof. Giuseppe
More informationCentral Limit Theorem (CLT) RLS
Central Limit Theorem (CLT) RLS Central Limit Theorem (CLT) Definition The sampling distribution of the sample mean is approximately normal with mean µ and standard deviation (of the sampling distribution
More informationMath 160 Professor Busken Chapter 5 Worksheets
Math 160 Professor Busken Chapter 5 Worksheets Name: 1. Find the expected value. Suppose you play a Pick 4 Lotto where you pay 50 to select a sequence of four digits, such as 2118. If you select the same
More informationA Study on M/M/C Queue Model under Monte Carlo simulation in Traffic Model
Volume 116 No. 1 017, 199-07 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.173/ijpam.v116i1.1 ijpam.eu A Study on M/M/C Queue Model under Monte Carlo
More informationFinal exam solutions
EE365 Stochastic Control / MS&E251 Stochastic Decision Models Profs. S. Lall, S. Boyd June 5 6 or June 6 7, 2013 Final exam solutions This is a 24 hour take-home final. Please turn it in to one of the
More informationLecture 8. The Binomial Distribution. Binomial Distribution. Binomial Distribution. Probability Distributions: Normal and Binomial
Lecture 8 The Binomial Distribution Probability Distributions: Normal and Binomial 1 2 Binomial Distribution >A binomial experiment possesses the following properties. The experiment consists of a fixed
More informationNo-Arbitrage ROM Simulation
Alois Geyer 1 Michael Hanke 2 Alex Weissensteiner 3 1 WU (Vienna University of Economics and Business) and Vienna Graduate School of Finance (VGSF) 2 Institute for Financial Services, University of Liechtenstein
More informatione.g. + 1 vol move in the 30delta Puts would be example of just a changing put skew
Calculating vol skew change risk (skew-vega) Ravi Jain 2012 Introduction An interesting and important risk in an options portfolio is the impact of a changing implied volatility skew. It is not uncommon
More informationMengdi Wang. July 3rd, Laboratory for Information and Decision Systems, M.I.T.
Practice July 3rd, 2012 Laboratory for Information and Decision Systems, M.I.T. 1 2 Infinite-Horizon DP Minimize over policies the objective cost function J π (x 0 ) = lim N E w k,k=0,1,... DP π = {µ 0,µ
More information4 Reinforcement Learning Basic Algorithms
Learning in Complex Systems Spring 2011 Lecture Notes Nahum Shimkin 4 Reinforcement Learning Basic Algorithms 4.1 Introduction RL methods essentially deal with the solution of (optimal) control problems
More informationSimulations Illustrate Flaw in Inflation Models
Journal of Business & Economic Policy Vol. 5, No. 4, December 2018 doi:10.30845/jbep.v5n4p2 Simulations Illustrate Flaw in Inflation Models Peter L. D Antonio, Ph.D. Molloy College Division of Business
More informationFREDRIK BAJERS VEJ 7 G 9220 AALBORG ØST Tlf.: URL: Fax: Monte Carlo methods
INSTITUT FOR MATEMATISKE FAG AALBORG UNIVERSITET FREDRIK BAJERS VEJ 7 G 9220 AALBORG ØST Tlf.: 96 35 88 63 URL: www.math.auc.dk Fax: 98 15 81 29 E-mail: jm@math.aau.dk Monte Carlo methods Monte Carlo methods
More informationMONTE-CARLO SIMULATION CALCULATION OF VAR (VALUE-AT-RISK) & CVAR (CONDITIONAL VALUE-AT-RISK)
MONTE-CARLO SIMULATION CALCULATION OF VAR (VALUE-AT-RISK) & CVAR (CONDITIONAL VALUE-AT-RISK) PRESENTER: SANJOY ROY 15-APR-2018 TERMINOLOGY V-a-R (Value-At-Risk) How much can one expect to lose Parameters
More informationMAFS Computational Methods for Pricing Structured Products
MAFS550 - Computational Methods for Pricing Structured Products Solution to Homework Two Course instructor: Prof YK Kwok 1 Expand f(x 0 ) and f(x 0 x) at x 0 into Taylor series, where f(x 0 ) = f(x 0 )
More informationECON 214 Elements of Statistics for Economists
ECON 214 Elements of Statistics for Economists Session 7 The Normal Distribution Part 1 Lecturer: Dr. Bernardin Senadza, Dept. of Economics Contact Information: bsenadza@ug.edu.gh College of Education
More informationProbability. An intro for calculus students P= Figure 1: A normal integral
Probability An intro for calculus students.8.6.4.2 P=.87 2 3 4 Figure : A normal integral Suppose we flip a coin 2 times; what is the probability that we get more than 2 heads? Suppose we roll a six-sided
More informationChapter 6. Importance sampling. 6.1 The basics
Chapter 6 Importance sampling 6.1 The basics To movtivate our discussion consider the following situation. We want to use Monte Carlo to compute µ E[X]. There is an event E such that P(E) is small but
More informationA distributed Laplace transform algorithm for European options
A distributed Laplace transform algorithm for European options 1 1 A. J. Davies, M. E. Honnor, C.-H. Lai, A. K. Parrott & S. Rout 1 Department of Physics, Astronomy and Mathematics, University of Hertfordshire,
More informationDiscrete Random Variables
Discrete Random Variables ST 370 A random variable is a numerical value associated with the outcome of an experiment. Discrete random variable When we can enumerate the possible values of the variable
More informationAnalytical Option Pricing under an Asymmetrically Displaced Double Gamma Jump-Diffusion Model
Analytical Option Pricing under an Asymmetrically Displaced Double Gamma Jump-Diffusion Model Advances in Computational Economics and Finance Univerity of Zürich, Switzerland Matthias Thul 1 Ally Quan
More informationOne-year trade mentoring program Trade Mentoring Program six ways of support 1-year post-sale
Smart Trader One-year trade mentoring program After selling a product to you our duty does not stop there. Post-sale-support we believe is the key point of your and our satisfaction. Hence we have brought
More informationReasoning with Uncertainty
Reasoning with Uncertainty Markov Decision Models Manfred Huber 2015 1 Markov Decision Process Models Markov models represent the behavior of a random process, including its internal state and the externally
More informationRapid computation of prices and deltas of nth to default swaps in the Li Model
Rapid computation of prices and deltas of nth to default swaps in the Li Model Mark Joshi, Dherminder Kainth QUARC RBS Group Risk Management Summary Basic description of an nth to default swap Introduction
More informationAlgorithmic Trading using Reinforcement Learning augmented with Hidden Markov Model
Algorithmic Trading using Reinforcement Learning augmented with Hidden Markov Model Simerjot Kaur (sk3391) Stanford University Abstract This work presents a novel algorithmic trading system based on reinforcement
More informationII - Probability. Counting Techniques. three rules of counting. 1multiplication rules. 2permutations. 3combinations
II - Probability Counting Techniques three rules of counting 1multiplication rules 2permutations 3combinations Section 2 - Probability (1) II - Probability Counting Techniques 1multiplication rules In
More informationOmitted Variables Bias in Regime-Switching Models with Slope-Constrained Estimators: Evidence from Monte Carlo Simulations
Journal of Statistical and Econometric Methods, vol. 2, no.3, 2013, 49-55 ISSN: 2051-5057 (print version), 2051-5065(online) Scienpress Ltd, 2013 Omitted Variables Bias in Regime-Switching Models with
More informationChapter 3 Discrete Random Variables and Probability Distributions
Chapter 3 Discrete Random Variables and Probability Distributions Part 4: Special Discrete Random Variable Distributions Sections 3.7 & 3.8 Geometric, Negative Binomial, Hypergeometric NOTE: The discrete
More informationName: Date: Pd: Quiz Review
Name: Date: Pd: Quiz Review 8.1-8.3 Multiple Choice Identify the choice that best completes the statement or answers the question. 1. A die is cast repeatedly until a 1 falls uppermost. Let the random
More informationExotic Derivatives & Structured Products. Zénó Farkas (MSCI)
Exotic Derivatives & Structured Products Zénó Farkas (MSCI) Part 1: Exotic Derivatives Over the counter products Generally more profitable (and more risky) than vanilla derivatives Why do they exist? Possible
More informationAP Statistics Review Ch. 6
AP Statistics Review Ch. 6 Name 1. Which of the following data sets is not continuous? a. The gallons of gasoline in a car. b. The time it takes to commute in a car. c. Number of goals scored by a hockey
More informationChapter 7. Random Variables: 7.1: Discrete and Continuous. Random Variables. 7.2: Means and Variances of. Random Variables
Chapter 7 Random Variables In Chapter 6, we learned that a!random phenomenon" was one that was unpredictable in the short term, but displayed a predictable pattern in the long run. In Statistics, we are
More information12 Math Chapter Review April 16 th, Multiple Choice Identify the choice that best completes the statement or answers the question.
Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Which situation does not describe a discrete random variable? A The number of cell phones per household.
More information-divergences and Monte Carlo methods
-divergences and Monte Carlo methods Summary - english version Ph.D. candidate OLARIU Emanuel Florentin Advisor Professor LUCHIAN Henri This thesis broadly concerns the use of -divergences mainly for variance
More informationCS 774 Project: Fall 2009 Version: November 27, 2009
CS 774 Project: Fall 2009 Version: November 27, 2009 Instructors: Peter Forsyth, paforsyt@uwaterloo.ca Office Hours: Tues: 4:00-5:00; Thurs: 11:00-12:00 Lectures:MWF 3:30-4:20 MC2036 Office: DC3631 CS
More informationOracle Financial Services Market Risk User Guide
Oracle Financial Services User Guide Release 8.0.4.0.0 March 2017 Contents 1. INTRODUCTION... 1 PURPOSE... 1 SCOPE... 1 2. INSTALLING THE SOLUTION... 3 2.1 MODEL UPLOAD... 3 2.2 LOADING THE DATA... 3 3.
More informationSection 7.5 The Normal Distribution. Section 7.6 Application of the Normal Distribution
Section 7.6 Application of the Normal Distribution A random variable that may take on infinitely many values is called a continuous random variable. A continuous probability distribution is defined by
More informationStochastic Simulation
Stochastic Simulation APPM 7400 Lesson 5: Generating (Some) Continuous Random Variables September 12, 2018 esson 5: Generating (Some) Continuous Random Variables Stochastic Simulation September 12, 2018
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationClass 12. Daniel B. Rowe, Ph.D. Department of Mathematics, Statistics, and Computer Science. Marquette University MATH 1700
Class 12 Daniel B. Rowe, Ph.D. Department of Mathematics, Statistics, and Computer Science Copyright 2017 by D.B. Rowe 1 Agenda: Recap Chapter 6.1-6.2 Lecture Chapter 6.3-6.5 Problem Solving Session. 2
More information