Characterizations of Decomposable Dependency Models
L. M. deCampos
Abstract
Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also briefly discuss a potential application of our results to the problem of learning graphical models from data.
Create a lesson
Related papers
OSGR: Observation-Support Graph Reasoning for Earth Observation Question Answering
Dazhou Yu, Zerong Wang, Riyang Bao et al.
Bidirectional Centered Score Matching for Discrete Diffusion Distillation
Peng Tu, Baoyou Chen, Haoyuan Xia et al.
Harness-S: Learning from Sibling Harnesses for Generalizable Agent Training
Kangning Zhang, Wenxiang Jiao, Bowen Fang et al.
Reliability Stress Testing of RAG Retrieval under Query-Relevant Corpus Poisoning
Janet Sung, Kainan Zhou, Gangzhen Qian et al.
Neologism Inoculation Prompting
David Demitri Africa, Cameron Holmes
AceAction-5M: Hierarchical Goals for Generalist Action Learning Across 3D Game Worlds
Kailing Li, Ruoxuan Zhang, Zheyuan Zhou et al.