64 citations · 92 across the 7 of their papers we have counts for
17 papers
-Stable convergence of heavy-tailed infinitely-wide neural networks
Paul Jung, Hoil Lee, Jiho Lee +1
We consider infinitely-wide multi-layer perceptrons (MLPs) which are limits of standard deep feed-forward neural networks. We assume that, for each layer, the weights of an MLP are…
Bayesian Policy Search for Stochastic Domains
David Tolpin, Yuan Zhou, Hongseok Yang
AI planning can be cast as inference in probabilistic models, and probabilistic programming was shown to be capable of policy search in partially observable domains. Prior work int…
Probabilistic Programs with Stochastic Conditioning
David Tolpin, Yuan Zhou, Tom Rainforth +1
We tackle the problem of conditioning probabilistic programs on distributions of observable variables. Probabilistic programs are usually conditioned on samples from the joint data…
On Correctness of Automatic Differentiation for Non-Differentiable Functions
Wonyeol Lee, Hangyeol Yu, Xavier Rival +1
Differentiation lies at the core of many machine-learning algorithms, and is well-supported by popular autodiff systems, such as TensorFlow and PyTorch. Originally, these systems h…
Stochastically Differentiable Probabilistic Programs
David Tolpin, Yuan Zhou, Hongseok Yang
Probabilistic programs with mixed support (both continuous and discrete latent random variables) commonly appear in many probabilistic programming systems (PPSs). However, the exis…
Differentiable Algorithm for Marginalising Changepoints
Hyoungjin Lim, Gwonsoo Che, Wonyeol Lee +1
We present an algorithm for marginalising changepoints in time-series models that assume a fixed number of unknown changepoints. Our algorithm is differentiable with respect to its…