analiza aiqbench
This research advances distributed linear algebra by rigorously comparing projection-based and optimization-based methods under a new metric called angular heterogeneity. The findings clarify why Accelerated Projection-Based Consensus often outperforms alternatives in federated settings with significant data diversity, offering critical insights for scaling AI training across heterogeneous clusters.
Distributed Linear Solvers and Data Heterogeneity
arXiv:2304.10640v5 Announce Type: replace-cross Abstract: We consider the problem of solving a large-scale system of linear equations in a distributed/federated setting. The taskmaster solves the system with the help of a set of machines, each of which possesses a subset of the equations. While various solutions for this problem exist, a fundamental understanding and rigorous comparison between the convergence rates of the main algorithmic classes - the projection-based methods and the optimization-based ones - is missing. We provide the first comprehensive analysis and comparison of these two classes of algorithms, with a particular focus on the fastest representative method from each class, i.e., the Accelerated Projection-Based Consensus (APC) and the Distributed Heavy-Ball Method. We introduce a novel notion of data heterogeneity called angular heterogeneity, discussing its significance. Using this notion, we characterize and compare the optimal convergence rates of the algorithms of interest and capture the effects of the number of machines, the number of equations, and cross-machine and local data heterogeneity on these rates. Our analysis sheds light on the previously observed superior performance of APC in realistic scenarios, where there is often large data heterogeneity, and provides several insights into the effect of angular heterogeneity on the efficiencies of different algorithms. Additionally, we provide distributed algorithms for efficiently computing the angular heterogeneity metrics. Lastly, as a by-product of this investigation, we obtain a tight bound on the condition number of an arbitrary matrix with full column rank in terms of the Euclidean norms of its columns and the angles between them. Numerical analyses validate our theoretical results, supporting the predicted advantage of APC in the high-heterogeneity regime and providing a deeper understanding of the effects of angular heterogeneity on convergence rates.
Abstract:We consider the problem of solving a large-scale system of linear equations in a distributed/federated setting. The taskmaster solves the system with the help of a set of machines, each of which possesses a subset of the equations. While various solutions for this problem exist, a fundamental understanding and rigorous comparison between the convergence rates of the main algorithmic classes - the projection-based methods and the optimization-based ones - is missing. We provide the first comprehensive analysis and comparison of these two classes of algorithms, with a particular focus on the fastest representative method from each class, i.e., the Accelerated Projection-Based Consensus (APC) and the Distributed Heavy-Ball Method. We introduce a novel notion of data heterogeneity called angular heterogeneity, discussing its significance. Using this notion, we characterize and compare the optimal convergence rates of the algorithms of interest and capture the effects of the number of machines, the number of equations, and cross-machine and local data heterogeneity on these rates. Our analysis sheds light on the previously observed superior performance of APC in realistic scenarios, where there is often large data heterogeneity, and provides several insights into the effect of angular heterogeneity on the efficiencies of different algorithms. Additionally, we provide distributed algorithms for efficiently computing the angular heterogeneity metrics. Lastly, as a by-product of this investigation, we obtain a tight bound on the condition number of an arbitrary matrix with full column rank in terms of the Euclidean norms of its columns and the angles between them. Numerical analyses validate our theoretical results, supporting the predicted advantage of APC in the high-heterogeneity regime and providing a deeper understanding of the effects of angular heterogeneity on convergence rates.
Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG); Numerical Analysis (math.NA)
G.1.3; I.2.11; I.2.6
arXiv:2304.10640 [cs.DC]
(or arXiv:2304.10640v5 [cs.DC] for this version)
https://doi.org/10.48550/arXiv.2304.10640 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 382 cuvinte
Subiecte conexe

News
Quantum Computing Report · 25 iul. 2026

Scaling Decision Optimization to 100 Million Variables and Beyond with mPDLP in NVIDIA cuOpt
NVIDIA · 7 oct. 2026
Multi-Dataset Inverse Problem Solving with Distributed Generative AI
arXiv · 28 aug. 2026
Breaking Time: A Fully Gaussian Framework for Distributed and Continuous-Time SLAM
arXiv · 5 iun. 2026