Inference Trees:带探索的自适应推理
Inference Trees: Adaptive Inference with Exploration
摘要:
我们引入推理树(IT),一类新的推理方法,建立在从蒙特卡罗树搜索的想法,以执行自适应采样的方式,平衡探索与开发,确保一致性,并在现有的自适应方法的病理学。IT自适应地从参数空间的分层分区中采样,同时以在线方式学习这些分区。这使得IT不仅能够识别高后部质量的区域,而且还能够保持不确定性估计,以跟踪可能错过重要后部质量的区域。IT可以基于提供边际似然的相合估计的任何推理方法。当与序贯蒙特卡罗结合使用时,它们特别有效,在这种情况下,它们可以捕获长期依赖关系,并产生超越建议适应的改进。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。