
Explore Bayesian statistics and how it differs from classical statistics by incorporating prior beliefs, likelihood, and posterior updates using Bayes' formula, with density functions and real-world examples.
Explore the binomial distribution, a discrete two-outcome model with mean equal to n p and variance calculated differently, illustrated by coin toss data and convergence to normal for large n.
Learn how Markov chain Monte Carlo bridges prior and posterior distributions by sampling high-dimensional models, using Monte Carlo simulations and acceptance-based sampling methods such as Metropolis-Hastings.
Discover how the Metropolis-Hastings algorithm uses a Markov chain to sample from complex distributions, employing proposals from a normal distribution, acceptance probability, burn-in, and thinning to mitigate autocorrelation.
Explore the Metropolis Hastings algorithm with an interactive dashboard that lets you sample a one-dimensional distribution and adjust iterations, burn-in, and proposal variance to observe convergence and rejections.
Explore an interactive Metropolis-Hastings dashboard that samples from a complex one-dimensional distribution with two moments, showing how chain length and starting points affect convergence.
Explore an interactive Metropolis Hastings dashboard for a two dimensional distribution, adjust centers and coordinates of multivariate normal distributions, and observe density estimation and stability with increasing steps.
Prepare your workspace for probabilistic programming with Julia by downloading and installing Trulia and Atom, then install the Uber package and test the connection.
Install Anaconda and Python, create a dedicated pymc3 environment, and install pymc3. Launch Anaconda Navigator, start a notebook, and import pymc3 as pm to begin probabilistic programming.
Explore k means, a clustering algorithm that assigns observations to k clusters and iterates centers until convergence. Learn how to choose the number of clusters and apply the able method.
Master gaussian mixture modeling in Julia by building a two-component dataset, fitting a GMM, and comparing soft probabilities with hard kmeans while visualizing results.
Learn to cluster data with a three-component gaussian mixture model in Python, compare it to traditional k-means, and explore soft probability boundaries and component predictions.
Please remove the file-extension .txt from "LinearRegression.jl.txt".
Please remove the file-extension .txt from "LinearRegression.ipynb.txt".
In this lecture you will learn to develop a Bayesian Logistic Regression model.
Before using the Julia file you need to rename it by removing the filetype ".txt" (Udemy does not allow to upload jl-files).
Please remove the file-extension .txt from "LogisticRegression.ipynb.txt".
You want to know and to learn one of the top 10 most influencial algorithms of the 20th century? Then you are right in this course. We will cover many powerful techniques from the field of probabilistic programming. This field is fast-growing, because these technique are getting more and more famous and proof to be efficient and reliable.
We will cover all major fields of Probabilistic Programming: Distributions, Markov Chain Monte Carlo, Gaussian Mixture Models, Bayesian Linear Regression, Bayesian Logistic Regression, and hidden Markov models.
For each field, the algorithms are shown in detail: Their core concepts are presented in 101 lectures. Here, you will learn how the algorithm works. Then we implement it together in coding lectures. These are available for Python and Julia. With this knowledge you can clearly identify a problem at hand and develop a plan of attack to solve it.
Mastering this course will enable you to understand the concepts of probabilistic programming and you will be able to apply this in your private and professional projects.