Inference algorithms and sampling techniques
summary
Covers Monte Carlo-based inference methods for generative probabilistic models, focusing on sampling algorithms such as Gibbs sampling and priors like Dirichlet and Wishart. Walks through applying these techniques to real-world problems, showing step-by-step modeling, algorithm application, and practical challenges encountered when building data science solutions.
AI-written summary · about
chapters (11)
- 0:00Start
- 6:39Joint distributions
- 10:273D normal distribution around centroid
- 10:39Probability Distributions
- 12:22Dirichlet Distribution
- 13:03Generative model
- 14:53Inferencing problem
- 15:57Inferring the parameters
- 17:37Gibbs sampling (contd)
- 20:12Code pointers
- 21:00Resume Parsing - Problem statement
related talks
01h 04mNonparametric Bayesian Methods: Models, Algorithms, and Applications II
01h 03mA Personal Viewpoint on Probabilistic Programming
23mDynamic inference in probabilistic graphical models
01h 31mProbabilistic Programming and Bayesian Inference in Python
11mExact Inference for Discrete Probabilistic Programs via Generating Functions
39mSaaaS - Sampling as an Algorithm Service
43mThe Power of Probabilistic Programming
31mProbabilistic Programming: The What, Why and How
