arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.13685cs.ITmath.IT
收藏

基于梯度编码的编码矩阵计算

Coded matrix computation with gradient coding

Kyungrak Son, Aditya Ramamoorthy

AI总结:

本文提出一种结合梯度编码与纠缠多项式码的通用编码矩阵计算方案,在牺牲恢复阈值的情况下降低编码权重并提升数值稳定性,仿真验证其优于EPC和Mat-Dot码。

摘要:

基于多项式的方法,如Mat-Dot码和纠缠多项式码(EPC),已被广泛用于编码矩阵计算中,以获得具有良好恢复阈值的方案。然而,这些方案公认在解码时存在较差的数值稳定性。此外,这些方案中的编码过程涉及对大量输入子矩阵进行线性组合,即编码权重较高。对于实际相关的稀疏输入矩阵情况,这会带来显著增加工作节点计算时间的不良影响。在本工作中,我们通过将梯度编码的思想与基本EPC编码相结合,提出了一种EPC方案的推广。我们的技术使我们能够降低编码权重,并得到表现出更好数值稳定性的方案;这是以更差的阈值为代价实现的。通过在我们的方案中适当设置参数,我们恢复了文献中几种著名的方案。仿真结果表明,与EPC和Mat-Dot码相比,我们的方案提供了出色的数值稳定性和(对于稀疏输入矩阵的)快速计算速度。

英文摘要:

Polynomial based approaches, such as the Mat-Dot and entangled polynomial codes (EPC) have been used extensively within coded matrix computations to obtain schemes with good recovery thresholds. However, these schemes are well-recognized to suffer from poor numerical stability in decoding. Moreover, the encoding process in these schemes involves linearly combining a large number of input submatrices, i.e., the encoding weight is high. For the practically relevant case of sparse input matrices, this can have the undesirable effect of significantly increasing the worker node computation time. In this work, we propose a generalization of the EPC scheme by combining the idea of gradient coding along with the basic EPC encoding. Our technique allows us to reduce the weight of the encoding and arrive at schemes that exhibit much better numerical stability; this is achieved at the expense of a worse threshold. By appropriately setting parameters in our scheme, we recover several well-known schemes in the literature. Simulation results show that our scheme provides excellent numerical stability and fast computation speed (for sparse input matrices) as compared to EPC and Mat-Dot codes.

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

↑