LM101-066: How to Solve Constraint Satisfaction Problems using MCMC Methods (Rerun)

07.17.2017 - By Learning Machines 101

Download our free app to listen on your phone

In this episode of Learning Machines 101 (www.learningmachines101.com) we discuss how to solve constraint satisfaction inference problems where knowledge is represented as a large unordered collection of complicated probabilistic constraints among a collection of variables. The goal of the inference process is to infer the most probable values of the unobservable variables given the observable variables. Specifically, Monte Carlo Markov Chain ( MCMC ) methods are discussed.

More episodes from Learning Machines 101