随机矩阵的随机p次根逼近:一种黎曼优化方法
Stochastic $p$th root approximation of a stochastic matrix: A Riemannian optimization approach
AI总结:
本研究提出两种基于黎曼优化的随机矩阵p次根随机逼近方法,分别在正随机矩阵流形和共享Perron特征向量的正随机矩阵流形中求解,实验表明其比传统约束优化方法精度更高、速度更快,可应用于马尔可夫链嵌入问题。
摘要:
我们提出了两种基于黎曼优化的方法,用于计算随机矩阵A的p次根的随机逼近。第一种方法在正随机矩阵的黎曼流形中寻找逼近解。第二种方法中,我们引入了与A共享Perron特征向量的正随机矩阵黎曼流形,并在该流形中计算A的p次根逼近。通过这种方式,与现有基于约束优化的方法不同,A与其p次根逼近共享Perron特征向量。从建模角度来看,这一性质在马尔可夫链的嵌入问题中具有重要意义。扩展数值实验表明,在第一种方法中,黎曼优化方法通常比现有基于约束优化的方法速度更快、精度更高。在第二种方法中,尽管p次根的随机逼近是在更小的集合中求得的,但其精度通常高于通过标准约束优化得到的逼近结果。
英文摘要:
We propose two approaches, based on Riemannian optimization, for computing a stochastic approximation of the $p$th root of a stochastic matrix $A$. In the first approach, the approximation is found in the Riemannian manifold of positive stochastic matrices. In the second approach, we introduce the Riemannian manifold of positive stochastic matrices sharing with $A$ the Perron eigenvector and we compute the approximation of the $p$th root of $A$ in such a manifold. This way, differently from the available methods based on constrained optimization, $A$ and its $p$th root approximation share the Perron eigenvector. Such a property is relevant, from a modelling point of view, in the embedding problem for Markov chains. The extended numerical experimentation shows that, in the first approach, the Riemannian optimization methods are generally faster and more accurate than the available methods based on constrained optimization. In the second approach, even though the stochastic approximation of the $p$th root is found in a smaller set, the approximation is generally more accurate than the one obtained by standard constrained optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。