XXt Can Be Faster
2025/05/14 by Dmitry Rybin, Yushun Zhang, Rybin, Dmitry +3 · 14 voices
#cs.DS #cs.AI #cs.LG #cs.SC
paper · pdf · doi:10.48550/arxiv.2505.09814
Abstract
We present RXTX, a new algorithm for computing the product of matrix by its transpose XXt 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.
Discussions
- X X^t can be faster [hn, 201 points, 60 comments]
- $XX^{t}$ Can Be Faster [lobsters, 4 points, 1 comments]
- XXt Can Be Faster arxiv.org/abs/2505.09814 [bsky, 1 points, 0 comments]
- X X^t can be faster #HackerNews https://arxiv.org/abs/2505.09814 [bsky, 0 points, 0 comments]
- X X^t can be faster https://arxiv.org/abs/2505.09814 https://news.ycombinator.com/item?id=44006824 [bsky, 0 points, 0 comments]
- X X^t can be faster https://arxiv.org/abs/2505.09814 [bsky, 0 points, 0 comments]
- X X^t can be faster View Article | Join the HN Conversation Summary of HN discussion 🧵👇 #hacker-news [bsky, 0 points, 1 comments]
- X X^t can be faster https://arxiv.org/abs/2505.09814 (https://news.ycombinator.com/item?id=44006824) [bsky, 0 points, 0 comments]
- ⚡ Hackernews Top story: X X^t can be faster [bsky, 0 points, 0 comments]
- X X^t can be faster https://arxiv.org/abs/2505.09814 (http://news.ycombinator.com/item?id=44006824) [bsky, 0 points, 0 comments]
- It's a big week for matrix multiplication algorithms. https://arxiv.org/abs/2505.09814 [bsky, 0 points, 1 comments]
- $XX^{t}$ Can Be Faster https://lobste.rs/s/6wwcpm #math [bsky, 0 points, 0 comments]
- X X^t can be faster https://arxiv.org/abs/2505.09814 (https://news.ycombinator.com/item?id=44006824) [bsky, 0 points, 0 comments]
- X X^t can be faster [bsky, 0 points, 0 comments]
Related