<p>Integration against, and hence sampling from, high-dimensional probability distributions is of essential importance in many application areas and has been an active research area for decades. One approach that has drawn increasing attention in recent years has been the generation of samples from a target distribution <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {tar} }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">P</mi> <mtext>tar</mtext> </msub> </math></EquationSource> </InlineEquation> using transport maps: if <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {tar} } = T_\sharp \mathbb {P}_{\text {ref} }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">P</mi> <mtext>tar</mtext> </msub> <mo>=</mo> <msub> <mi>T</mi> <mo>♯</mo> </msub> <msub> <mi mathvariant="double-struck">P</mi> <mtext>ref</mtext> </msub> </mrow> </math></EquationSource> </InlineEquation> is the pushforward of an easily-sampled probability distribution <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {ref} }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">P</mi> <mtext>ref</mtext> </msub> </math></EquationSource> </InlineEquation> under the transport map <i>T</i>, then the application of <i>T</i> to <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {ref} }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">P</mi> <mtext>ref</mtext> </msub> </math></EquationSource> </InlineEquation>-distributed samples yields <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {tar} }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">P</mi> <mtext>tar</mtext> </msub> </math></EquationSource> </InlineEquation>-distributed samples. This paper proposes the application of transport maps not just to random samples, but also to quasi-Monte Carlo points, higher-order nets, and sparse grids so that the transformed samples inherit the original convergence rates that are often better than <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(N^{-1/2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>N</mi> <mrow> <mo>-</mo> <mn>1</mn> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> </math></EquationSource> </InlineEquation>, <i>N</i> being the number of samples/quadrature nodes. Our main result is the derivation of an explicit transport map for the case that <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {tar} }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">P</mi> <mtext>tar</mtext> </msub> </math></EquationSource> </InlineEquation> is a mixture of simple distributions, e.g. a Gaussian mixture, in which case application of the transport map <i>T</i> requires the solution of an <i>explicit</i> ODE with <i>closed-form</i> right-hand side. Mixture distributions are of particular applicability and interest since many methods proceed by first approximating <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\mathbb {P}_{\text {tar} }\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">P</mi> <mtext>tar</mtext> </msub> </math></EquationSource> </InlineEquation> by a mixture and then sampling from that mixture (often using importance reweighting). Hence, this paper allows for the sampling step to provide a better convergence rate than <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(N^{-1/2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>N</mi> <mrow> <mo>-</mo> <mn>1</mn> <mo stretchy="false">/</mo> <mn>2</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> for all such methods.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Transporting higher-order quadrature rules - Quasi-Monte Carlo points and sparse grids for mixture distributions

  • Ilja Klebanov,
  • T. J. Sullivan

摘要

Integration against, and hence sampling from, high-dimensional probability distributions is of essential importance in many application areas and has been an active research area for decades. One approach that has drawn increasing attention in recent years has been the generation of samples from a target distribution \(\mathbb {P}_{\text {tar} }\) P tar using transport maps: if \(\mathbb {P}_{\text {tar} } = T_\sharp \mathbb {P}_{\text {ref} }\) P tar = T P ref is the pushforward of an easily-sampled probability distribution \(\mathbb {P}_{\text {ref} }\) P ref under the transport map T, then the application of T to \(\mathbb {P}_{\text {ref} }\) P ref -distributed samples yields \(\mathbb {P}_{\text {tar} }\) P tar -distributed samples. This paper proposes the application of transport maps not just to random samples, but also to quasi-Monte Carlo points, higher-order nets, and sparse grids so that the transformed samples inherit the original convergence rates that are often better than \(N^{-1/2}\) N - 1 / 2 , N being the number of samples/quadrature nodes. Our main result is the derivation of an explicit transport map for the case that \(\mathbb {P}_{\text {tar} }\) P tar is a mixture of simple distributions, e.g. a Gaussian mixture, in which case application of the transport map T requires the solution of an explicit ODE with closed-form right-hand side. Mixture distributions are of particular applicability and interest since many methods proceed by first approximating \(\mathbb {P}_{\text {tar} }\) P tar by a mixture and then sampling from that mixture (often using importance reweighting). Hence, this paper allows for the sampling step to provide a better convergence rate than \(N^{-1/2}\) N - 1 / 2 for all such methods.