209 citations · 718 across the 24 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 2 cited
Approximate Inference in Discrete Distributions with Monte Carlo Tree Search and Value Functions
Lars Buesing, Nicolas Heess, Theophane Weber
A plethora of problems in AI, engineering and the sciences are naturally formalized as inference in discrete probabilistic models. Exact inference is often prohibitively expensive,…
cs.LG2019★ 13 cited
Credit Assignment Techniques in Stochastic Computation Graphs
Théophane Weber, Nicolas Heess, Lars Buesing +1
Stochastic computation graphs (SCGs) provide a formalism to represent structured optimization problems arising in artificial intelligence, including supervised, unsupervised, and r…