News for hackers. Stuff that matters.
Re:Neural programmer better than Quicksort by ogogmad on Friday July 10, 2020 @04:47AM (#23789474)
> They "cheat" by feeding how all elements compares the their neighbours at each step. Like, if you give the algorithm that input for free what's the point.

How is that "cheating"? The algorithm is still learning how to do a comparison-sort, which has direct applications (assuming it performs well).

Re:Neural programmer better than Quicksort by lone-commenter on Friday July 10, 2020 @04:56AM (#23789502)
So do they feed such information only when training the system?
Re:Neural programmer better than Quicksort by ogogmad on Friday July 10, 2020 @05:02AM (#23789536)
You can generate that input only when needed. So whenever the sorting algorithm asks whether A[i] > A[i+1], you can perform the comparison there and then. So the answer to your question is yes.
Re:Neural programmer better than Quicksort by xkapastel on Friday July 10, 2020 @02:11PM (#23794486)
The input is always needed, the neural net is an iterative algorithm that views the "local information" gathered from the array on every time step. It's asking continuously whether e.g. `A[i] > A[i+1]`.
Re:Neural programmer better than Quicksort by xkapastel on Friday July 10, 2020 @02:10PM (#23794477)
No, the neural net needs to receive a feature vector before each instruction in order to sort the array. So whenever you want to sort things, you need to create that vector over and over.