Re:Neural networks meet space
by mholt on Thursday August 31, 2017 @08:30PM
(#15145221)
Neural networks are function approximators. So if you 1) know an algorithm that is really computationally complex but not highly random and 2) have a lot of inputs and outputs of that algorithm, you can usually train a neural network to approximate a closed-form formula of the algorithm. It boils down to a bunch of matrix-multiplies and some standard non-linear functions in between.
[ Parent
| on HN ]
is that anything close to like polynomial fitting? What with PTIME and NP-Completion?
Kind of - but instead of computational complexity in the "NP" sense, you have lots of data. It's often so hard to get good training data that the cost of just waiting out a big algorithm to finish can be cheaper. So you have to weigh that.