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

关于算法化提升不动点计算

On algorithmically boosting fixed-point computations

RelationalAI, Inc.(RelationalAI公司)

Ioannis Avramopoulos, Nikolaos Vasiloglou

AI总结:

本文提出算法化提升方法,通过取迭代映射的长期平均值来加速不动点计算,并证明其可实现指数级收敛加速、将非收敛迭代器转化为收敛迭代器,以及构造性证明纳什均衡的存在性。

摘要:

本文的主要主题是计算纳什均衡的算法。我们将特定方法表述为一种通用算法抽象的实例,即我们称之为算法化提升的方法,该方法也与其他不动点计算问题相关。算法化提升是通过取迭代映射的(长期)平均值来计算不动点的原理,并且是指数运算的推广。我们首先在非线性映射的设置中定义我们的方法。其次,我们将注意力限制在收敛的线性映射上(例如,在PageRank算法中用于计算主导特征向量),并证明我们的算法化提升方法可以启动收敛速度上的指数级加速。第三,我们证明算法化提升可以将一个(弱)非收敛迭代器转换为一个(强)收敛迭代器。我们还考虑了一种算法化提升的变分方法,提供了将非收敛连续流转换为收敛连续流的工具。然后,通过将平均值的构造嵌入到迭代映射的设计中,我们构造性地证明了纳什均衡(因此也包括Brouwer不动点)的存在性。接着,我们讨论了平均化和指数运算的实现,即使对于标量情形这也是一个重要问题。最后,我们讨论了主导(PageRank)特征向量与纳什均衡之间的关系。

英文摘要:

The main topic of this paper are algorithms for computing Nash equilibria. We cast our particular methods as instances of a general algorithmic abstraction, namely, a method we call {\em algorithmic boosting}, which is also relevant to other fixed-point computation problems. Algorithmic boosting is the principle of computing fixed points by taking (long-run) averages of iterated maps and it is a generalization of exponentiation. We first define our method in the setting of nonlinear maps. Secondly, we restrict attention to convergent linear maps (for computing dominant eigenvectors, for example, in the PageRank algorithm) and show that our algorithmic boosting method can set in motion {\em exponential speedups in the convergence rate}. Thirdly, we show that algorithmic boosting can convert a (weak) non-convergent iterator to a (strong) convergent one. We also consider a {\em variational approach} to algorithmic boosting providing tools to convert a non-convergent continuous flow to a convergent one. Then, by embedding the construction of averages in the design of the iterated map, we constructively prove the existence of Nash equilibria (and, therefore, Brouwer fixed points). We then discuss implementations of averaging and exponentiation, an important matter even for the scalar case. We finally discuss a relationship between dominant (PageRank) eigenvectors and Nash equilibria.

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

↑