1 code implementation • 1 Jan 2021 • Johannes Ackermann, Oliver Paul Richter, Roger Wattenhofer
We show the generality of our approach by evaluating on simple discrete and continuous control tasks, as well as complex bipedal walker tasks and Atari games.
no code implementations • NeurIPS Workshop LMCA 2020 • Jorel Elmiger, Lukas Faber, Pankaj Khanchandani, Oliver Paul Richter, Roger Wattenhofer
Given there are quadratically many possible edges in a graph and each subset of edges is a possible solution, this yields unfeasibly large search spaces even for few nodes.