“I've only briefly skimmed the paper, but here's something I've come up with, based on what I read, that might or might not be the same as what they've said, but I think "has legs": * Randomly choose some fixed sized subset of the data and sort it; * Based on that, deduce the distribution of the data; * Based on that, create a destination array, and cop…”
An $O(N)$ Sorting Algorithm: Machine Learning Sort
We propose an $O(N\cdot M)$ sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we discuss the application of this algorithm to sparse hash table.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
没有评论直接链到它;下面是它被提交的讨论串里回复最多的评论(不计入统计)“Clickbaity paper title. That raised my hackles a bit. This is basically bucket sort with machine learning thrown in. It is not O(N). O(N) has a very specific mathematical meaning, do not abuse it. It means there exists some fixed K that for every N and every input of size N, the running time is <= K*N. This algorithm does not have that property, so it is…”
“The last sentence before the conclusion is > We have to admit that, if there are too many numbers that fall into the tail intervals, the Machine Learning Sort might fail. It's interesting to have a sorting algorithm with a worst case time complexity of "might fail".”
- An O(N) Sorting Algorithm: Machine Learning Sorting ↗akaryocyte · 2018-05-14 · 30 分
- An O(N) Sorting Algorithm: Machine Learning Sort ↗jonbaer · 2018-08-27 · 33 分