Live data from Hacker News

New technology could blow away GPT-4 and everything like it

zdnet.com

1–10 of 18 posts

Re: New technology could blow away GPT-4 and everything like it

#4

I didn't see anything in the article about what the scaling factor was? less than P^2 but what was it?

The paper has a “preliminary scaling law” diagram. The shape of the graph is the same, but with 20% fewer FLOPS.

The real breakthrough is that Hyena apparently has an unlimited context window.

Re: New technology could blow away GPT-4 and everything like it

#6

I didn't see anything in the article about what the scaling factor was? less than P^2 but what was it?

presumably still O(n2) in theory, but not for practical cases.

I think that anything reolacing attention will suffer quadratic growth for some pathological examples.

maybe if we have a better understanding of the data we could give a better definition (much like graph complexity is usually given in the actual number of edges, which are theoretically O(n2).)

Re: New technology could blow away GPT-4 and everything like it

#8
post #4

I didn't see anything in the article about what the scaling factor was? less than P^2 but what was it?

The paper has a “preliminary scaling law” diagram. The shape of the graph is the same, but with 20% fewer FLOPS. The real breakthrough is that Hyena apparently has an unlimited context window.

>The real breakthrough is that Hyena apparently has an unlimited context window.

It's extrapolated volition time (゚∀゚)

Re: New technology could blow away GPT-4 and everything like it

#9

> At 64,000 tokens, the authors relate, "Hyena speed-ups reach 100x" -- a one-hundred-fold performance improvement. That’s quite the difference

Classic attention is quadratic in context length and faster alternatives seem to not perform as well, wonder how Hyena is in comparison to linear attention algorithms.
Post reply on HN