Hacker News new | ask | show | jobs
by jkbschwarz 3395 days ago
To your point that they are comparing small datasets. I dont see that as a problem. If they achieve better results on small datasets that is a great achievement, as often the bottleneck is the size of the dataset rather than computation time.
2 comments

> often the bottleneck is the size of the dataset rather than computation time

That's generally true for DNNs, which is a good place to be if you have lots of data. This typically isn't true for tree based approaches, which is why they fell out of fashion in some problem domains; they don't generalize as well. This paper doesn't seem to change what we already know in this respect.

They achieve substantially worse results than state of the art on (the toy dataset) MNIST.