There are many computational tasks, in which it is necessary to sample a given probability density function （or pdf for short）, i.e., to use a computer to construct a sequence of independent random vectors x~ （i --...There are many computational tasks, in which it is necessary to sample a given probability density function （or pdf for short）, i.e., to use a computer to construct a sequence of independent random vectors x~ （i ---- 1, 2, ~ ~ ~ ）, whose histogram converges to the given pdf. This can be difficult because the sample space can be huge, and more importantly, because the portion of the space, where the density is significant, can be very small, so that one may miss it by an ill-designed sampling scheme. Indeed, Markov- chain Monte Carlo, the most widely used sampling scheme, can be thought of as a search algorithm, where one starts at an arbitrary point and one advances step-by-step towards the high probability region of the space. This can be expensive, in particular because one is typically interested in independent samples, while the chain has a memory. The authors present an alternative, in which samples are found by solving an algebraic equation with a random right-hand side rather than by following a chain; each sample is independent of the previous samples. The construction in the context of numerical integration is explained, and then it is applied to data assimilation.展开更多
基金Project supported by the Director, Office of Science, Computational and Technology Research, U.S.Department of Energy (No. DE-AC02-05CH11231)the National Science Foundation (Nos.DMS-0705910, OCE-0934298)
文摘There are many computational tasks, in which it is necessary to sample a given probability density function （or pdf for short）, i.e., to use a computer to construct a sequence of independent random vectors x~ （i ---- 1, 2, ~ ~ ~ ）, whose histogram converges to the given pdf. This can be difficult because the sample space can be huge, and more importantly, because the portion of the space, where the density is significant, can be very small, so that one may miss it by an ill-designed sampling scheme. Indeed, Markov- chain Monte Carlo, the most widely used sampling scheme, can be thought of as a search algorithm, where one starts at an arbitrary point and one advances step-by-step towards the high probability region of the space. This can be expensive, in particular because one is typically interested in independent samples, while the chain has a memory. The authors present an alternative, in which samples are found by solving an algebraic equation with a random right-hand side rather than by following a chain; each sample is independent of the previous samples. The construction in the context of numerical integration is explained, and then it is applied to data assimilation.
