6 EC
Semester 1, period 1, 2
5374SIMS6Y
Nowadays simulation methods based on random number generation on powerful computers play an important role in statistics. We highlight two methodologies, the bootstrap and Monte Carlo Markov chain simulation. The bootstrap method has been introduced in 1977 by Bradley Efron. This is a useful, generally applicable, but computationally intensive method to construct, for instance, confidence intervals. The basic idea of the method is resampling from the original data. The naive bootstrap, parametric bootstrap and smooth bootstrap shall be discussed. By running a computer simulated Markov chain for a suitably long time we can generate observations from a distribution close to the stationary distribution of the Markov chain. By choosing suitable transition probabilities practically any distribution can be simulated in this way. We will discuss the Gibbs and Metropolis Hastings algorithms, the basic algorithms for this kind of simulation, as well as some of their refinements, bearing in mind the relevance for statistics. Other simulation based statistical methods will also be briefly discussed.
The emphasis of this course is to provide some basic understanding and knowledge of simulation methods used in statistics and illustrate them through simple examples. Secondly, the course will shed light on the theory behind these techniques, which helps to understand why they work and when they would not work. We will not get into the details of programming itself and will not deal with specialized R packages. All the examples and exercises can be handled with simple R functions.
Lecture notes: The Bootstrap, Bert van Es and Hein Putter
Lecture notes: Monte Carlo Markov Chain Simulation, Bert van Es
R
Any additional material on topics about other simulation based statistical methods will be provided as pdf or accessible via UvA library.
The theory is presented during the lectures. The exercises serve as a way to get a grip on the theory (most will not be graded).
Activity |
Number of hours |
Lectures |
28 |
Self study |
66 |
Exercises |
66 |
This programme does not have requirements concerning attendance (TER-B).
Item and weight | Details |
Final grade | |
0.7 (70%) Tentamen | |
0.15 (15%) Assignment 1: bootstrap | |
0.15 (15%) Assignment 2: MCMC |
Apart from the two graded assignments described below, there is a final written exam (only theoretical questions or in the form of pseudocode) which counts for 70% of the grade. Exam grade needs to be at least 5 in order to pass the course.
The assignments do not count towards the resit exam, i.e. the resit counts for 100% of the final grade and it will include some practical (R) exercise as a replacement for Assignments 1-2.
For the exam and resit it is allowed to have one A4-sized double-sided handwritten cheat sheet.
Contact the course coordinator to make an appointment for inspection.
The bootstrap method
MCMC Simulation
The two assignments are individual and count each for 15% of the final grade. They consist of exercises that include mainly practical (R) questions.
Assignments are graded on a scale 1-10, without any minimum grade requirement. Assignments that are not handed in count as having grade 1.
Other theoretical exercises are suggested as practice exercises (not graded) and will be partially discussed in class.
The 'Regulations governing fraud and plagiarism for UvA students' applies to this course. This will be monitored carefully. Upon suspicion of fraud or plagiarism the Examinations Board of the programme will be informed. For the 'Regulations governing fraud and plagiarism for UvA students' see: www.student.uva.nl
Week number |
Topics | Chapters | Deadline Assignments |
1 | Introduction. Empirical distribution function. | Bootstrap: Chapters 1 and 2 | |
2 |
Different bootstrap methods. Bias and variance bootstrap estimators. |
Bootstrap: Chapter 3 | |
3 |
Bootstrapping by computer simulation. The Jackknife method. |
Bootstrap; Chapter 4, Chapter 5 | |
4 |
Bootstrap confidence intervals. Proof that the bootstrap works for the sample mean. |
Bootstrap: Chapter 6, Chapter 7 | |
5 | Example where the bootstrap fails and the m out on n bootstrap as a remedy. | Bootstrap: Chapter 8 | |
6 | Accuracy of the bootstrap. Studentized bootstrap, Kernel smoothing. | Bootstrap: Chapter 9 and Appendix C | |
7 | The smooth bootstrap | Bootstrap: Chapter 10 and Appendix B |
Assignment 1 (Oct 19) |
8 | |||
9 |
Introduction and standard simulation methods. |
MCMC: Chapters 1, 2 | |
10 |
Brief review of standard Markov Chains. MCMC chains, Gibbs and Metropolis Hastings samplers. |
MCMC: Chapters 3, 4 | |
11 | MCMC examples in univariate random number generation. | MCMC: Chapter 5 | |
12 | MCMC applications | MCMC: Chapters 6 and 7 | |
13 | Discussion on other simulation methods | Material on the selected topics will be provided |
Assignment 2 (Nov 30) |
14 | Discussion on other simulation methods |
Material on the selected topics will be provided |
|
15 |
Overview, Q&A |
||
16 |
Exam |
Measure Theoretic Probability, basic statistics, basic familiarity with R (an R manual can be found for example here: https://cran.r-project.org/manuals.html).