Re:Combinatorial optimization with reinforcement learning
by jmite on Tuesday December 26, 2017 @02:02AM
(#16007554)
Can't a neural network only ever achieve an O(1) time approximation of an NP hard problem? Unless you're using it as a heuristic inside some broader search algorithm.
[ Parent
| on HN ]
There are no comments on this comment yet.