OpenAI algorithm for the FFT is less a breakthrough and more a malicious exploit
A critique argues OpenAI's faster FFT claim is a galactic algorithm, slower than Cooley-Tukey at realistic sizes.
Stories per day · 30 days
2 RSS
Relatedopenai2ai-alignment1algorithms1bandits1big-o1chatgpt1fft1fourier-transform1galactic-algorithms1integer-multiplication1mathematics1np-hard1regret1robust-learning1
2 stories, newest first · one card per story
Stories tagged #computational-complexity
On the Computational Tractability of Robust Bandits
Researchers give a polynomial-time robust bandit learner with near-square-root regret and show nearby variants are NP-hard.