t
play

t ' ! tractable probabilistic inference meeting ! December 11th - PowerPoint PPT Presentation

t ' ! tractable probabilistic inference meeting ! December 11th 2019 - NeurIPS 2019 , Vancouver Lets discuss about the current state of flexible , reliable , and efficient probabilistic inference and learning and where we want it to be! 2


  1. t ' ! tractable probabilistic inference meeting ! December 11th 2019 - NeurIPS 2019 , Vancouver

  2. Let’s discuss about the current state of flexible , reliable , and efficient probabilistic inference and learning… and where we want it to be! 2 /26

  3. 3 /26

  4. Schedule 7:15 - 7:30 Opening 7:30 - 8:00 Spotlight talks: Eric , Eli 8:00 - 8:30 Open discussions 8:30 - 9:15 Spotlight talks: Hong , Molham , Pasha 9:15 - 10:00 Open discussions 10:00 Closing remarks 4 /26

  5. Spotlights Eric Eli Hong Pasha Molham Nalisnick Bingham Ge Khosravi Aref 5 /26

  6. Let’s keep in touch! feel free to join the t’ newsletter 6 /26

  7. Why probabilistic inference? 7 /26

  8. Why probabilistic inference? To enable and support decision making in the real world. 8 /26

  9. Why probabilistic inference? To enable and support robust decision making on noisy, heterogeneous, complex data. 9 /26

  10. Why efficient, reliable and flexible probabilistic inference? To enable and support robust decision making on noisy, heterogeneous, complex data. 10 /26

  11. Fully factorized NaiveBayes AndOrGraphs PDGs Trees PSDDs CNets LTMs SPNs NADEs Thin Junction Trees ACs MADEs MAFs VAEs Polytrees FVSBNs TACs IAFs NAFs RAEs Mixtures BNs NICE FGs GANs RealNVP MNs The Alphabet Soup of probabilistic models 11 /26

  12. Fully factorized NaiveBayes AndOrGraphs PDGs Trees PSDDs CNets LTMs SPNs NADEs Thin Junction Trees ACs MADEs MAFs VAEs Polytrees FVSBNs TACs IAFs NAFs RAEs Mixtures BNs NICE FGs GANs RealNVP MNs Intractable and tractable models 12 /26

  13. Fully factorized NaiveBayes AndOrGraphs PDGs Trees PSDDs CNets LTMs SPNs NADEs Thin Junction Trees ACs MADEs MAFs VAEs Polytrees FVSBNs TACs IAFs NAFs RAEs Mixtures BNs NICE FGs GANs RealNVP MNs tractability is a spectrum 13 /26

  14. Fully factorized NaiveBayes AndOrGraphs PDGs Trees PSDDs CNets LTMs SPNs NADEs Thin Junction Trees ACs MADEs MAFs VAEs Polytrees FVSBNs TACs IAFs NAFs RAEs Mixtures BNs NICE FGs GANs RealNVP MNs What about flexibility and expressiveness? 14 /26

  15. Can your GAN provide you calibrated uncertainties? t ' ! 15 /26

  16. Can your VAE inpaint any pixel patch? t ' ! 16 /26

  17. Can your Flow fl awlessly deal with missing values? t ' ! 17 /26

  18. Fully factorized NaiveBayes AndOrGraphs PDGs Trees PSDDs CNets LTMs SPNs NADEs Thin Junction Trees ACs MADEs MAFs VAEs Polytrees FVSBNs TACs IAFs NAFs RAEs Mixtures BNs NICE FGs GANs RealNVP MNs Do tractable models solve everything? 18 /26

  19. Can you generate hi-res images with your SPN? t ' ! 19 /26

  20. Can you scale learning a PSDD on Imagenet? t ' ! 20 /26

  21. Can your circuit deal with non-axis aligned constraints? t ' ! 21 /26

  22. enalisnick.github.io Spotlights Eric Nalisnick University of Cambridge & Deepmind Normalizing Flows for Tractable Probabilistic Modeling and Inference 22 /26

  23. pyro.io Spotlights Eli Bingham Uber AI Labs Practical Parallel Variable Elimination Algorithms 23 /26

  24. web.cs.ucla.edu/~pashak/ Spotlights Pasha Khosravi University of California, Los Angeles Juice.jl: a Julia library for advanced probabilistic inference 24 /26

  25. mlg.eng.cam.ac.uk/hong/ Spotlights Hong Ge University of Cambridge Turing: a robust, efficient and modular library for flexible probabilistic inference 25 /26

  26. Let’s keep in touch! feel free to join the t’ newsletter And let’s meet at the second t’! news soon 26 /26

Recommend


More recommend