+In this project we are concerned with post inference prior swapping ([Neiswanger & Eric Xing (2017)](https://arxiv.org/abs/1606.00787)), in particular we are concerned with the following problem: suppose you would like to compute the posterior `p(theta|y) = l(y|theta)q(theta)/m(y)`, but the computational machinery currently available to you is not able to accurately compute expectations of a class of functions `H` with respect to `p`. The questions are then: (i) how to pick a member `w` from the set `W` of _computable_ priors such that `p_app(theta|y) = l(y|theta)w(theta)/m_app(y)` is the closest it can be to `p(theta|y)`and (ii) how to modify samples from `p_app(theta|y)` in order to compute `E_p[h]` as accurately as possible.
0 commit comments