AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Submodel Decomposition Bounds for Influence Diagrams

Junkyu Lee, Radu Marinescu, Rina Dechter

AAAI 2021 · Learning theory and algorithms › Prediction and decision losses · approach: Compact interpretable model classes · 4 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use submodel-tree weighted mini-bucket bounds instead of the analytical kpu-UBLIMID MEU inference · LIMID benchmarksupper bound tightnessImproved
Decompose the problem into submodels and apply ST-WMB(i=20)SysAdmin planning instances · finite-horizon MDP/POMDPupper bound tightnessImproved
Apply submodel-tree decomposition bounds rather than the compared decomposition schemesID MEU inference · synthetic ID benchmarksupper bound tightnessImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy