Research map / Learning theory and algorithms / Prediction and decision losses
Submodel Decomposition Bounds for Influence Diagrams
Junkyu Lee, Radu Marinescu, Rina Dechter
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use submodel-tree weighted mini-bucket bounds instead of the analytical kpu-UB | LIMID MEU inference · LIMID benchmarks | upper bound tightness | Improved |
| Decompose the problem into submodels and apply ST-WMB(i=20) | SysAdmin planning instances · finite-horizon MDP/POMDP | upper bound tightness | Improved |
| Apply submodel-tree decomposition bounds rather than the compared decomposition schemes | ID MEU inference · synthetic ID benchmarks | upper bound tightness | Improved |
Closest papers by meaning
- A New Bounding Scheme for Influence Diagrams (AAAI 2021 · similarity 0.92)
- Multi-Objective Influence Diagrams with Possibly Optimal Policies (AAAI 2017 · similarity 0.85)
- From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models (ICML 2020 · similarity 0.85)
- Cooperative Graphical Models (NeurIPS 2016 · similarity 0.85)
- A Complete Criterion for Value of Information in Soluble Influence Diagrams (AAAI 2022 · similarity 0.85)
- Provable Variational Inference for Constrained Log-Submodular Models (NeurIPS 2018 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
