%0 Generic %1 rainforth2018inference %A Rainforth, Tom %A Zhou, Yuan %A Lu, Xiaoyu %A Teh, Yee Whye %A Wood, Frank %A Yang, Hongseok %A van de Meent, Jan-Willem %D 2018 %K learning %T Inference Trees: Adaptive Inference with Exploration %U http://arxiv.org/abs/1806.09550 %X We introduce inference trees (ITs), a new class of inference methods that build on ideas from Monte Carlo tree search to perform adaptive sampling in a manner that balances exploration with exploitation, ensures consistency, and alleviates pathologies in existing adaptive methods. ITs adaptively sample from hierarchical partitions of the parameter space, while simultaneously learning these partitions in an online manner. This enables ITs to not only identify regions of high posterior mass, but also maintain uncertainty estimates to track regions where significant posterior mass may have been missed. ITs can be based on any inference method that provides a consistent estimate of the marginal likelihood. They are particularly effective when combined with sequential Monte Carlo, where they capture long-range dependencies and yield improvements beyond proposal adaptation alone.

@misc{rainforth2018inference, abstract = {We introduce inference trees (ITs), a new class of inference methods that build on ideas from Monte Carlo tree search to perform adaptive sampling in a manner that balances exploration with exploitation, ensures consistency, and alleviates pathologies in existing adaptive methods. ITs adaptively sample from hierarchical partitions of the parameter space, while simultaneously learning these partitions in an online manner. This enables ITs to not only identify regions of high posterior mass, but also maintain uncertainty estimates to track regions where significant posterior mass may have been missed. ITs can be based on any inference method that provides a consistent estimate of the marginal likelihood. They are particularly effective when combined with sequential Monte Carlo, where they capture long-range dependencies and yield improvements beyond proposal adaptation alone.}, added-at = {2019-01-09T11:05:19.000+0100}, author = {Rainforth, Tom and Zhou, Yuan and Lu, Xiaoyu and Teh, Yee Whye and Wood, Frank and Yang, Hongseok and van de Meent, Jan-Willem}, biburl = {https://www.bibsonomy.org/bibtex/265435387bac1f29c947cae74eb3d0e3b/stuart10}, description = {Inference Trees: Adaptive Inference with Exploration}, interhash = {356e5d2072cc9fbb259fcbb89b60e0e2}, intrahash = {65435387bac1f29c947cae74eb3d0e3b}, keywords = {learning}, note = {cite arxiv:1806.09550}, timestamp = {2019-01-09T11:05:19.000+0100}, title = {Inference Trees: Adaptive Inference with Exploration}, url = {http://arxiv.org/abs/1806.09550}, year = 2018 }