Skip to content

Implementation of various inference and learning algorithms for Probabilistic Graphical Models (PGMs) without off-the-shelf libraries. Also includes projects from the PGM specialization on Coursera offered by Stanford.

Notifications You must be signed in to change notification settings

anmold-07/Probabilistic-Graphical-Models-from-Scratch

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 

Repository files navigation

This repository contains implementations for inference and learning in probabilistic graphical models from scratch. Detailed code and tutorials are provided for both Directed and Undirected Graphical Models, in MATLAB and Python. Additional algorithms may be added in the future.

Directed Graphical Models (Bayesian Networks)

  • Belief Propagation Algorithm
  • Variable Elimination
  • Probabilistic Approximation Algorithms:
    • Likelihood Weighted Sampling
    • Monte Carlo Markov Chain (MCMC)
  • Deterministic Approximation Algorithms:
    • Variational Mean-field Posterior Probability Inference
  • (Learning) Maximum Likelihood Estimation (MLE)

Undirected Graphical Models (Markov and Conditional Random Fields)

  • Belief Propagation:
    • Sum-Product Algorithm
    • Max-Sum Algorithm
  • (Learning) Optimization Technique:
    • Stochastic Gradient Descent

About

Implementation of various inference and learning algorithms for Probabilistic Graphical Models (PGMs) without off-the-shelf libraries. Also includes projects from the PGM specialization on Coursera offered by Stanford.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published