离散鲁棒分布矩阵逆逼近
Straggler Robust Distributed Matrix Inverse Approximation
摘要:
数值分析和线性代数、优化、机器学习和工程算法中的一种繁琐操作;是对出现在各种过程和应用中的大型满秩矩阵求逆。这具有数值稳定性和复杂性问题,以及高预期计算时间。我们解决后一个问题,提出了一种算法,它使用一个黑盒最小二乘优化求解器作为子程序,给一个估计的逆(和伪逆)的真实非奇异矩阵,通过估计其列。这也赋予了它以分布式方式执行的灵活性,因此可以更快地获得估计,并且可以使其对\textit{stragglers}具有鲁棒性。此外,我们假设一个集中式网络,在计算节点之间没有消息传递,并且不需要矩阵分解;例如LU,SVD或QR分解。
英文摘要:
A cumbersome operation in numerical analysis and linear algebra, optimization, machine learning and engineering algorithms; is inverting large full-rank matrices which appears in various processes and applications. This has both numerical stability and complexity issues, as well as high expected time to compute. We address the latter issue, by proposing an algorithm which uses a black-box least squares optimization solver as a subroutine, to give an estimate of the inverse (and pseudoinverse) of real nonsingular matrices; by estimating its columns. This also gives it the flexibility to be performed in a distributed manner, thus the estimate can be obtained a lot faster, and can be made robust to \textit{stragglers}. Furthermore, we assume a centralized network with no message passing between the computing nodes, and do not require a matrix factorization; e.g. LU, SVD or QR decomposition beforehand.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。