A short note on the decision tree based neural turing machine
Yingshi Chen

TL;DR
This paper explores the connection between decision trees and neural Turing machines, showing that differentiable forests are a special case of NTMs and proposing a new model called RaDF.
Contribution
It reveals a deep theoretical link between decision trees and NTMs and introduces the response augmented differential forest (RaDF) model.
Findings
Differentiable forest is a special case of NTM.
RaDF uses response vectors as external memory.
The paper establishes a theoretical connection between decision trees and NTMs.
Abstract
Turing machine and decision tree have developed independently for a long time. With the recent development of differentiable models, there is an intersection between them. Neural turing machine(NTM) opens door for the memory network. It use differentiable attention mechanism to read/write external memory bank. Differentiable forest brings differentiable properties to classical decision tree. In this short note, we show the deep connection between these two models. That is: differentiable forest is a special case of NTM. Differentiable forest is actually decision tree based neural turing machine. Based on this deep connection, we propose a response augmented differential forest (RaDF). The controller of RaDF is differentiable forest, the external memory of RaDF are response vectors which would be read/write by leaf nodes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Machine Learning and ELM · Reinforcement Learning in Robotics
