Before revision:  The algorithmic aspects of CPGs are also discussed, including optimal policy factorisations, their complexity , and the use of conditioning to efficiently scale to extremely large, concurrent tasks. The performance advantages for two variants of the algorithm are demonstrated on large-scale bandit and concurrent inventory management problems .
After revision:  The algorithmic aspects of CPGs are also discussed, including optimal policy factorisations, their complexity , and the implications for the bias-variance trade-off of incorrectly specifying the network. Finally, we demonstrate the performance advantages of our algorithm on large-scale bandit and concurrent inventory management problems .