Abstract | ||
---|---|---|
Importance sampling (IS) and its variant, annealed IS (AIS) have been widely used for estimating the partition function in graphical models, such as Markov random fields and deep generative models. However, IS tends to underestimate the partition function and is subject to high variance when the proposal distribution is more peaked than the target distribution. On the other hand, \"reverse\" versions of IS and AIS tend to overestimate the partition function, and degenerate when the target distribution is more peaked than the proposal distribution. In this work, we present a simple, general method that gives much more reliable and robust estimates than either IS (AIS) or reverse IS (AIS). Our method works by converting the estimation problem into a simple classification problem that discriminates between the samples drawn from the target and the proposal. We give extensive theoretical and empirical justification; in particular, we show that an annealed version of our method significantly outperforms both AIS and reverse AIS as proposed by Burda et al. (2015), which has been the state-of-the-art for likelihood evaluation in deep generative models. |
Year | Venue | Field |
---|---|---|
2015 | UAI | Degenerate energy levels,Importance sampling,Random field,Partition function (statistical mechanics),Markov chain,Artificial intelligence,Sampling (statistics),Graphical model,Mathematics,Machine learning |
DocType | Citations | PageRank |
Conference | 4 | 0.46 |
References | Authors | |
10 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Liu, Qiang | 1 | 472 | 48.61 |
Peng, Jian | 2 | 430 | 50.07 |
Alexander T. Ihler | 3 | 1377 | 112.01 |
John W. Fisher III | 4 | 878 | 74.44 |