You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
First thanks for your awesome package !
Otherwise, do you plan handling gradients in stochastic computation graph, i.e. graph with conditional probability distributions such as
using Distributions
w =ones(5); x =rand(5);
p =1/ (1+exp(-vecdot(w, x)))
y =rand(Bernoulli(p, 1))
loss = (y ==1)
sorry for the very very late answer. I guess that the answer is that you will find the building blocks for creating the stochastic nodes described in the paper in these examples:
Hi all !
First thanks for your awesome package !
Otherwise, do you plan handling gradients in stochastic computation graph, i.e. graph with conditional probability distributions such as
In Schulman, J., Heess, N., Weber, T., & Abbeel, Gradient Estimation Using Stochastic Computation Graphs., it is described how to convert the stochastic computation graph into a deterministic computation graph, to which the backpropagation algorithm can be applied to a surrogate loss function which results in an unbiased gradient estimator for our stochastic loss.
Would you know how (and how much work is required) this could be implemented with(in) your package ?
Best,
Emile
The text was updated successfully, but these errors were encountered: