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

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.

Episode metadata supplied by the publisher feed · Published Jul 17, 2017

Embed this episode

Attribution link and audio player

NOW PLAYING

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

0:00 34:00

1×

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

No similar episodes found.

Similar Podcasts

CISO Perspectives (public) N2K Networks This season on CISO Perspectives, host Kim Jones explores some of the challenges of leading through uncertainty. We explore the complexity of the changing nature of regulation and working with the federal government, the evolution of privacy and fraud, and how emerging technologies like AI and quantum computing are changing cyber. When you don’t know what questions to ask, you’re afraid to ask, or don’t know who to ask, CISO Perspectives provides the foundation for learning in this brave new world.

Frequently Asked Questions

How long is this episode of Learning Machines 101?

This episode is 34 minutes long.

When was this Learning Machines 101 episode published?

This episode was published on July 17, 2017.

Can I download this Learning Machines 101 episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.

URL copied to clipboard!