|
|
|
|
|
by stealthcat
1353 days ago
|
|
So far sadly yes?
http://www.incompleteideas.net/IncIdeas/BitterLesson.html tl;dr
So far things that enable faster search and faster learning win over long run. Recursive things like backprop in NN and optimizing reward over long trees of states, seem to win despite huge compute requirements. Personally I think we are still on the right track of trying to do the right thing, then do the thing right, then do the thing faster. You cannot refute the things you do not understand. |
|