This platform seems like a perfect place to be my journal in studying Markov Chain Monte Carlo methods.The repo is public https://github.com/ridhoma/monte-cafe
github.com/ridhoma/mont...
github.com/ridhoma/mont...
github.com/ridhoma/mont...
It's quite fascinating that a very simple algorithm relying on random search can be used to approximate an NP-Hard optimization problem.
It's quite fascinating that a very simple algorithm relying on random search can be used to approximate an NP-Hard optimization problem.
1. Assumption/priors building
2. Numerical method to get the posterior
I find this course from CMU a good starting point to learn #2 fundamental levels. I will use this as my guide
gi1242.codeberg.page/cmu-math-cs-...
1. Assumption/priors building
2. Numerical method to get the posterior
I find this course from CMU a good starting point to learn #2 fundamental levels. I will use this as my guide
gi1242.codeberg.page/cmu-math-cs-...
I'll start with the very basics, the first chapter of any books: Stochastically estimating pi using the circle-in-a-square model.
I'll start with the very basics, the first chapter of any books: Stochastically estimating pi using the circle-in-a-square model.