3 ms·
Define computational depth. Non linearity? Parallelizable? Computational depth sounds like hyperbole. You're still approaching stats problems with the same met
by codesushi42 7y ago
Define computational depth. Non linearity? Parallelizable? Computational depth sounds like hyperbole.
You're still approaching stats problems with the same methodologies. Your just using NNs as your optimizer.
- sjg007 7y agoIf you are interested, I would suggest reading up on the https://en.wikipedia.org/wiki/Universal_approximation_theorem https://en.wikipedia.org/wiki/Universal_approximation_theore...
- 6gvONxR4sf7o 7y agoThere are theorems like that for polynomials and fourier series and all sorts of other function classes too. They are just as practically relevant (or irrelevant).
- sjg007 7y agoSure... I mean it is matrices all the way down but the claim that AI (e.g. deep learning) is just applied statistics is disingenuous.