User:IssaRice/Metropolis–Hastings algorithm

From Machinelearning
Revision as of 07:13, 7 February 2020 by IssaRice (talk | contribs) (Created page with "without exception, every single explanation i have seen so far of this absolutely sucks. like, not just "most really suck, and some suck a little". literally everything just s...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

without exception, every single explanation i have seen so far of this absolutely sucks. like, not just "most really suck, and some suck a little". literally everything just sucks really bad. this might be my best guess for the most horribly-explained thing ever.

in my opinion, the things a good explanation must cover are:

  • what the heck is sampling, even? once we have a fair coin, use that to generate samples for:
    • arbitrary biased coin
    • a discrete uniform distribution over 1,...,n
    • a continuous uniform(0,1) distribution
    • use a continuous uniform to sample from an arbitrary distribution using inverse transform sampling
    • bonus: go from a biased coin (with unknown bias) to a fair coin
  • why doesn't inverse transform sampling work in situations where we have to use metropolis-hastings?
  • an actually convincing example of MCMC. the stuff i've seen so far are so boring i just don't even care if we can sample from it.