arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.08509cs.AI
收藏

一种数据透明的时间命题抽象概率模型

A Data-Transparent Probabilistic Model of Temporal Propositional Abstraction

Cardiff University(卡迪夫大学)

Hiroyuki Kido

AI总结:

本文提出一种数据驱动的时间命题推理概率模型,将领域知识视为数据编码的产物,证明其等价于全记忆马尔可夫链,并利用极限处理数据稀缺问题,以提升数据透明度。

摘要:

标准概率模型面临数据稀缺、假设空间庞大以及数据透明度差等根本性挑战。为应对这些挑战,我们提出了一种新颖的数据驱动时间命题推理概率模型。与传统概率模型不同——在传统模型中,数据是编码在概率模型中的领域知识的产物——我们探索了相反的方向,即领域知识是编码在概率模型中的数据的产物。这种更以数据为驱动的视角表明,最大似然参数学习与时间命题推理之间没有区别。我们证明了我们的概率模型等价于一个最高阶(即全记忆)马尔可夫链,并且我们的模型不需要区分隐藏变量和可观测变量。我们讨论了极限为处理数据稀缺(包括零频率问题)提供了一种自然且数学上严格的方式。我们还讨论了由我们的概率模型生成的数据上的概率分布如何通过揭示预测中所使用的有影响力的数据来帮助提高数据透明度。这项理论工作的可复现性通过所附证明得到了充分展示。

英文摘要:

Standard probabilistic models face fundamental challenges such as data scarcity, a large hypothesis space, and poor data transparency. To address these challenges, we propose a novel probabilistic model of data-driven temporal propositional reasoning. Unlike conventional probabilistic models where data is a product of domain knowledge encoded in the probabilistic model, we explore the reverse direction where domain knowledge is a product of data encoded in the probabilistic model. This more data-driven perspective suggests no distinction between maximum likelihood parameter learning and temporal propositional reasoning. We show that our probabilistic model is equivalent to a highest-order, i.e., full-memory, Markov chain, and our model requires no distinction between hidden and observable variables. We discuss that limits provide a natural and mathematically rigorous way to handle data scarcity, including the zero-frequency problem. We also discuss that a probability distribution over data generated by our probabilistic model helps data transparency by revealing influential data used in predictions. The reproducibility of this theoretical work is fully demonstrated by the included proofs.

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

↑