News for hackers. Stuff that matters.
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.
Re:Neural networks meet space by posterboy on Friday September 01, 2017 @04:54AM (#15147061)
is that anything close to like polynomial fitting? What with PTIME and NP-Completion?
Re:Neural networks meet space by mholt on Friday September 01, 2017 @11:59AM (#15149620)
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.
Re:Neural networks meet space by posterboy on Friday September 01, 2017 @07:29PM (#15153114)
well sure, you said as much before. But I was also thinking, what if P~=NP, in the sense that any function can be approximated by a polynomial of sufficiently high degree.