Optimal importance sampling for the approximation of integrals (Q964918): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4850055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate problems. Volume I: Linear information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4183861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New averaging technique for approximating weighted integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subspaces of L\(^p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-time property for a class of randomized quadratures / rank
 
Normal rank

Latest revision as of 16:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Optimal importance sampling for the approximation of integrals
scientific article

    Statements

    Optimal importance sampling for the approximation of integrals (English)
    0 references
    0 references
    21 April 2010
    0 references
    The Monte Carlo method is a very appropriate tool for numerical approximation of multidimensional integrals. In the present paper, \(d\) denotes the dimension and the weight \(\rho\) is a probability density function on the Borel measurable set \(D \subseteq {\mathbb R}^{d}.\) The integration problem \(I(f) = \int_{D}f(x)\rho(x) \,dx,\) where the function \(f:D \to {\mathbb R}\) belongs to some reproducing kernel Hilbert space, is considered. The above problem is rewritten in the terms of another probability density function \(\omega\) on \(D.\) Using \(n\) random sample points \(x_{1}, x_{2}, \ldots , x_{n},\) according to the new probability density function \(\omega,\) the Monte Carlo algorithm \(Q_{n}(f)= {1 \over n}\sum_{i=1}^{n} {f(x_{i}) \rho(x_{i}) \over \omega(x_{i})}\) for numerical approximation of \(I(f)\) is proposed. The notions of an initial error and a worst case error of the randomized algorithm \(Q_{n}(f)\) are defined. In Section 2, the problem for a change of the density function is developed. The Pietsch domination theorem is recalled. In Section 3, the importance sampling from change of the density function is considered. Theorem 3 states the existence of a density function \(\omega > 0\) such that the worst case error of importance sampling with density function \(\omega\) has an order \({\mathcal O}(n^{-{1 \over 2}}).\) Theorem 4 considers the case when the reproducing kernel is nonnegative. This theorem confirms the existence of a density function \(\omega\) such that the worst case error of importance sampling with density function \(\omega\) has an order \({\mathcal O}(n^{-{1 \over 2}}).\) In Section 4, as a consequence of Theorems 3 and 4, the polynomial tractability of the multivariate integration problem is obtained. This is the contents of Theorem 5. In Section 5, two concrete examples of reproducing kernel Hilbert spaces are considered. The details, connected with the form of the reproducing kernels and the errors, are developed. The construction of the corresponding density functions \(\omega\) is presented. The cases of integration of non-periodic and periodic functions are discussed.
    0 references
    multivariate integration
    0 references
    Monte Carlo method
    0 references
    importance sampling
    0 references
    randomized setting
    0 references
    tractability
    0 references
    worst case error
    0 references
    Pietsch domination theorem
    0 references
    reproducing kernel Hilbert spaces
    0 references

    Identifiers