Decision Diagrams for Efficient Inference and Optimization in Expressive Discrete+Continuous Domains
summary
Extends the algebraic decision diagram to continuous variables as the extended ADD (XADD) and represents arbitrary piecewise polynomial functions, with implemented plus/times/max/integral and symbolic substitution so marginals, means and Bellman backups evaluate in closed form. Works on hybrid graphical models, parametric constrained optimization and continuous MDPs, and collapses bilinear learning+decision problems via symbolic variable elimination to solve Smart Predict+Optimize exactly. Operations can blow up (worst‑case exponential) but XADDs compress structure; decision‑ordering and canonicity versus minimality remain practical hurdles.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 2:42Discrete to continuous HMMs
- 7:47Case statements in closed form
- 15:57Inference challenges
- 18:31Decision diagrams for discrete
- 21:29Extending to continuous
- 25:27Decision ordering in XADDs
- 28:23Minimality in XADDs
- 33:04XADD operations
- 34:55Mixed MDPs
- 38:29Inventory control with XADDs
- 39:55Smart Predict+Optimize
- 41:45Recap and conclusion
- 43:00Q&A
