3 ms·
NNs can approximate any computable function. Any function can also be approximated by a polynomial. This is all proven math and has been known for a long time
by sjg007 7y ago
NNs can approximate any computable function. Any function can also be approximated by a polynomial. This is all proven math and has been known for a long time. I think of these as different facets of the same thing and each has different tools for computing, analyzing and understanding.
- lars 7y agoA hash table can also approximate any function, so the "universal function approximation" thing is a bit oversold. It isn't really what matters. What matters is how well methods generalize beyond the training data, and how much data they need to do this well.