3 ms·
Just an FYI - you can achieve this in 3 layers. It does not need to be deep. https://github.com/charliec443/TreeGrad https://github.com/charliec443/TreeGrad
by opensandwich 3y ago
Just an FYI - you can achieve this in 3 layers. It does not need to be deep.
https://github.com/charliec443/TreeGrad https://github.com/charliec443/TreeGrad
- Dobiasd 3y agoYeah, this one does something much less insane, i.e., it converts the paths to the tree outputs into their corresponding DNS (disjunctive normal form) and represents each term as a node (side by side in the same layer) in the NN, as described by Arunava Banerjee in "Initializing Neural Networks using Decision" [1]. The resulting NN architecture is much more reasonable than the one that treebomination produces. [1]: https://www.cise.ufl.edu/~arunava/papers/clnl94.pdf https://www.cise.ufl.edu/~arunava/papers/clnl94.pdf