perfect simulation for bayesian networks
play

Perfect simulation for Bayesian Networks Andressa Cerqueira and - PowerPoint PPT Presentation

Probabilistic Graphical Models Bayesian Networks Questions References Perfect simulation for Bayesian Networks Andressa Cerqueira and Florencia Leonardi II NeuroMat Workshop: New Frontiers in Neuromathematics S ao Paulo, 22 de Novembro de


  1. Probabilistic Graphical Models Bayesian Networks Questions References Perfect simulation for Bayesian Networks Andressa Cerqueira and Florencia Leonardi II NeuroMat Workshop: New Frontiers in Neuromathematics S˜ ao Paulo, 22 de Novembro de 2016 Perfect simulation for Bayesian Networks

  2. Probabilistic Graphical Models Bayesian Networks Questions References Probabilistic Graphical Models ◮ Model: is a representation of our understanding of the world; ◮ Probabilistic: these models are designed to help us deal with large amounts of uncertainty; ◮ Graphical: the idea here is to use graphs to allow us to represent complex systems that involve a large number of variables. Perfect simulation for Bayesian Networks

  3. Probabilistic Graphical Models Bayesian Networks Questions References Probabilistic Graphical Models - Example ◮ Situation: A student who takes a course in the university; ◮ Variables: the intelligence of the student, the difficulty of the course, the grade of the student, the recommendation letter that the student gets Perfect simulation for Bayesian Networks

  4. Probabilistic Graphical Models Bayesian Networks Questions References Probabilistic Graphical Models - Example ◮ Situation: A student who takes a course in the university; ◮ Variables: the intelligence of the student, the difficulty of the course, the grade of the student, the recommendation letter that the student gets Perfect simulation for Bayesian Networks

  5. Probabilistic Graphical Models Bayesian Networks Questions References Bayesian Networks ◮ P ( grade | intelligence , difficulty ) ◮ P ( letter | grade ) ◮ letter and intelligence are conditionally independent given grade; ◮ letter and difficulty are conditionally independent given grade; ◮ intelligence and difficulty are called parents of grade; ◮ grade is called child of intelligence and difficulty. Perfect simulation for Bayesian Networks

  6. Probabilistic Graphical Models Bayesian Networks Questions References Bayesian Networks ◮ Letter ∈ { excelent, good, regular } ◮ I want to sample from the variable Letter. How can I do it? Perfect simulation for Bayesian Networks

  7. Probabilistic Graphical Models Bayesian Networks Questions References Bayesian Networks Problem: How do we sample from a variable in a graph with thousands of vertices? Sampling from all the vertices might be extremely demanding !!! Perfect simulation for Bayesian Networks

  8. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ To sample from X 1 , we need to know: X 4 X 5 X 6 X 7 ◮ ∅ , { X 2 } , { X 2 , X 3 } X 2 X 3 X 1 Perfect simulation for Bayesian Networks

  9. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ ∅ , { X 2 } , { X 2 , X 3 } X 4 X 5 X 6 X 7 X 2 X 3 X 1 Perfect simulation for Bayesian Networks

  10. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ To sample from X 2 , we need to know: X 4 X 5 X 6 X 7 ◮ ∅ , { X 4 } , { X 4 , X 5 } X 2 X 3 X 1 Perfect simulation for Bayesian Networks

  11. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ ∅ , { X 4 } , { X 4 , X 5 } X 4 X 5 X 6 X 7 X 2 X 3 X 1 Perfect simulation for Bayesian Networks

  12. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ To sample from X 3 , we need to know: X 4 X 5 X 6 X 7 ◮ ∅ , { X 6 } , { X 6 , X 7 } X 2 X 3 X 1 Perfect simulation for Bayesian Networks

  13. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ ∅ , { X 6 } , { X 6 , X 7 } X 4 X 5 X 6 X 7 X 2 X 3 X 1 Perfect simulation for Bayesian Networks

  14. Probabilistic Graphical Models Bayesian Networks Questions References X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 ◮ To sample from X 4 , we need to know: X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ ∅ , { X 8 } , { X 8 , X 9 } ◮ To sample from X 4 X 5 X 6 X 7 X 6 , we need to know: ◮ ∅ , { X 12 } , X 2 X 3 { X 12 , X 13 } X 1 Perfect simulation for Bayesian Networks

  15. Probabilistic Graphical Models Bayesian Networks Questions References ◮ To sample from X 16 X 17 X 18 X 19 X 20 X 21 X 22 X 23 X 24 X 25 X 26 X 27 X 28 X 29 X 30 X 31 X 7 , we need to know: X 8 X 9 X 10 X 11 X 12 X 13 X 14 X 15 ◮ ∅ , { X 14 } , { X 14 , X 15 } ◮ To sample from X 4 X 5 X 6 X 7 X 14 , we need to know: ◮ ∅ , { X 28 } , X 2 X 3 { X 28 , X 29 } X 1 Perfect simulation for Bayesian Networks

  16. Probabilistic Graphical Models Bayesian Networks Questions References Questions: ◮ How can we define the probability to select a subset of the parents of X 1 ? P (to choose ∅ ), P (to choose { X 2 } ) and P (to choose { X 2 , X 3 } ) ◮ How can we define the probability of X 1 given a subset of its parents? P ( X 1 |∅ ), P ( X 1 | X 2 ) and P ( X 1 | X 2 , X 3 ) ◮ Study conditions to guarantee that the number of steps of the algorithm is sufficiently small. Perfect simulation for Bayesian Networks

  17. Probabilistic Graphical Models Bayesian Networks Questions References References Koller, Daphne and Friedman, Nir. Probabilistic graphical models: principles and techniques . MIT press. Galves, Antonio, L¨ ocherbach, Eva, & Orlandi, Enza. 2010. Perfect simulation of infinite range Gibbs measures and coupling with their finite range approximations. Journal of Statistical Physics , 138 (1-3), 476–495. Galves, Antonio, Garcia, NL, L¨ ocherbach, E, Orlandi, Enza, et al. . 2013. Kalikow-type decomposition for multicolor infinite range particle systems. The Annals of Applied Probability , 23 (4), 1629–1659. Perfect simulation for Bayesian Networks

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend