Skip to main content

2.1 due September 26

I don't understand why we care that the log of the gamma function is twice differentiable and convex. I can see why we would care about those things about the gamma function, but I'm not sure why we care about the log.

I think it is cool that we can find ways to take discrete functions and extend them to the real line (or the complex plane.) So much of life is extending our experiences to broader applications, that I enjoy seeing it in math.

For assignments without coding sections, I will usually spend an hour or two on the assignment. If there is a coding problem, it will probably add at least an extra hour (often more) to the assignment. (But you probably shouldn't use me as a benchmark.)

The repetition (reading, lecture, homework, lab) is helpful. I'm not sure what I would change.


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.