Abstract
Monte Carlo methods, such as importance sampling, have become a major tool in Bayesian inference. However, in order to produce an accurate estimate, the sampling distribution is required to be close to the target distribution. Several adaptive importance sampling algorithms, proposed over the last few years, attempt to learn a good sampling distribution automatically, but their performance is often unsatisfactory. In addition, a theoretical analysis, which takes into account the computational cost of the sampling algorithms, is still lacking. In this paper, we present a first attempt at such analysis, and we propose some modifications to existing adaptive importance sampling algorithms, which produce significantly more accurate estimates.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.