I’ve not yet had time for reading the full article but the topic is really interesting. This is for sure one great and good application of deep learning. Anyone with some insights on this topic?

    • bici@beehaw.orgOP
      link
      fedilink
      arrow-up
      3
      ·
      2 years ago

      My first thoughts were on the same line. I think the new “algorithm” are heuristics for small values of n.

    • tnecniv@beehaw.org
      link
      fedilink
      arrow-up
      3
      ·
      2 years ago

      I gave it a quick skim. It seems the improvements are on specific sort tasks. There may also be fitting to the distribution of sequences. It won’t beat n log(n) for all cases, but it might do better for common common situations in the data set.

      It’s still neat they made it work.