arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.4521eess.SYcs.ITcs.SYmath.ITmath.OC
收藏

不同基数有限集上概率分布间的度量及其在降阶中的应用

A Metric Between Probability Distributions on Finite Sets of Different Cardinalities and Applications to Order Reduction

Mathukumalli Vidyasagar

AI总结:

本文针对不同基数有限集上的概率分布,定义了一种基于最小熵联合分布的度量,并提出了贪婪算法来近似计算该度量及其在降阶中的应用。

摘要:

随着数字控制的日益普及,将控制输入和输出视为在有限字母表而非欧几里得空间中取值的随机过程变得自然。随着网络控制的普及,通过减小输入和输出字母表的大小同时保持表示保真度来进行数据压缩变得相关。这要求我们定义两个在不同集合(可能基数不同)上取值的随机过程之间的距离概念。如果两个过程是独立同分布的,那么问题就转化为定义两个在不同基数有限集上的概率分布之间的度量。这是本文解决的问题。该度量通过两个集合乘积上的一个联合分布来定义,该联合分布以给定的两个分布为边缘分布,并且具有最小熵。精确计算该度量被证明是NP难的。因此,提出了一种高效的贪婪算法来找到距离的上界。这个问题也被证明是NP难的,因此再次构建了一个贪婪算法来寻找次优的降阶近似。综合起来,本文提出的所有结果允许用较小基数集上的独立同分布过程来近似较大基数集上的独立同分布过程。未来的工作将尝试将本文工作扩展到有限集上的马尔可夫过程。

英文摘要:

With increasing use of digital control it is natural to view control inputs and outputs as stochastic processes assuming values over finite alphabets rather than in a Euclidean space. As control over networks becomes increasingly common, data compression by reducing the size of the input and output alphabets without losing the fidelity of representation becomes relevant. This requires us to define a notion of distance between two stochastic processes assuming values in distinct sets, possibly of different cardinalities. If the two processes are i.i.d., then the problem becomes one of defining a metric between two probability distributions over distinct finite sets of possibly different cardinalities. This is the problem addressed in the present paper. A metric is defined in terms of a joint distribution on the product of the two sets, which has the two given distributions as its marginals, and has minimum entropy. Computing the metric exactly turns out to be NP-hard. Therefore an efficient greedy algorithm is presented for finding an upper bound on the distance. This problem also turns out to be NP-hard, so again a greedy algorithm is constructed for finding a suboptimal reduced order approximation. Taken together, all the results presented here permit the approximation of an i.i.d. process over a set of large cardinality by another i.i.d. process over a set of smaller cardinality. In future work, attempts will be made to extend this work to Markov processes over finite sets.

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

↑