Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees
arXiv:2507.08784v4 Announce Type: replace Abstract: Distributed optimization is pivotal for large-scale signal processing and machine learning, yet communication overhead remains a major bottleneck. Low-rank gradient compression, in which the transmitted gradients are approximated by low-rank matrices to reduce communication, offers…
