NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization

A team of researchers including Haiyang Peng, Deren Han, Xin Chen, and Meng Huang has introduced NS-RGS (Newton-Schulz-based Riemannian Gradient Scheme), a novel algorithm that significantly accelerates orthogonal group synchronization—a fundamental problem in machine learning and computer vision. Traditional methods like the generalized power method rely on exact SVD (singular value decomposition) or QR decompositions in each iteration, creating computational bottlenecks for large-scale problems. NS-RGS replaces these expensive operations with Newton-Schulz iterations, which use only efficient matrix multiplications that align perfectly with modern GPU and TPU architectures.

The researchers employed a refined leave-one-out analysis to overcome statistical dependency challenges and proved that NS-RGS with spectral initialization achieves linear convergence to target solutions up to near-optimal statistical noise levels. In experiments on synthetic data and real-world global alignment tasks, NS-RGS demonstrated accuracy comparable to state-of-the-art methods while achieving nearly a 2× speedup. This breakthrough addresses a critical bottleneck in optimization algorithms used for 3D reconstruction, sensor network alignment, and other applications requiring group synchronization.

The algorithm's efficiency stems from its avoidance of decomposition operations that don't parallelize well on modern hardware. By leveraging matrix multiplications—operations that GPUs and TPUs are specifically designed to accelerate—NS-RGS enables faster processing of large datasets and complex optimization problems. This advancement could significantly impact fields like robotics, computer vision, and distributed systems where group synchronization is essential for aligning multiple coordinate systems or sensor measurements.