Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

More like the universal approximation theorem extended to computation rather than network complexity: https://en.wikipedia.org/wiki/Universal_approximation_theore...


The universal approximation theorem is good to know because says there's no theoretical upper bound to a function-approximating NN's accuracy. In practice it says nothing about what can be realistically achieved, though.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: