structured probability spaces
play

Structured Probability Spaces Guy Van den Broeck UCLA Stats Seminar - PowerPoint PPT Presentation

Tractable Learning in Structured Probability Spaces Guy Van den Broeck UCLA Stats Seminar Jan 17, 2017 Outline 1. Structured probability spaces? 2. Specification language Logic 3. Deep architecture Logic + Probability 4. Learning


  1. Tractable Learning in Structured Probability Spaces Guy Van den Broeck UCLA Stats Seminar Jan 17, 2017

  2. Outline 1. Structured probability spaces? 2. Specification language Logic 3. “Deep architecture” Logic + Probability 4. Learning PSDDs Logic + Probability + Machine Learning 5. Conclusions

  3. References Probabilistic Sentential Decision Diagrams Doga Kisa, Guy Van den Broeck, Arthur Choi and Adnan Darwiche KR, 2014 Learning with Massive Logical Constraints Doga Kisa, Guy Van den Broeck, Arthur Choi and Adnan Darwiche ICML 2014 workshop Tractable Learning for Structured Probability Spaces Arthur Choi, Guy Van den Broeck and Adnan Darwiche IJCAI, 2015 Tractable Learning for Complex Probability Queries Jessa Bekker, Jesse Davis, Arthur Choi, Adnan Darwiche, Guy Van den Broeck. NIPS, 2015 Structured Features in Naive Bayes Classifiers Arthur Choi, Nazgol Tavabi and Adnan Darwiche AAAI, 2016 Tractable Operations on Arithmetic Circuits Jason Shen, Arthur Choi and Adnan Darwiche NIPS, 2016

  4. Structured probability spaces?

  5. Running Example Courses: Data • Logic (L) • Knowledge Representation (K) • Probability (P) • Artificial Intelligence (A) Constraints • Must take at least one of Probability or Logic. • Probability is a prerequisite for AI. • The prerequisites for KR is either AI or Logic.

  6. Probability Space unstructured L K P A 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1

  7. Structured Probability Space unstructured structured L K P A L K P A 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 • Must take at least one of 0 0 1 0 0 0 1 0 Probability or Logic. 0 0 1 1 0 0 1 1 • Probability is a prerequisite for AI. 0 1 0 0 0 1 0 0 • 0 1 0 1 The prerequisites for KR is 0 1 0 1 0 1 1 0 either AI or Logic. 0 1 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 7 out of 16 instantiations 1 0 1 1 1 0 1 1 are impossible 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1

  8. Learning with Constraints Data Statistical Model Learn (Distribution) Constraints (Background Knowledge) (Physics) Learn a statistical model that assigns zero probability to instantiations that violate the constraints.

  9. Example: Video [Lu, W. L., Ting, J. A., Little, J. J., & Murphy, K. P. (2013). Learning to track and identify players from broadcast sports videos.]

  10. Example: Video [Lu, W. L., Ting, J. A., Little, J. J., & Murphy, K. P. (2013). Learning to track and identify players from broadcast sports videos.]

  11. Example: Language • Non-local dependencies: At least one verb in each sentence [Chang, M., Ratinov, L., & Roth, D. (2008). Constraints as prior knowledge],…, [ Chang, M. W., Ratinov, L., & Roth, D. (2012). Structured learning with constrained conditional models.], [https://en.wikipedia.org/wiki/Constrained_conditional_model]

  12. Example: Language • Non-local dependencies: At least one verb in each sentence Sentence compression If a modifier is kept, its subject is also kept [Chang, M., Ratinov, L., & Roth, D. (2008). Constraints as prior knowledge],…, [ Chang, M. W., Ratinov, L., & Roth, D. (2012). Structured learning with constrained conditional models.], [https://en.wikipedia.org/wiki/Constrained_conditional_model]

  13. Example: Language • Non-local dependencies: At least one verb in each sentence Sentence compression If a modifier is kept, its subject is also kept Information extraction [Chang, M., Ratinov, L., & Roth, D. (2008). Constraints as prior knowledge],…, [ Chang, M. W., Ratinov, L., & Roth, D. (2012). Structured learning with constrained conditional models.], [https://en.wikipedia.org/wiki/Constrained_conditional_model]

  14. Example: Language • Non-local dependencies: At least one verb in each sentence Sentence compression If a modifier is kept, its subject is also kept Information extraction • Semantic role labeling • … and many more! [Chang, M., Ratinov, L., & Roth, D. (2008). Constraints as prior knowledge],…, [ Chang, M. W., Ratinov, L., & Roth, D. (2012). Structured learning with constrained conditional models.], [https://en.wikipedia.org/wiki/Constrained_conditional_model]

  15. Bayesian network synthesized from specs of power system (NASA Ames): Has many constraints (0/1 parameters) due to domain ``physics’’

  16. Example: Deep Learning [Graves, A., Wayne, G., Reynolds, M., Harley, T., Danihelka, I., Grabska- Barwińska , A., et al.. (2016). Hybrid computing using a neural network with dynamic external memory. Nature , 538 (7626), 471-476.]

  17. Example: Deep Learning [Graves, A., Wayne, G., Reynolds, M., Harley, T., Danihelka, I., Grabska- Barwińska , A., et al.. (2016). Hybrid computing using a neural network with dynamic external memory. Nature , 538 (7626), 471-476.]

  18. Example: Deep Learning [Graves, A., Wayne, G., Reynolds, M., Harley, T., Danihelka, I., Grabska- Barwińska , A., et al.. (2016). Hybrid computing using a neural network with dynamic external memory. Nature , 538 (7626), 471-476.]

  19. Example: Deep Learning [Graves, A., Wayne, G., Reynolds, M., Harley, T., Danihelka, I., Grabska- Barwińska , A., et al.. (2016). Hybrid computing using a neural network with dynamic external memory. Nature , 538 (7626), 471-476.]

  20. What are people doing now? • Ignore constraints • Handcraft into models • Use specialized distributions • Find non-structured encoding • Try to learn constraints • Hack your way around

  21. What are people doing now? • Ignore constraints • Handcraft into models • Use specialized distributions Accuracy ? • Find non-structured encoding Specialized skill ? • Try to learn constraints Intractable inference ? • Hack your way around Intractable learning ? Waste parameters ? Risk predicting out of space ? + you are on your own 

  22. Structured Probability Spaces • Everywhere in ML! – Configuration problems, inventory, video, text, deep learning – Planning and diagnosis (physics) – Causal models: cooking scenarios (interpreting videos) – Combinatorial objects: parse trees, rankings, directed acyclic graphs, trees, simple paths, game traces, etc.

  23. Structured Probability Spaces • Everywhere in ML! – Configuration problems, inventory, video, text, deep learning – Planning and diagnosis (physics) – Causal models: cooking scenarios (interpreting videos) – Combinatorial objects: parse trees, rankings, directed acyclic graphs, trees, simple paths, game traces, etc. • Some representations: constrained conditional models, mixed networks, probabilistic logics.

  24. Structured Probability Spaces • Everywhere in ML! – Configuration problems, inventory, video, text, deep learning – Planning and diagnosis (physics) – Causal models: cooking scenarios (interpreting videos) – Combinatorial objects: parse trees, rankings, directed acyclic graphs, trees, simple paths, game traces, etc. • Some representations: constrained conditional models, mixed networks, probabilistic logics. No ML boxes out there that take constraints as input! 

  25. Structured Probability Spaces • Everywhere in ML! – Configuration problems, inventory, video, text, deep learning – Planning and diagnosis (physics) – Causal models: cooking scenarios (interpreting videos) – Combinatorial objects: parse trees, rankings, directed acyclic graphs, trees, simple paths, game traces, etc. • Some representations: constrained conditional models, mixed networks, probabilistic logics. No ML boxes out there that take constraints as input!  Goal: Constraints as important as data! General purpose!

  26. Specification Language: Logic

  27. Structured Probability Space unstructured structured L K P A L K P A 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 • Must take at least one of 0 0 1 0 0 0 1 0 Probability or Logic. 0 0 1 1 0 0 1 1 • Probability is a prerequisite for AI. 0 1 0 0 0 1 0 0 • 0 1 0 1 The prerequisites for KR is 0 1 0 1 0 1 1 0 either AI or Logic. 0 1 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 7 out of 16 instantiations 1 0 1 1 1 0 1 1 are impossible 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1

  28. Boolean Constraints unstructured structured L K P A L K P A 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 7 out of 16 instantiations 1 0 1 1 1 0 1 1 are impossible 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1

  29. Combinatorial Objects: Rankings rank sushi rank sushi 1 fatty tuna 1 shrimp 10 items : 2 sea urchin 2 sea urchin 3,628,800 3 salmon roe 3 salmon roe rankings 4 shrimp 4 fatty tuna 5 tuna 5 tuna 6 squid 6 squid 20 items : 7 tuna roll 7 tuna roll 2,432,902,008,176,640,000 8 see eel 8 see eel rankings 9 egg 9 egg 10 cucumber roll 10 cucumber roll

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