Rare-Event Simulation for Markov-Modulated Perpetuities

Slides:



Advertisements
Similar presentations
What is the sum of the following infinite series 1+x+x2+x3+…xn… where 0
Advertisements

Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review By Mary Kathryn Cowles and Bradley P. Carlin Presented by Yuting Qi 12/01/2006.
. Blast from the Past Find point(s) of intersection
Introduction to Algorithmic Trading Strategies Lecture 8 Risk Management Haksun Li
Gibbs Sampling Qianji Zheng Oct. 5th, 2010.
1 Monte Carlo Methods Week #5. 2 Introduction Monte Carlo (MC) Methods –do not assume complete knowledge of environment (unlike DP methods which assume.
Graphs of Exponential and Logarithmic Functions
RISK VALUATION. Risk can be valued using : Derivatives Valuation –Using valuation method –Value the gain Risk Management Valuation –Using statistical.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.
Ivan Bercovich Senior Lecture Series Friday, April 17 th, 2009.
Importance Sampling. What is Importance Sampling ? A simulation technique Used when we are interested in rare events Examples: Bit Error Rate on a channel,
5. Estimation 5.3 Estimation of the mean K. Desch – Statistical methods of data analysis SS10 Is an efficient estimator for μ ?  depends on the distribution.
Reinforcement Learning: Learning algorithms Yishay Mansour Tel-Aviv University.
Bayesian Analysis for Extreme Events Pao-Shin Chu and Xin Zhao Department of Meteorology School of Ocean & Earth Science & Technology University of Hawaii-
Bayes Factor Based on Han and Carlin (2001, JASA).
5-2 Probability Distributions This section introduces the important concept of a probability distribution, which gives the probability for each value of.
Priors, Normal Models, Computing Posteriors
Sampling Methods  Sampling refers to how observations are “selected” from a probability distribution when the simulation is run. 1.
More Indeterminate Forms Section 8.1b. Indeterminate Forms Limits that lead to these new indeterminate forms can sometimes be handled by taking logarithms.
Utilities and MDP: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Maximum a posteriori sequence estimation using Monte Carlo particle filters S. J. Godsill, A. Doucet, and M. West Annals of the Institute of Statistical.
Improved Cross Entropy Method For Estimation Presented by: Alex & Yanna.
Fang-Bo Yeh, Dept. of Mathematics, Tunghai Univ.2004.Jun.29 1 Financial Derivatives The Mathematics Fang-Bo Yeh Mathematics Department System and Control.
Numerical Methods for Stochastic Networks Peter W. Glynn Institute for Computational and Mathematical Engineering Management Science and Engineering Stanford.
MCMC reconstruction of the 2 HE cascade events Dmitry Chirkin, UW Madison.
Prabhas Chongstitvatana1 Monte Carlo integration It is a numerical probabilistic algorithm ab I/(b-a) f.
Monte Carlo Methods. Learn from complete sample returns – Only defined for episodic tasks Can work in different settings – On-line: no model necessary.
Review Exponential + Logarithmic Functions Math Analysis.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Dan Boneh Intro. Number Theory Arithmetic algorithms Online Cryptography Course Dan Boneh.
Reinforcement Learning: Learning algorithms Yishay Mansour Tel-Aviv University.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 17: Boltzmann Machines as Probabilistic Models Geoffrey Hinton.
Tangent Lines. EX 1.2 Estimating the Slope of a Curve Estimate the slope of y = sin x at x = 0.
 List the characteristics of the F distribution.  Conduct a test of hypothesis to determine whether the variances of two populations are equal.  Discuss.
1 Project Selection. 2 I. Project Selection: Non-Numeric Models Sacred Cow Operating Necessity Competitive Necessity Product Line Extension Comparative.
CALCULUS REVIEW BME 3510 C PO-WEI CHEN 8/19/2014.
CS498-EA Reasoning in AI Lecture #19 Professor: Eyal Amir Fall Semester 2011.
Session 9: Terminal Value
Monte Carlo Simulation
Advanced Statistical Computing Fall 2016
CS b553: Algorithms for Optimization and Learning
11.3 – Geometric Sequences and Series
Deadline Scheduling and Heavy tail distributionS
POMDPs Logistics Outline No class Wed
Chapter 1 Introduction to Simulation Modeling
Chapter 5: Monte Carlo Methods
Chapter 7: Sampling Distributions
Monte Carlo Simulation Managing uncertainty in complex environments.
Graduate School of Information Sciences, Tohoku University
Project Selection.
كيــف تكتـب خطـة بحـث سيئـة ؟؟
الدكتـور/ عبدالناصـر محمـد عبدالحميـد
ATLAST Deployment &Push Pack Spares Optimizer
Terminal Value The tail the wags the dog?
Stochastic-Based Accuracy of Data Reconciliation Estimators for Linear Systems. Nguyen Tanth, DuyQuang and Miguel Bagajewicz, Chemical, Biological and.
Lecture 2 – Monte Carlo method in finance
Monte Carlo Simulation of Neutrino Mass Measurements
Limits involving infinity
On Statistical Model Checking of Stochastic Systems
Bucket Renormalization for Approximate Inference
Warm Up – 1/2 - Thursday.
October 6, 2011 Dr. Itamar Arel College of Engineering
Communication Networks
Ch 3: Growth of Functions Ming-Te Chi
Monte Carlo integration
CECINA RIVER: SIMULATION OF THE 24/11-2/12/2003 FLOW EVENT
Discrete-time markov chain (continuation)
Geometric Sequences and Series
Maximum Likelihood Estimation (MLE)
Presentation transcript:

Rare-Event Simulation for Markov-Modulated Perpetuities Henry Lam Joint Work with Jose Blanchet and Bert Zwart

What is Perpetuity Infinite discounted sum of cash flows Discount rate           Time = 0 1 2 3 4   Cash flow          

Large Deviations Problem  

Assumptions  

First Passage Problem: Light vs Heavy Tail  

First Passage Problem: Simulation  

Tail Behavior of Perpetuity  

Naïve Exponential Tilting  

Key Ideas  

A More General Asymptotic  

A More General Asymptotic   Control on-off of IS

State-Dependent Importance Sampler  

Algorithm  

Markov Modulation  

Algorithm  

Theoretical Performance  

Logarithmic Efficiency  

Finite Termination and Running Time Analysis  

Numerical Example: ARCH(1)  

Numerical Example: ARCH(1) Crude Monte Carlo Estimate C.V. 95% C. I. State-Dependent Importance Sampler Estimate C.V. 95% C. I.

Concluding Remarks A problem with both light and heavy tail behavior Counter example in which naïve exponential tilting fails Novel use of Lyapunov inequality for analysis of state-dependent algorithm

Appendix 1: Efficiency  

Appendix 2: Finite Termination and Running Time Analysis  

Appendix 2: Finite Termination and Running Time Analysis                   Termination