Skip to main content

6.5 due November 12

The trickiest part of this section for me was keeping track of the parts of the formulas. They were rather messier than most that we've done.

I do think it is cool how the math helps you whether you know the distribution and need to figure out what will happen, or you know what happened and need the distribution, or you have some samples and need to estimate what will happen next.

Comments

Popular posts from this blog

7.2 due November 19

The thing I didn't understand about this section is why we need to use a distribution Q instead of just sampling uniformly (which I guess is a distribution...) when we are trying to do rejection sampling. I think it is because it speeds things up as it will have fewer rejections than a rectangle would. This section seems like we are learning more of what we just learned. I understand most of it, but I'm not sure I would recognize when I should use any of the techniques in this section.

4.2 due October 10

The hardest thing for me in this section is following all the details of actually implementing a search. The general "go here, then here, then here" makes sense, but keeping track of all the stacks and dictionaries and lists is what takes me the most time. I liked the cartoon example of what a depth first search would look like in real life. It both made me laugh and made me think.