LM101-043: How to Learn a Monte Carlo Markov Chain to Solve Constraint Satisfaction Problems (Rerun of Episode 22)
About this episode
Welcome to the 43rd Episode of Learning Machines 101!
We are currently presenting a subsequence of episodes covering the events of the recent Neural Information Processing Systems Conference. However, this week
will digress with a rerun of Episode 22 which nicely complements our previous discussion of the Monte Carlo Markov Chain Algorithm Tutorial. Specifically, today we
discuss the problem of approaches for learning or equivalently parameter estimation in Monte Carlo Markov Chain algorithms. The topics covered in this episode include: What is the pseudolikelihood method and what are its advantages and disadvantages?
What is Monte Carlo Expectation Maximization? And...as a bonus prize...a mathematical theory of "dreaming"!!! The current plan is to return
to coverage of the Neural Information Processing Systems Conference in 2 weeks on January 25!! Check out: www.learningmachines101.com for more details!
Get every episode summarized
Each time Learning Machines 101 publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Learning Machines 101
LM101-086: Ch8: How to Learn the Probability of Infinitely Many Outcomes
Learning Machines 101
LM101-085:Ch7:How to Guarantee your Batch Learning Algorithm Converges
Learning Machines 101
LM101-084: Ch6: How to Analyze the Behavior of Smart Dynamical Systems
Learning Machines 101
LM101-083: Ch5: How to Use Calculus to Design Learning Machines
Learning Machines 101