Hacker News new | ask | show | jobs
by wolfium3 1329 days ago
If you expand a NN to decision trees, the resulting decision tree(s) can take up orders of magnitude more space and take orders of magnitude more time to run than the original NN.

The paper is discussed here: https://www.youtube.com/watch?v=_okxGdHM5b8

2 comments

So...compressed decision trees?
at that point most things are compressed decision trees.
Possibly related: learning is isomorphic to compression, and the two may be in fact fundamentally the same thing.
Oh, wow. I'd long thought of my own learning as "when reality surprises, isn't merely what you'd expect, isn't "obvious", then fix that, with emphasis on simplicity and generality". I'd not recognized that as compression. Tnx!