2019

Credit Assignment Techniques in Stochastic Computation Graphs

Weber, Théophane, Heess, Nicolas, Buesing, Lars et al.

Understand

Stochastic computation graphs (SCGs) provide a formalism to represent structured optimization problems arising in artificial intelligence, including supervised, unsupervised, and reinforcement learning.

  • Previous work has shown that an unbiased estimator of the gradient of the expected loss of SCGs can be derived from a single principle.
  • However, this estimator often has high variance and requires a full model evaluation per data point, making this algorithm costly in large graphs.
  • In this work, we address these problems by generalizing concepts from the reinforcement learning literature.

Reading the bibliography…