arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.7079cs.SCcs.AImath-phmath.MP
收藏

用蒙特卡罗树搜索改进多元Horner格式

Improving multivariate Horner schemes with Monte Carlo tree search

Nikhef(荷兰国家亚原子物理研究所);Tilburg University(蒂尔堡大学)

J. Kuipers, J. A. M. Vermaseren, A. Plaat, H. J. van den Herik

摘要:

优化多项式求值的代价是计算机科学中的经典问题。对于一个变量的多项式,霍纳的方法提供了一个产生计算效率高的形式的方案。对于多元多项式,可以推广霍纳的方法,但这在变量的顺序上留下了自由。传统上,使用贪婪方案,如最常见的变量优先。这个简单的教科书算法给出了非常有效的结果。事实证明,找到更好的算法是困难的。在试图改进贪婪方案时,我们已经实现了蒙特卡罗树搜索,这是人工智能领域的一种最近的搜索方法。这会产生更好的霍纳方案,并降低计算多项式的成本,有时高达两倍。

英文摘要:

Optimizing the cost of evaluating a polynomial is a classic problem in computer science. For polynomials in one variable, Horner's method provides a scheme for producing a computationally efficient form. For multivariate polynomials it is possible to generalize Horner's method, but this leaves freedom in the order of the variables. Traditionally, greedy schemes like most-occurring variable first are used. This simple textbook algorithm has given remarkably efficient results. Finding better algorithms has proved difficult. In trying to improve upon the greedy scheme we have implemented Monte Carlo tree search, a recent search method from the field of artificial intelligence. This results in better Horner schemes and reduces the cost of evaluating polynomials, sometimes by factors up to two.

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

↑