Also called biased sampling , this is one of the variance-reducing techniques in Monte Carlo methods. A key issue in order to achieve small errors on the obtained result (for a given number of samplings) is a suitable strategy of sampling the available multidimensional space. If the volume to be sampled is large, but is characterized by small probabilities over most parts, one achieves importance sampling by approximating the probability distribution by some function P(x), and generating randomly x according to P, weighting each result at the same time by . If a Monte Carlo calculation is visualized as a numerical integration in one dimension, say, importance sampling translates into a change of integration variable (interpret f(x) as a probability density function and use the transformation rule):
[1]
D. Knuth.
Estimating the efficiency of backtrack programs.
,
1974
.
[2]
Martin E. Dyer,et al.
A random polynomial-time algorithm for approximating the volume of convex bodies
,
1991,
JACM.
[3]
Thomas M. Cover,et al.
Elements of Information Theory
,
2005
.
[4]
David Applegate,et al.
Sampling and integration of near log-concave functions
,
1991,
STOC '91.
[5]
Noga Alon,et al.
The Probabilistic Method
,
2015,
Fundamentals of Ramsey Theory.
[6]
Miklós Simonovits,et al.
Random walks and an O*(n5) volume algorithm for convex bodies
,
1997,
Random Struct. Algorithms.
[7]
Shie Mannor,et al.
A Tutorial on the Cross-Entropy Method
,
2005,
Ann. Oper. Res..