Papers › XXᵗ Can Be Faster
XXᵗ Can Be Faster
Dmitry Rybin, Yushun Zhang, Zhi-Quan Luo
We present RXTX, a new algorithm for computing the product of matrix by its transpose XXᵗ for X∈ℝ^(n×m). RXTX uses 5% fewer multiplications and 5% fewer operations (additions and multiplications) than State-of-the-Art algorithms. Note that the accelerations not only holds asymptotically for large matrices with n →∞, but also for small matrices including n = 4. The algorithm was discovered by combining Machine Learning-based search methods with Combinatorial Optimization.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections