计算多项式概率系统的最小不动点
Computing Least Fixed Points of Probabilistic Systems of Polynomials
AI总结:
针对系数非负且和为1的多项式方程组,提出强多项式算法判定最小非负解是否为全1向量,并给出线性收敛的可靠上下界序列算法,即使使用不精确算术仍保持可靠性。
摘要:
我们研究形如 X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn) 的方程组,其中每个 fi 是系数非负且和为1的多项式。这类方程组的最小非负解(记为 mu)是物理学、生物学、计算语言学和概率程序验证等领域中问题的核心。我们给出一个简单且强多项式算法,用于判定 mu=(1, ..., 1) 是否成立。此外,我们提出一个算法,计算关于 mu 的可靠上下界序列,并线性收敛到 mu。尽管为了效率使用了不精确算术,我们的算法仍具有这些特性。我们报告了展示算法性能的实验结果。
英文摘要:
We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is central to problems from various areas, like physics, biology, computational linguistics and probabilistic program verification. We give a simple and strongly polynomial algorithm to decide whether mu=(1, ..., 1) holds. Furthermore, we present an algorithm that computes reliable sequences of lower and upper bounds on mu, converging linearly to mu. Our algorithm has these features despite using inexact arithmetic for efficiency. We report on experiments that show the performance of our algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。