conv.

← The whole story
Tech
Math researcher debunks OpenAI's faster Fourier transform as flawed

Ryan Shea publishes competing sub-n-log-n Fourier transform bound

3 Oct 8 12:52 PM · 6d ago · 3 posts · 2 sources · development 3 of 5

Independent researcher publishes a draft claiming an alternative bound of O(n(log n)^(1−δ)) with δ = 7.3×10⁻⁵, offering a competing approach to the same problem.

Ryan Shea publishes competing sub-n-log-n Fourier transform bound
github.com

“We're publishing a research draft on OpenAI Problem #130: computing the exact discrete Fourier transform below n log n. Our draft proposes an all-length bound of T(n) = O(n(log n)^(1−δ)), with δ = 7.3×10⁻⁵.”

@ryaneshea, Independent researcher · x ↗

OpenAI Research organizationArgmin author Mathematics researcher and technical criticRyan Shea Independent researcherJohn D. Cook Mathematics blogger

The whole story articlesposts the bright band is this development · numbered dots are the others · click one to jump

Peak 9 pieces in two hours at Oct 12, 10 PM; 37 pieces over 8 days (2 articles · 15 posts · 20 comments) Oct 6, 8 PM — 1 piece · 1 post — Hacker News 1Oct 6, 10 PM — quietOct 7, 12 AM — quietOct 7, 2 AM — quietOct 7, 4 AM — quietOct 7, 6 AM — quietOct 7, 8 AM — quietOct 7, 10 AM — quietOct 7, 12 PM — quietOct 7, 2 PM — quietOct 7, 4 PM — quietOct 7, 6 PM — quietOct 7, 8 PM — quietOct 7, 10 PM — quietOct 8, 12 AM — quietOct 8, 2 AM — quietOct 8, 4 AM — quietOct 8, 6 AM — quietOct 8, 8 AM — quietOct 8, 10 AM — 1 piece · 1 post — Hacker News 1Oct 8, 12 PM — 1 piece · 1 post — X 1Oct 8, 2 PM — quietOct 8, 4 PM — quietOct 8, 6 PM — 1 piece · 1 post — Hacker News 1Oct 8, 8 PM — 1 piece · 1 post — Hacker News 1Oct 8, 10 PM — quietOct 9, 12 AM — quietOct 9, 2 AM — quietOct 9, 4 AM — quietOct 9, 6 AM — quietOct 9, 8 AM — quietOct 9, 10 AM — quietOct 9, 12 PM — quietOct 9, 2 PM — quietOct 9, 4 PM — quietOct 9, 6 PM — quietOct 9, 8 PM — quietOct 9, 10 PM — quietOct 10, 12 AM — quietOct 10, 2 AM — quietOct 10, 4 AM — quietOct 10, 6 AM — quietOct 10, 8 AM — quietOct 10, 10 AM — quietOct 10, 12 PM — quietOct 10, 2 PM — quietOct 10, 4 PM — quietOct 10, 6 PM — quietOct 10, 8 PM — quietOct 10, 10 PM — quietOct 11, 12 AM — quietOct 11, 2 AM — quietOct 11, 4 AM — quietOct 11, 6 AM — quietOct 11, 8 AM — quietOct 11, 10 AM — quietOct 11, 12 PM — quietOct 11, 2 PM — quietOct 11, 4 PM — quietOct 11, 6 PM — quietOct 11, 8 PM — quietOct 11, 10 PM — quietOct 12, 12 AM — quietOct 12, 2 AM — quietOct 12, 4 AM — quietOct 12, 6 AM — quietOct 12, 8 AM — quietOct 12, 10 AM — 2 pieces · 2 posts — X 1, Hacker News 1Oct 12, 12 PM — quietOct 12, 2 PM — 2 pieces · 2 posts — Hacker News 1, X 1Oct 12, 4 PM — quietOct 12, 6 PM — quietOct 12, 8 PM — quietOct 12, 10 PM — 9 pieces · 2 articles · 1 post · 6 comments — Hacker News 7, Newswires 2Oct 13, 12 AM — 3 pieces · 3 comments — Hacker News 3Oct 13, 2 AM — 3 pieces · 1 post · 2 comments — Hacker News 2, Mastodon 1Oct 13, 4 AM — 3 pieces · 2 posts · 1 comment — Hacker News 2, Lobsters 1Oct 13, 6 AM — 2 pieces · 2 comments — Hacker News 2Oct 13, 8 AM — 3 pieces · 3 comments — Hacker News 3Oct 13, 10 AM — 3 pieces · 2 posts · 1 comment — Mastodon 2, Hacker News 1Oct 13, 12 PM — quietOct 13, 2 PM — quietOct 13, 4 PM — quietOct 13, 6 PM — quietOct 13, 8 PM — quietOct 13, 10 PM — quietYesterday, 12 AM — quietYesterday, 2 AM — quietYesterday, 4 AM — quietYesterday, 6 AM — quietYesterday, 8 AM — quietYesterday, 10 AM — 1 piece · 1 comment — Hacker News 1Yesterday, 12 PM — 1 piece · 1 comment — Hacker News 1Yesterday, 2 PM — quietYesterday, 4 PM — quietYesterday, 6 PM — quietYesterday, 8 PM — quietYesterday, 10 PM — quietToday, 12 AM — quietToday, 2 AM — quiet 12–345
1OpenAI releases papers on faster Fourier…2–3Ryan Shea publishes competing sub-n-log-n…4Argmin technical critique questions…5Hacker News surfaces critique framing…
Oct 7Oct 8Oct 9Oct 10Oct 11Oct 12Oct 13now · 3:09 AM ET

What people said 1 voice · verbatim

All 5 developments of Math researcher debunks OpenAI's faster Fourier transform… →

Hacker NewsXNewswiresMastodonLobsters