XX^t Can Be Faster
2025-05-14Code Available0· sign in to hype
Dmitry Rybin, Yushun Zhang, Zhi-Quan Luo
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/zhaoolee/garsspytorch★ 1,374
- github.com/benearnthof/rxtxnone★ 2
Abstract
We present RXTX, a new algorithm for computing the product of matrix by its transpose XX^t for X R^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.