“If you’re interested, I found https://arxiv.org/abs/2505.09814v1 to beat Strassen for medium-sized and larger covariance matrices. YMMV of course. Takes a little adjustment for XX^H but it’s not so bad.”
按年被提到
20252025 · 1 次2026
$XX^{t}$ Can Be Faster
Dmitry Rybin, Yushun Zhang, Zhi-Quan Luo · 2025
被提及 · 2 人首次 2025-05-16 · 最近 2026-07-19
2不同的人
2活跃月份
2讨论串
3被引(OpenAlex)
arXiv 摘要(候选层不写导读)
We present RXTX, a new algorithm for computing the product of matrix by its transpose $XX^{t}$ for $X\in \mathbb{R}^{n\times 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 \rightarrow \infty$, but also for small matrices including $n = 4$. The algorithm was discovered by combining Machine Learning-based search methods with Combinatorial Optimization.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及评论TimorousBestie · 2026-07
被提交为 story · 1 次
- X X^t can be faster ↗robinhouston · 2025-05-16 · 201 分