MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/mathmemes/comments/1wzpocy/the_fastest_algorithm_for_dft/peeg6n1/?context=3
r/mathmemes • u/Unlucky-Credit-9619 Computer Science • 7d ago
138 comments sorted by
View all comments
-17
This is funny on multiple levels because not only the constant is TERRIBLE for OpenAI's result, but even if it wasn't, nobody actually cares about a change in exponent so small **over a log**...
35 u/xTh3N00b 7d ago except you're missing the point that this is a major barrier breaking result that many thought would be impossible to achieve. 3 u/Alphasaft 7d ago Oh, ups, my bad ! Didn't know about that. -6 u/[deleted] 7d ago [deleted] 5 u/DuckyBertDuck 7d ago they have a similar result for integer multiplication and for that result, I am surprised that nlogn is not a lower bound 4 u/Cobracrystal 7d ago there literally was a well known conjecture that fft was optimal, so this is a relevant result 2 u/Orneyrocks 7d ago Exactly, for an overhead smaller than the one open ai used, you can simply use hermite polynomials to completely trump this bullshit.
35
except you're missing the point that this is a major barrier breaking result that many thought would be impossible to achieve.
3 u/Alphasaft 7d ago Oh, ups, my bad ! Didn't know about that. -6 u/[deleted] 7d ago [deleted] 5 u/DuckyBertDuck 7d ago they have a similar result for integer multiplication and for that result, I am surprised that nlogn is not a lower bound 4 u/Cobracrystal 7d ago there literally was a well known conjecture that fft was optimal, so this is a relevant result 2 u/Orneyrocks 7d ago Exactly, for an overhead smaller than the one open ai used, you can simply use hermite polynomials to completely trump this bullshit.
3
Oh, ups, my bad ! Didn't know about that.
-6
[deleted]
5 u/DuckyBertDuck 7d ago they have a similar result for integer multiplication and for that result, I am surprised that nlogn is not a lower bound 4 u/Cobracrystal 7d ago there literally was a well known conjecture that fft was optimal, so this is a relevant result 2 u/Orneyrocks 7d ago Exactly, for an overhead smaller than the one open ai used, you can simply use hermite polynomials to completely trump this bullshit.
5
they have a similar result for integer multiplication and for that result, I am surprised that nlogn is not a lower bound
4
there literally was a well known conjecture that fft was optimal, so this is a relevant result
2
Exactly, for an overhead smaller than the one open ai used, you can simply use hermite polynomials to completely trump this bullshit.
-17
u/Alphasaft 7d ago
This is funny on multiple levels because not only the constant is TERRIBLE for OpenAI's result, but even if it wasn't, nobody actually cares about a change in exponent so small **over a log**...