arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.08593cs.LG
收藏

走向离群值传播的普适定律

Toward Universal Laws of Outlier Propagation

Aram Ebtekar, Yuhao Wang, Dominik Janzing

AI总结:

本文利用算法信息论提出离群值传播的普适定律,证明联合样本的随机性亏缺可按因果机制分解,并表明弱离群值不能导致强离群值,从而为离群值检测与根因归因提供统一的理论基础。

摘要:

当多种异常特征促使将不同样本标记为离群值时,算法信息论(AIT)提供了一种原则性的方法,以样本的随机性亏缺来统一它们。在因果贝叶斯网络满足算法马尔可夫条件的前提下,我们证明了一个联合样本的随机性亏缺可以分解为每个因果机制上的随机性亏缺之和。因此,异常观测可以归因于其根本原因,即表现异常的机制。作为莱文随机性守恒定律的扩展,我们证明了弱离群值不能导致强离群值。我们展示了这些信息论定律如何在先前文献中更专门的离群值分数的背景下,澄清我们对离群值检测与归因的理解。

英文摘要:

When a variety of anomalous features motivate flagging different samples as outliers, Algorithmic Information Theory (AIT) offers a principled way to unify them in terms of a sample's randomness deficiency. Subject to the algorithmic Markov condition on a causal Bayesian network, we show that the randomness deficiency of a joint sample decomposes into a sum of randomness deficiencies at each causal mechanism. Consequently, anomalous observations can be attributed to their root causes, i.e., the mechanisms that behaved anomalously. As an extension of Levin's law of randomness conservation, we show that weak outliers cannot cause strong ones. We show how these information theoretic laws clarify our understanding of outlier detection and attribution, in the context of more specialized outlier scores from prior literature.

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

↑