Jump to content

COL776: Difference between revisions

From IITD Wiki
[checked revision][checked revision]
Creating course page via bot
 
Bot: wrap bare course codes in wikilinks
 
Line 4: Line 4:
| credits = 4
| credits = 4
| credit_structure = 3-0-2
| credit_structure = 3-0-2
| pre_requisites = MTL106 OR Equivalent
| pre_requisites = [[MTL106]] OR Equivalent
| overlaps =  
| overlaps =  
}}
}}

Latest revision as of 16:26, 14 April 2026

COL776
Learning probabilistic Graphical Models
Credits 4
Structure 3-0-2
Pre-requisites MTL106 OR Equivalent
Overlaps

COL776 : Learning probabilistic Graphical Models

Basics: Introduction. Undirected and Directed Graphical Models. Bayesian Networks. Markov Networks. Exponential Family Models. Factor Graph Representation. Hidden Markov Models. Conditional Random Fields. Triangulation and Chordal Graphs. Other Special Cases: Chains, Trees. Inference: Variable Elimination (Sum Product and Max-Product). Junction Tree Algorithm. Forward Backward Algorithm (for HMMs). Loopy Belief Propagation. Markov Chain Monte Carlo. Metropolis Hastings. Importance Sampling. Gibbs Sampling. Variational Inference. Learning: Discriminative Vs. Generative Learning. Parameter Estimation in Bayesian and Markov Networks. Structure Learning. EM: Handling Missing Data. Applications in Vision, Web/IR, NLP and Biology. Advanced Topics: Statistical Relational Learning, Markov Logic Networks.