38
"Hours and hours of content have been minted by highly-educated, prestigiously-credentialed people, consternating about the policy implications of Sam Altman’s speculative fan fiction" (doriantaylor.com)
submitted 2 years ago by [M] to c/sneerclub@awful.systems
34 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] 10 points 2 years ago (2 children)

the computational cost of operating over a matrix is always going to be convex relative to its size

This makes no sense - "convex" doesn't mean fast-growing. For instance a constant function is convex.

  • permalink
  • fedilink
  • source
  • hideshow 2 child comments
    •
  • [–] 11 points 2 years ago

    you will be pleased to know that the original text said "superlinear"; i just couldn't remember if the lower bound of multiplying a sufficiently sparse matrix was actually lower than O(n²) (because you could conceivably skip over big chunks of it) and didn't feel like going and digging that fact out. i briefly felt "superlinear" was too clunky though and switched it to "convex" and that is when you saw it.

  • permalink
  • fedilink
  • source
  • parent