Skip to content

Commit 5da7684

Browse files
committed
T1
1 parent 3b8c44f commit 5da7684

File tree

2 files changed

+102
-0
lines changed

2 files changed

+102
-0
lines changed
157 KB
Binary file not shown.
Lines changed: 102 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,102 @@
1+
\documentclass[a4paper,10pt, notitlepage]{report}
2+
\usepackage[utf8]{inputenc}
3+
\usepackage{natbib}
4+
\usepackage{amssymb}
5+
\usepackage{amsmath}
6+
\usepackage[shortlabels]{enumitem}
7+
% \usepackage[portuguese]{babel}
8+
9+
10+
% Title Page
11+
\title{Assignment 1: Algorithms Galore!}
12+
\author{Computational Statistics \\ Instructor: Luiz Max de Carvalho}
13+
14+
\begin{document}
15+
\maketitle
16+
17+
\textbf{Hand-in date: 19/11/2021.}
18+
19+
\section*{General guidance}
20+
\begin{itemize}
21+
\item State and prove all non-trivial mathematical results necessary to substantiate your arguments;
22+
\item Do not forget to add appropriate scholarly references~\textit{at the end} of the document;
23+
\item Mathematical expressions also receive punctuation;
24+
\item Please hand in a single PDF file as your final main document.
25+
26+
Code appendices are welcome,~\textit{in addition} to the main PDF document.
27+
\end{itemize}
28+
29+
\newpage
30+
31+
\section*{Background}
32+
33+
By now we have seen quite a few methods for computing integrals~\textit{via} Monte Carlo.
34+
Each method has its own advantages and drawbacks.
35+
It is important that we understand these properties in order to apply the methods effectively.
36+
In this assignment we will continue studying the problem of computing the average distance between two points on a disk, this time from the perspective of method comparison.
37+
That is to say that in this assignment you will experience the microcosm of comparing several methods for solving a problem for which we happen to know the right answer in closed-form.
38+
39+
Recall that we want to compute
40+
\begin{align*}
41+
I &= \frac{1}{\pi^2 R^4}\int_{0}^{R}\int_{0}^{R}\int_{0}^{2\pi}\int_{0}^{2\pi}\sqrt{r_1^2 + r_2^2 - 2r_1r_2\cos\phi(\theta_1, \theta_2)}r_1r_2\,d\theta_1\,d\theta_2\,dr_1\,dr_2,\\
42+
&= \frac{2^7}{45\pi}R,
43+
\end{align*}
44+
where $\phi(\theta_1, \theta_2)$ is the central angle between $r_1$ and $r_2$.
45+
46+
Here we will do something a bit risky: we will compare a few methods to compute $I$ using a bunch of different methods without knowing in advance which will work best or if there are going to be any differences at all.
47+
Welcome to Science!
48+
49+
50+
\section*{Methods}
51+
52+
Here we will list a selection of methods that will be randomly assigned to each student, along with some questions that need to be answered for that particular method.
53+
\begin{itemize}
54+
\item \textbf{Rejection sampling}
55+
\begin{itemize}
56+
\item Justify your choice of proposal distribution and show that it conforms to the necessary conditions for the algorithm to work; in particular, try to find a proposal that gives the highest acceptance probability.
57+
\end{itemize}
58+
\item \textbf{Importance sampling}
59+
\begin{itemize}
60+
\item Justify your choice of proposal based on the variance of the resulting estimator.
61+
\end{itemize}
62+
\item \textbf{Gibbs sampling}
63+
\begin{itemize}
64+
\item Write your full conditionals out and show that they adhere to the Hammersley-Clifford condition.
65+
\end{itemize}
66+
\item \textbf{Metropolis-Hastings}
67+
\begin{itemize}
68+
\item Justify your choice of proposal; test different ones if you need to.
69+
\end{itemize}
70+
\item \textbf{Static Hamiltonian Monte Carlo}
71+
\begin{itemize}
72+
\item Comment on the choice of step size ($\varepsilon$) and integration time ($\tau$).
73+
\end{itemize}
74+
\end{itemize}
75+
76+
77+
\section*{Questions}
78+
79+
\begin{enumerate}
80+
\item You have been (randomly) assigned a method from the previous section.
81+
Represent $I$ as $\int_{\mathcal{X}} \phi(x)\pi(x)\,dx$ and justify your choice of $\phi$, $\pi$ and $\mathcal{X}$.
82+
Recall that these choices are arbitrary up to a point, but they might lead to wildly different empirical performances~\textbf{and} theoretical properties for estimators of $I$.
83+
\textbf{Justify} your choices in light of the method you have been given to work with.
84+
Choose wisely and be rigorous in your justifications.
85+
\item Again, starting from the eventual samples you will obtain with your method, construct a non-empty\footnote{This is a joke. It means you should come up with at least one estimator. But you might, and are even encouraged to, entertain more than one estimator.} family of estimators of $I$ and discuss whether it is (strongly) consistent and whether a central limit theorem can be established.
86+
\item Detail a suite of diagnostics that might be employed in your application to detect convergence or performance problems.
87+
Extra points for those who design algorithms that exploit the structure of this particular integration problem.
88+
\item For each $R \in \{0.01, 0.1, 1, 10, 100, 1000, 10000\}$, perform $M=500$ runs from your simulation method and compute: (i) variance (ii) bias (iii) standard deviation of the mean (MCSE).
89+
\item Can you identify one key quantity missing from the previous item?
90+
\textit{Hint:} it bears relevance to the real world application of any computational method.
91+
\end{enumerate}
92+
93+
\textbf{Warning:} the questions in this assignment might seem deceptively simple; do not be fooled. I expect a lot of effort from you in making your method work the best it can. This entails loads of failed derivations and experiments, which you are encouraged to report in order to document the discovery process.
94+
Also, feel free to include answers to questions that have not been asked, if you feel they are relevant.
95+
Make loads of figures and tables and let your scientific imagination run wild!
96+
Good luck!
97+
98+
%
99+
% \bibliographystyle{apalike}
100+
% \bibliography{refs}
101+
102+
\end{document}

0 commit comments

Comments
 (0)