Earlier quoted context omitted.
On the other hand, real world performance is really the only useful metric for matrix multiplication. I don’t really care about the theoretical performance, or the number of operations. Not disagreeing with your take that the claim is grandiose, just pointing out that finding a generalizable way to automate the improvement of what is almost certainly the most important mathematical operation a computer can do is wort…
Science proceeds at the rate by which linearly larger matrices can be decomposed in less than exponential time.
Discovering faster matrix multiplication algorithms with reinforcement learning
71–80 of 116 posts
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#72Quoting myself on twitter: https://twitter.com/cHHillee/status/1577713102434361344 I'm quite suspicious about their hardware benchmarks. They're not writing custom kernels, they're relying on a graph compiler like XLA to automatically fuse their decomposed matmuls (and my guess is that XLA will not be very good at this). Moreover, as far as I can tell, they don't report absolute performance numbers anywhere. In other…
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#73I understand that they transform the problem into a gamified 3-D matrix decomposition, but what exactly is the motivation for using RL to beat this decomposition game ? Why not just use, for example, an evolution algorithm to find incrementally better decompositions ?
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#74Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#75Earlier quoted context omitted.
I don't doubt the sentiment is true, but hasn't this kind of science always been this way? By that I mean authors inflating the importance of their work; everyone wants to be seen as having the biggest breakthroughs. When I think of dysfunction in 'science' I usually think of unfalsifiable hypothesis, the repeatability crisis in Psychology, p-hacking in Medicine, misuse of statistical methods in Economics and other e…
Scientists have long been self-promoters who desire that their theories become the dominant ones and they use many techniques to achieve this. However, the trend towards maximizing the predicted outcomes of your research really took off during the human genomics project.
The famous ones more than the rest, I guess. To my mind nevertheless comes Cavendish, my hero.
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#76Can someone knowledgeable tell me if it discovered an algorithm we can understand and re-implement ourself, like is the pseudo-code for it known? Or is it kind of stuck in the infered function of the ML model?
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#77The big claim turns out to be a little overstated. The claim: > AlphaTensor’s algorithm improves on Strassen’s two-level algorithm for the first time, to our knowledge, since its discovery 50 years ago. reduces to: > AlphaTensor discovers algorithms that outperform the Strassen-square algorithm, which is a fast algorithm for large square matrices31,32. Although the discovered algorithm has the same theoretical comple…
This is not a correct summary of the results of the paper. First, you cut out the initial part of the sentence about improving on Strassen's two-level algorithm. Here is the complete sentence: > Particularly relevant is the case of 4 × 4 matrices in a finite field, where AlphaTensor’s algorithm improves on Strassen’s two-level algorithm for the first time, to our knowledge, since its discovery 50 years ago. That is,…
Talking about scaling for a problem that has no scaling factor is a bit odd.
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#78I have a gut feeling that there is a faster way to compute logarithms going from least to most significant bit. How would I go about using ML to find it? [Edit] I think Feynman's algorithm might do it: "Consider the problem of finding the logarithm of a fractional number between 1 and 2. (The algorithm can be generalized without too much difficulty.) Feynman observed that any such number can be uniquely represented a…
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#79This is completely besides the matter, but reading "provably" in the abstract is a frank reminder of how terrible English spelling/pronounciation is. I can't imagine I'm the only well-read native English speaker who read this as "prov-ably" on first take. I don't know about most languages, but you just don't get nonsense like this in French, at least.
I don't understand your point, provably means which can be proven, is there another meaning I'm missing ?
Re: Discovering faster matrix multiplication algorithms with reinforcement learning
#80Why the heck is a math paper in Nature? I'd put Nature somewhere just below vixra in terms of math credibility.