3 ms·

Thanks for that. Very interesting. On the first one, I assume we are still talking hand-generation\coordination of the procedural bits. I was waving my hands a

by Aron 9y ago

Thanks for that. Very interesting. On the first one, I assume we are still talking hand-generation\coordination of the procedural bits. I was waving my hands at possibly learning the topology of those bits, possibly even from recognizing them as being reproduced [inefficiently] in a trained NN. I don't think I've ever pondered that second technique before and it's very intriguing. Is there a canonical best-of-class in that category? Offhand, it sounds brutally hard to do. Also, I think DeepMind might have published something on an NN that learned to write a procedural program that wrote a sort algorithm. Is that related?

visarga 9y ago
After some considerable digging I came out with these papers: Differentiable Programs with Neural Libraries - https://www.microsoft.com/en-us/research/wp-content/uploads/2017/03/main2.pdf https://www.microsoft.com/en-us/research/wp-content/uploads/... Making Neural Programming Architectures Generalize via Recursion - https://openreview.net/forum?id=BkbY4psgg https://openreview.net/forum?id=BkbY4psgg Neural Programmer Interpreters - https://arxiv.org/abs/1511.06279 https://arxiv.org/abs/1511.06279
- Aron 9y ago
  Your first paper references the one I was thinking of: the Turing NN. Thanks. I hope you learned something useful while digging.