Tomlin的HOTS算法的收敛性
Convergence of Tomlin's HOTS algorithm
摘要:
HOTS算法使用网络的超链接结构来计算分数向量,可以使用该分数向量对网页进行排名。HOTS向量是最优流问题的对偶变量的指数向量(每页的“温度”)。流表示在熵最大化的意义上的网络图上的网络冲浪者的最优分布。本文证明了Tomlin的HOTS算法的收敛性。我们首先研究该算法的一个简化版本,它是一个不动点尺度算法,旨在解决非负不可约矩阵的矩阵平衡问题。收敛性的证明是一般的(非线性Perron-Frobenius理论),并适用于家庭的变形的HOTS。然后,我们解决了有效的HOTS算法,由Tomlin设计的网页排名。该模型是一个广义矩阵平衡的网络熵最大化问题。我们表明,在温和的假设下,HOTS算法以线性收敛速率收敛。证明依赖于唯一性的不动点和存在的李雅普诺夫函数。我们还表明,坐标下降算法可以用来找到理想的和有效的HOTS向量,我们比较HOTS和坐标下降的网页图的片段。我们的数值实验表明,收敛速度的HOTS算法可能恶化时,输入的大小增加。因此,我们给出了一个规范化版本的HOTS与实验更好的收敛速度。
英文摘要:
The HOTS algorithm uses the hyperlink structure of the web to compute a vector of scores with which one can rank web pages. The HOTS vector is the vector of the exponentials of the dual variables of an optimal flow problem (the "temperature" of each page). The flow represents an optimal distribution of web surfers on the web graph in the sense of entropy maximization. In this paper, we prove the convergence of Tomlin's HOTS algorithm. We first study a simplified version of the algorithm, which is a fixed point scaling algorithm designed to solve the matrix balancing problem for nonnegative irreducible matrices. The proof of convergence is general (nonlinear Perron-Frobenius theory) and applies to a family of deformations of HOTS. Then, we address the effective HOTS algorithm, designed by Tomlin for the ranking of web pages. The model is a network entropy maximization problem generalizing matrix balancing. We show that, under mild assumptions, the HOTS algorithm converges with a linear convergence rate. The proof relies on a uniqueness property of the fixed point and on the existence of a Lyapunov function. We also show that the coordinate descent algorithm can be used to find the ideal and effective HOTS vectors and we compare HOTS and coordinate descent on fragments of the web graph. Our numerical experiments suggest that the convergence rate of the HOTS algorithm may deteriorate when the size of the input increases. We thus give a normalized version of HOTS with an experimentally better convergence rate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。