arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.07167cs.LGcs.AI
收藏

联合概率树

Joint Probability Trees

Institute for Artificial Intelligence, University of Bremen(不来梅大学人工智能研究所)

Daniel Nyga, Mareike Picklum, Tom Schierenbeck, Michael Beetz

摘要:

我们介绍了联合概率树(JPT),一种新的方法,使学习和推理联合概率分布易于处理的实际应用。JPT在单个混合模型中支持符号和子符号变量,并且它们不依赖于关于变量依赖性或分布族的先验知识。JPT表示建立在树结构上,该树结构将问题空间划分为从训练数据引出的相关子区域,而不是在学习之前假设严格的依赖模型。学习和推理在JPT中线性缩放,并且树结构允许关于任何后验概率$P(Q|E)$的白盒推理,使得可以为任何推理结果提供可解释的解释。我们的实验展示了JPT在具有数百万训练样本的高维异构概率空间中的实用性,使其成为经典概率图模型的一种有前途的替代方案。

英文摘要:

We introduce Joint Probability Trees (JPT), a novel approach that makes learning of and reasoning about joint probability distributions tractable for practical applications. JPTs support both symbolic and subsymbolic variables in a single hybrid model, and they do not rely on prior knowledge about variable dependencies or families of distributions. JPT representations build on tree structures that partition the problem space into relevant subregions that are elicited from the training data instead of postulating a rigid dependency model prior to learning. Learning and reasoning scale linearly in JPTs, and the tree structure allows white-box reasoning about any posterior probability $P(Q|E)$, such that interpretable explanations can be provided for any inference result. Our experiments showcase the practical applicability of JPTs in high-dimensional heterogeneous probability spaces with millions of training samples, making it a promising alternative to classic probabilistic graphical models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑