Low Discrepancy at Argonne 2023 May

Slides for a talk that was part of a mini-workshop at Argonne National Laboratory, May 18, 2023 organized by the High Energy Physics division

Transcript

1. Faster Monte Carlo via Low Discrepancy Sampling Fred J. Hickernell Illinois Institute of Technology Dept Applied Math Ctr Interdisc Scientific Comput Office of Research hickernell@iit.edu sites.google.com/iit.edu/fred-j-hickernell Thank you for your invitation and hospitality, Slides at speakerdeck.com/fjhickernell/argonne2023maytalk Jupyter notebook with computations and figures here Visit us at qmcpy.org Argonne Seminar, revised Thursday 18th May, 2023
2. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Family of Physicists Fred S. Hickernell (father), PhD Physics, IEEE Fellow, Motorola researcher Robert K. Hickernell (brother), PhD Physics, NIST Division Director Thomas S. Hickernell (brother), PhD Physics, Motorola researcher, elite charter school teacher 2/25
3. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Family of Physicists Fred S. Hickernell (father), PhD Physics, IEEE Fellow, Motorola researcher Robert K. Hickernell (brother), PhD Physics, NIST Division Director Thomas S. Hickernell (brother), PhD Physics, Motorola researcher, elite charter school teacher Myself, BA mathematics and physics who became an applied mathematician 2/25
4. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Message Problems in Bayesian inference, uncertainty quantification, quantitative finance, (high energy) physics1, etc. require numerically evaluating E[f(X)] expectation = Ω f(x) ϱ(x) dx integral , X ∼ ϱ Other more complicated problems include computing quantiles or marginal distributions. 1M. R. Blaszkiewicz (Feb. 2022). “Methods to optimize rare-event Monte Carlo reliability simulations for Large Hadron Collider Protection Systems”. MA thesis. University of Amsterdam. url: https://cds.cern.ch/record/2808520; A. Courtoy, J. Huston, et al. (2023). “Parton distributions need representative sampling”. In: Phys. Rev. D 107.034008. url: https://journals.aps.org/prd/pdf/10.1103/PhysRevD.107.034008; D. Everett, W. Ke, et al. (May 2021). “Multisystem Bayesian constraints on the transport coefficients of QCD matter”. In: Phys. Rev. C 103.5. doi: 10.1103/physrevc.103.054904; D. Liyanage, Y. Ji, et al. (Mar. 2022). “Efficient emulation of relativistic heavy ion collisions with transfer learning”. In: Phys. Rev. C 105.3. doi: 10.1103/physrevc.105.034910. 3/25
5. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Message Problems in Bayesian inference, uncertainty quantification, quantitative finance, (high energy) physics, etc. require numerically evaluating E[f(X)] expectation = Ω f(x) ϱ(x) dx integral , X ∼ ϱ There is value in low discrepancy sampling, aka quasi-Monte Carlo methods data-driven error bounds flattening and reducing the effective dimension of the integrand quality quasi-Monte Carlo software like qmcpy1 physicists and quasi-Monte Carlo theorists collaborating more 1S.-C. T. Choi, F. J. H., et al. (2023). QMCPy: A quasi-Monte Carlo Python Library (versions 1–1.4). doi: 10.5281/zenodo.3964489. url: https://qmcsoftware.github.io/QMCSoftware/. 3/25
6. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Message Problems in Bayesian inference, uncertainty quantification, quantitative finance, (high energy) physics, etc. require numerically evaluating E[f(X)] expectation = Ω f(x) ϱ(x) dx integral , X ∼ ϱ There is value in low discrepancy sampling, aka quasi-Monte Carlo methods data-driven error bounds flattening and reducing the effective dimension of the integrand quality quasi-Monte Carlo software like qmcpy physicists and quasi-Monte Carlo theorists collaborating more Caveat: I know little about Markov Chain Monte Carlo (MCMC); limited success combining with quasi-Monte Carlo2. 2S. Chen, J. Dick, and A. B. Owen (2011). “Consistency of Markov Chain Quasi-Monte Carlo on Continuous State Spaces”. In: Ann. Stat. 9, pp. 673–701; Art B. Owen and Seth D. Tribble (2005). “A quasi-Monte Carlo Metropolis algorithm”. In: Proc. Natl. Acad. Sci. 102, pp. 8844–8849. 3/25
7. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Trapezoidal rule Trio identity3 — the error of approximating an expectation or integral expressed as the product of three quantities 1 0 f(x) dx − n i=0 wif(xi ) = 0.112 wi = xi+1 − xi−1 2 = 1 0 f(x) dx − n i=0 wif(xi ) maxi (xi+1−xi )2 8 1 0 |f′′(x)| dx misfortune 0.151 maxi (xi+1 − xi )2 8 sampling deficit 0.020 1 0 |f′′(x)| dx roughness 37.3 x0 x1 x2 x3 x4 x 0.0 0.5 1.0 1.5 2.0 f(x) 3F. J. H. (2018). “The Trio Identity for Quasi-Monte Carlo Error Analysis”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Stanford, USA, August 2016. Ed. by P. Glynn and A. Owen. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin, pp. 3–27. doi: 10.1007/978-3-319-91436-7; A. Courtoy, J. Huston, et al. (2023). “Parton distributions need representative sampling”. In: Phys. Rev. D 107.034008. url: https://journals.aps.org/prd/pdf/10.1103/PhysRevD.107.034008; X. Meng (2018). “Statistical Paradises and Paradoxes in Big Data (I): Law of Lage Popluations, Big Data Paradox, and 2016 US Presidential Election”. In: Ann. Appl. Stat. 12, pp. 685–726. 4/25
8. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Trapezoidal rule Trio identity3 — the error of approximating an expectation or integral expressed as the product of three quantities 1 0 f(x) dx − n i=0 wif(xi ) = 0.112 wi = xi+1 − xi−1 2 = 1 0 f(x) dx − n i=0 wif(xi ) maxi (xi+1−xi )2 8 1 0 |f′′(x)| dx misfortune 0.151 confounding maxi (xi+1 − xi )2 8 sampling deficit 0.020 discrepancy 1 0 |f′′(x)| dx roughness 37.3 variation Confounding is between −1 and 1 (Brass and Petras 2011, (7.15)) Discrepancy depends upon sample only Variation depends on integrand only, semi-norm x0 x1 x2 x3 x4 x 0.0 0.5 1.0 1.5 2.0 f(x) 3F. J. H. (2018). “The Trio Identity for Quasi-Monte Carlo Error Analysis”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Stanford, USA, August 2016. Ed. by P. Glynn and A. Owen. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin, pp. 3–27. doi: 10.1007/978-3-319-91436-7; A. Courtoy, J. Huston, et al. (2023). “Parton distributions need representative sampling”. In: Phys. Rev. D 107.034008. url: https://journals.aps.org/prd/pdf/10.1103/PhysRevD.107.034008; X. Meng (2018). “Statistical Paradises and Paradoxes in Big Data (I): Law of Lage Popluations, Big Data Paradox, and 2016 US Presidential Election”. In: Ann. Appl. Stat. 12, pp. 685–726. 4/25
9. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Trapezoidal rule Trio identity3 — the error of approximating an expectation or integral expressed as the product of three quantities 1 0 f(x) dx − n i=0 wif(xi ) = 0.112 wi = xi+1 − xi−1 2 = 1 0 f(x) dx − n i=0 wif(xi ) maxi (xi+1−xi )2 8 1 0 |f′′(x)| dx misfortune 0.151 confounding maxi (xi+1 − xi )2 8 sampling deficit 0.020 discrepancy 1 0 |f′′(x)| dx roughness 37.3 variation Confounding is between −1 and 1 (Brass and Petras 2011, (7.15)) Discrepancy reduced via clever or more sampling Variation value unknown, reduced via transformations x0 x1 x2 x3 x4 x 0.0 0.5 1.0 1.5 2.0 f(x) 3F. J. H. (2018). “The Trio Identity for Quasi-Monte Carlo Error Analysis”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Stanford, USA, August 2016. Ed. by P. Glynn and A. Owen. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin, pp. 3–27. doi: 10.1007/978-3-319-91436-7; A. Courtoy, J. Huston, et al. (2023). “Parton distributions need representative sampling”. In: Phys. Rev. D 107.034008. url: https://journals.aps.org/prd/pdf/10.1103/PhysRevD.107.034008; X. Meng (2018). “Statistical Paradises and Paradoxes in Big Data (I): Law of Lage Popluations, Big Data Paradox, and 2016 US Presidential Election”. In: Ann. Appl. Stat. 12, pp. 685–726. 4/25
10. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Independent and Identically Distributed (IID) Monte Carlo E[f(X)], X∼ϱ Rd f(x) ϱ(x) dx − 1 n n i=0 f(xi ) xi IID ∼ ϱ = Rd f(x) ϱ(x) dx − 1 n n i=0 f(xi ) 1 √ n std[f(X)] confounding 1 √ n discrepancy std(f(X)) variation RMS[confounding] = 1, but confounding could be O( √ n) Discrepancy depends on sample size only Variation reduced through transformations 0 1 xi,1 0 1 xi,2 IID X ∼ U[0, 1]d 5/25
11. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Sampling aka Quasi-Monte Carlo4 E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) VAR2(f) = [0,1] ∂f ∂x1 (x1 , 0.5, . . . , 0.5) 2 dx1 + · · · + [0,1]2 ∂2f ∂x1 ∂x2 (x1 , x2 , 0.5, . . . , 0.5) 2 dx1 dx2 + · · · + [0,1]d ∂df ∂x1 · · · ∂xd (x) 2 dx 0 1 xi,1 0 1 xi,2 Lattice X ∼ U[0, 1]d VAR is a semi-norm, more smoothness than std, value generally unknown, reduced through transformations 4F. J. H. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. 6/25
12. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Sampling aka Quasi-Monte Carlo4 E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) DSC2({xi }n i=1 ) = 13 12 2 − 2 n n i=1 d j=1 1 + 0.5 |xij − 0.5| − 0.5(xij − 0.5)2 + 1 n2 n i,k=1 [1 + 0.5 |xij − 0.5| + 0.5 |xkj − 0.5| − 0.5 |xij − xkj |] 0 1 xi,1 0 1 xi,2 Lattice X ∼ U[0, 1]d DSC({xi }n i=1 ) = O(n−1+δ) DSC is the norm of the error functional, value known with O(dn2) operations 4F. J. H. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. 6/25
13. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Sampling aka Quasi-Monte Carlo4 E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) DSC2({xi }n i=1 ) = 13 12 2 − 2 n n i=1 d j=1 1 + 0.5 |xij − 0.5| − 0.5(xij − 0.5)2 + 1 n2 n i,k=1 [1 + 0.5 |xij − 0.5| + 0.5 |xkj − 0.5| − 0.5 |xij − xkj |] 0 1 xi,1 0 1 xi,2 Sobol’ X ∼ U[0, 1]d DSC({xi }n i=1 ) = O(n−1+δ) 4F. J. H. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. 6/25
14. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Sampling aka Quasi-Monte Carlo4 E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) DSC2({xi }n i=1 ) = 13 12 2 − 2 n n i=1 d j=1 1 + 0.5 |xij − 0.5| − 0.5(xij − 0.5)2 + 1 n2 n i,k=1 [1 + 0.5 |xij − 0.5| + 0.5 |xkj − 0.5| − 0.5 |xij − xkj |] 0 1 xi,1 0 1 xi,2 Halton X ∼ U[0, 1]d DSC({xi }n i=1 ) = O(n−1+δ) 4F. J. H. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. 6/25
15. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Sampling aka Quasi-Monte Carlo4 E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) DSC2({xi }n i=1 ) = 13 12 2 − 2 n n i=1 d j=1 1 + 0.5 |xij − 0.5| − 0.5(xij − 0.5)2 + 1 n2 n i,k=1 [1 + 0.5 |xij − 0.5| + 0.5 |xkj − 0.5| − 0.5 |xij − xkj |] 0 1 xi,1 0 1 xi,2 IID X ∼ U[0, 1]d DSC({xi }n i=1 ) = O(n−1/2) 4F. J. H. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. 6/25
16. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Sampling aka Quasi-Monte Carlo4 E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) CNF(f, {xi }n i=1 ) = [0,1]d f(x) dx − 1 n n i=0 f(xi ) DSC({xi }n i=1 ) VAR(f) between ± 1 0 1 xi,1 0 1 xi,2 Lattice X ∼ U[0, 1]d DSC({xi }n i=1 ) = O(n−1+δ) 4F. J. H. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. 6/25
17. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Uncertainty in a Cantilevered Beam5 u(x) = g(Z, x) = beam deflection = solution of a differential equation boundary value problem Z ∼ U[1, 1.2]3 defines uncertainty in Young’s modulus x = position µ(x) = E[g(Z, x)] = [0,1]3 g(z, x) dz ≈ 1 n n i=1 g(Zi , x) µ(end) = 1037 5M. Parno and L. Seelinger (2022). Uncertainty propagation of material properties of a cantilevered beam. url: https://um-bridge-benchmarks.readthedocs.io/en/docs/forward-benchmarks/muq-beam-propagation.html. 7/25
18. Beginning Trio Identity Stopping Rules Transforming the Integrand End References IID vs. Low Discrepancy for the Cantilevered Beam via QMCPy6 g(Z, x) = beam deflection Z ∼ U[1, 1.2]3 defines uncertainty x = position µ(x) = E[g(Z, x)] µ(end) = 1037 0 10 20 30 Position 0 250 500 750 1000 Mean Deflection Cantilevered Beam 10−2 10−1 100 101 102 Tolerance, ε 1 sec 1 min 1 hr Time (s) Lattice O(ε−1) IID O(ε−2) 10−2 10−1 100 101 102 Tolerance, ε 102 103 104 105 106 107 108 n Lattice O(ε−1) IID O(ε−2) 6S.-C. T. Choi, F. J. H., et al. (2023). QMCPy: A quasi-Monte Carlo Python Library (versions 1–1.4). doi: 10.5281/zenodo.3964489. url: https://qmcsoftware.github.io/QMCSoftware/. 8/25
19. Beginning Trio Identity Stopping Rules Transforming the Integrand End References IID vs. Low Discrepancy for the Cantilevered Beam via QMCPy6 g(Z, x) = beam deflection µ(x) = E[g(Z, x)] µ(end) = 1037 0 10 20 30 Position 0 250 500 750 1000 Mean Deflection Cantilevered Beam 10−2 10−1 100 Tolerance, ε 1 sec 1 min Time Lattice O(ε−1) Lattice Parallel 10−2 10−1 100 Tolerance, ε 101 102 103 104 105 n Lattice O(ε−1) Lattice Parallel 6S.-C. T. Choi, F. J. H., et al. (2023). QMCPy: A quasi-Monte Carlo Python Library (versions 1–1.4). doi: 10.5281/zenodo.3964489. url: https://qmcsoftware.github.io/QMCSoftware/. 8/25
20. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Points Fill Space 0 1 xi,1 0 1 xi,2 n = 64 0 1 xi,1 0 1 xi,2 n = 128 0 1 xi,1 0 1 xi,2 n = 256 0 1 xi,1 0 1 xi,2 n = 512 Lattice Points 0 1 0 1 xi,2 n = 64 0 1 0 1 xi,2 n = 128 0 1 0 1 xi,2 n = 256 0 1 0 1 xi,2 n = 512 Sobol’ Points 9/25
21. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Points Look “Good” in All Coordinate Projections 0 1 xi,1 0 1 xi,2 0 1 xi,2 0 1 xi,3 0 1 xi,5 0 1 xi,11 0 1 xi,14 0 1 xi,15 Projections of Lattice Points 0 1 0 1 xi,2 0 1 0 1 xi,3 0 1 0 1 xi,11 0 1 0 1 xi,15 Projections of Sobol’ Points 10/25
22. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Low Discrepancy Points Can Be Randomized 0 1 xi,1 0 1 xi,2 0 1 xi,1 0 1 xi,2 0 1 xi,1 0 1 xi,2 0 1 xi,1 0 1 xi,2 Randomized Lattice Points 0 1 0 1 xi,2 0 1 0 1 xi,2 0 1 0 1 xi,2 0 1 0 1 xi,2 Randomized Sobol’ Points 11/25
23. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Lessons from the Trio Identity E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) Use low discrepancy7 instead of IID sampling for performance gains 7J. Dick, P. Kritzer, and F. Pillichshammer (2022). Lattice Rules: Numerical Integration, Approximation, and Discrepancy. Springer Series in Computational Mathematics. Springer Cham. doi: https://doi.org/10.1007/978-3-031-09951-9; J. Dick, F. Kuo, and I. H. Sloan (2013). “High dimensional integration — the Quasi-Monte Carlo way”. In: Acta Numer. 22, pp. 133–288. doi: 10.1017/S0962492913000044; J. Dick and F. Pillichshammer (2010). Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge University Press. 12/25
24. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Lessons from the Trio Identity E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) Use low discrepancy7 instead of IID sampling for performance gains Randomize when possible so avoid bad CNF(f, {x}n i=1 ). 7J. Dick, P. Kritzer, and F. Pillichshammer (2022). Lattice Rules: Numerical Integration, Approximation, and Discrepancy. Springer Series in Computational Mathematics. Springer Cham. doi: https://doi.org/10.1007/978-3-031-09951-9; J. Dick, F. Kuo, and I. H. Sloan (2013). “High dimensional integration — the Quasi-Monte Carlo way”. In: Acta Numer. 22, pp. 133–288. doi: 10.1017/S0962492913000044; J. Dick and F. Pillichshammer (2010). Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge University Press. 12/25
25. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Lessons from the Trio Identity E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) Use low discrepancy7 instead of IID sampling for performance gains Randomize when possible so avoid bad CNF(f, {x}n i=1 ). Scrambled Sobol’ often beats unscrambled Sobol’ in order of convergence. Randomizing moves points off the boundaries. Error decay rate, DSC({x}n i=1 ), limited by the assumptions on f implicit in the choice of VAR Deterministic trio identities constrain −1 ≤ CNF(f, {x}n i=1 ) ≤ 1 but may be pessimistic If CNF(f, {x}n i=1 ) is consistently small, look for a better choice of VAR and DSC 7J. Dick, P. Kritzer, and F. Pillichshammer (2022). Lattice Rules: Numerical Integration, Approximation, and Discrepancy. Springer Series in Computational Mathematics. Springer Cham. doi: https://doi.org/10.1007/978-3-031-09951-9; J. Dick, F. Kuo, and I. H. Sloan (2013). “High dimensional integration — the Quasi-Monte Carlo way”. In: Acta Numer. 22, pp. 133–288. doi: 10.1017/S0962492913000044; J. Dick and F. Pillichshammer (2010). Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge University Press. 12/25
26. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Lessons from the Trio Identity E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) Use low discrepancy7 instead of IID sampling for performance gains Randomize when possible so avoid bad CNF(f, {x}n i=1 ). Scrambled Sobol’ often beats unscrambled Sobol’ in order of convergence. Randomizing moves points off the boundaries. Error decay rate, DSC({x}n i=1 ), limited by the assumptions on f implicit in the choice of VAR Deterministic trio identities constrain −1 ≤ CNF(f, {x}n i=1 ) ≤ 1 but may be pessimistic If CNF(f, {x}n i=1 ) is consistently small, look for a better choice of VAR and DSC Theory explains how well an algorithm works; practice can help sharpen theory 7J. Dick, P. Kritzer, and F. Pillichshammer (2022). Lattice Rules: Numerical Integration, Approximation, and Discrepancy. Springer Series in Computational Mathematics. Springer Cham. doi: https://doi.org/10.1007/978-3-031-09951-9; J. Dick, F. Kuo, and I. H. Sloan (2013). “High dimensional integration — the Quasi-Monte Carlo way”. In: Acta Numer. 22, pp. 133–288. doi: 10.1017/S0962492913000044; J. Dick and F. Pillichshammer (2010). Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge University Press. 12/25
27. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Estimating or Bounding the Error from Simulation Data E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) When to stop sampling because the error is small enough? VAR(f) is impractical to bound DSC({x}n i=1 ) is expensive to calculate 13/25
28. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Estimating or Bounding the Error from Simulation Data E[f(X)], X∼U[0,1]d [0,1]d f(x) dx − 1 n n i=0 f(xi ) = CNF(f, {x}n i=1 ) DSC({x}n i=1 ) VAR(f) When to stop sampling because the error is small enough? VAR(f) is impractical to bound DSC({x}n i=1 ) is expensive to calculate Many do replications [0,1]d f(x) dx − 1 n n i=0 f(xi ) 2 ≈ fudge2 R R r=1   1 Rn R,n q,i=1 f(x(q) i ) − 1 n n i=1 f(x(r) i )   2 where {x(1) i }n i=1 , . . . {x(R) i }n i=1 are randomizations of a low discrepancy sequence. 13/25
29. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Estimating or Bounding the Error from Simulation Data For lattice Sobol’ or sampling [0,1]d f(x) dx − 1 n n i=0 f(xi ) ≤ k∈dual lattice f(k) where f(k) are the Fourier complex exponential Walsh coefficients of f and the dual lattice consists of wave numbers of complex exponential Walsh bases that are perfectly aliased with 1. Rigorous data-driven error bounds based on sums of discrete Fourier complex exponential Walsh coefficients of f are valid for not too noisy/peaky f 8. 8F. J. H. and Ll. A. Jiménez Rugama (2016). “Reliable Adaptive Cubature Using Digital Sequences”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014. Ed. by R. Cools and D. Nuyens. Vol. 163. Springer Proceedings in Mathematics and Statistics. arXiv:1410.8615 [math.NA]. Springer-Verlag, Berlin, pp. 367–383; Ll. A. Jiménez Rugama and F. J. H. (2016). “Adaptive Multidimensional Integration Based on Rank-1 Lattices”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014. Ed. by R. Cools and D. Nuyens. Vol. 163. Springer Proceedings in Mathematics and Statistics. arXiv:1411.1966. Springer-Verlag, Berlin, pp. 407–422. 13/25
30. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Estimating or Bounding the Error from Simulation Data Data-driven error bounds based on credible intervals assume that f is an instance of a Gaussian process whose parameters are tuned; valid for f that are not outliers. Computation is fast if covariance kernel matches the sample8. 8R. Jagadeeswaran and F. J. H. (2019). “Fast Automatic Bayesian Cubature Using Lattice Sampling”. In: Stat. Comput. 29, pp. 1215–1229. doi: 10.1007/s11222-019-09895-9; R. Jagadeeswaran and F. J. H. (2022). “Fast Automatic Bayesian Cubature Using Sobol’ Sampling”. In: Advances in Modeling and Simulation: Festschrift in Honour of Pierre L’Ecuyer. Ed. by Z. Botev, A. Keller, C. Lemieux, and B. Tuffin. Springer, Cham, pp. 301–318. doi: 10.1007/978-3-031-10193-9\_15. 13/25
31. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Problems Involving Several Integrals posterior meanj = Rd xj likelihood(x, data) prior(x) dx Rd likelihood(x, data) prior(x) dx , j = 1, . . . , d expected output(s) = E[output(s, X)] = Rd output(s, x) ϱ(x) dx, s ∈ Ω sensitivity indexj = [0,1]2d f(x)[f(xj , z−j ) − f(z)] dx dz, j = 1, . . . , d Stopping criteria have been extended to these cases9 9F. J. H., Ll. A. Jiménez Rugama, and D. Li (2018). “Adaptive Quasi-Monte Carlo Methods for Cubature”. In: Contemporary Computational Mathematics — a celebration of the 80th birthday of Ian Sloan. Ed. by J. Dick, F. Y. Kuo, and H. Woźniakowski. Springer-Verlag, pp. 597–619. doi: 10.1007/978-3-319-72456-0; A. G. Sorokin and R. Jagadeeswaran (2023+). “Monte Carlo for Vector Functions of Integrals”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Linz, Austria, July 2022. Ed. by A. Hinrichs, P. Kritzer, and F. Pillichshammer. Springer Proceedings in Mathematics and Statistics. submitted for publication. Springer, Cham. 14/25
32. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Bayesian Logistic Regression for Cancer Survival Data logit(probability of 5 year survival) = β0 + β1patient age + β2operation year + β3# positive axillary nodes Logistic regression to estimate βj from 306 data10 with error criterion of absolute error ≤ 0.05 & relative error ≤ 0.5 method β0 β1 β2 β3 all true all true pos all pos true pos true pos + false neg Bayesian & qmcpy 0.0080 −0.0041 0.1299 −0.1569 74% 74% 100% elastic net 0.0020 −0.0120 0.0342 −0.11478 74% 77% 93% 10SJ Haberman (1976). Generalized residuals for log-linear models, proceedings of the 9th International Biometrics Conference. 15/25
33. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Lessons from Data-Based Error Bounds [0,1]d f(x) dx − 1 n n i=0 f(xi ) ≤ some function of {(xi , f(xi ))}n i=1 Theoretical bounds are impractical Every data-based error bound can be fooled There are better choices than random replications f ∈ not 16/25
34. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Importance Sampling and Control Variates The original problem may look like Ω g(t) dt but needs to become = [0,1]d f(x) dx 17/25
35. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Importance Sampling and Control Variates To facilitate and expedite its solution, one may perform a variable transformation, equivalent to importance sampling11, and/or subtract a trend (control variate)12 with integral zero Ω g(t) dt = t=Ψ(x) [0,1]d g(Ψ(x)) ∂Ψ(x) ∂x dx, T = Ψ(X) ∼ ∂Ψ(x) ∂x x=Ψ−1(t) −1 = [0,1]d f(x) dx 11A. B. Owen and Y. Zhou (2000). “Safe and Effective Importance Sampling”. In: J. Amer. Statist. Assoc. 95, pp. 135–143. 12F. J. H., C. Lemieux, and A. B. Owen (2005). “Control Variates for Quasi-Monte Carlo”. In: Statist. Sci. 20, pp. 1–31. doi: 10.1214/088342304000000468. 17/25
36. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Importance Sampling and Control Variates To facilitate and expedite its solution, one may perform a variable transformation, equivalent to importance sampling11, and/or subtract a trend (control variate)12 with integral zero Ω g(t) dt = t=Ψ(x) [0,1]d g(Ψ(x)) ∂Ψ(x) ∂x dx, T = Ψ(X) ∼ ∂Ψ(x) ∂x x=Ψ−1(t) −1 = [0,1]d g(Ψ(x)) ∂Ψ(x) ∂x − h(x) dx = [0,1]d f(x) dx to make VAR(f) smaller. Choosing Ψ and h is more art than science. 11A. B. Owen and Y. Zhou (2000). “Safe and Effective Importance Sampling”. In: J. Amer. Statist. Assoc. 95, pp. 135–143. 12F. J. H., C. Lemieux, and A. B. Owen (2005). “Control Variates for Quasi-Monte Carlo”. In: Statist. Sci. 20, pp. 1–31. doi: 10.1214/088342304000000468. 17/25
37. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Asian Option Pricing Option payoff is function of a stock price path modeled by a stochastic differential equation Option price is expected value of payoff True answer is the limit as # of time steps, d, goes to ∞ Ψ based on the eigenvector-eigenvalue decomposition of the covariance matrix is more efficient than the Cholesky decomposition 100 101 # time steps, d 5.2 5.3 5.4 5.5 5.6 5.7 Option Price Eigenvalue Cholesky 100 101 # time steps, d 10−1 100 101 Computation Time (sec) Eigenvalue Cholesky 18/25
38. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Multilevel methods13 Large or infinite d when discretizing a continuous stochastic process. Write as lim d→∞ [0,1]d fd (xd ) dxd = low dimensional approximation [0,1]d1 fd1 (xd1 ) dxd1 + improvement [0,1]d2 [fd2 (xd2 ) − fd1 (xd1 )] dxd2 + · · · + [0,1]dL [fdL (xdL ) − fdL−1 (xdL−1 )] dxdL + lim d→∞ [0,1]d fd (xd ) dxd − [0,1]dL fdL (xdL ) dxdL ≈ 1 n1 n1 i=1 fd1 (x(1) i,d1 ) cheap since d1 small + 1 n2 n2 i=1 [fd2 (x(2) i,d2 ) − fd1 (x(2) i,d1 )] + · · · + 1 nL nL i=1 [fdL (x(L) i,dL ) − fdL−1 (x(L) i,dL−1 )] cheap since nL small where d1 < · · · < dL and n1 > · · · > nL. Evaluation of fd (xd ) is typically O(d). 13M. Giles (2013). “Multilevel Monte Carlo methods”. In: Monte Carlo and Quasi-Monte Carlo Methods 2012. Ed. by J. Dick, F. Y. Kuo, G. W. Peters, and I. H. Sloan. Vol. 65. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin. doi: 10.1007/978-3-642-41095-6. 19/25
39. Beginning Trio Identity Stopping Rules Transforming the Integrand End References Message Problems in Bayesian inference, uncertainty quantification, quantitative finance, (high energy) physics, etc. require numerically evaluating E[f(X)] expectation = Ω f(x) ϱ(x) dx integral , X ∼ ϱ There is value in low discrepancy sampling, aka quasi-Monte Carlo methods data-driven error bounds flattening and reducing the effective dimension of the integrand quality quasi-Monte Carlo software like qmcpy physicists and quasi-Monte Carlo theorists collaborating more Slides at speakerdeck.com/fjhickernell/argonne2023maytalk Jupyter notebook with computations and figures here . Visit us at qmcpy.org 20/25
40. Beginning Trio Identity Stopping Rules Transforming the Integrand End References References I H., F. J. (1998). “A Generalized Discrepancy and Quadrature Error Bound”. In: Math. Comp. 67, pp. 299–322. doi: 10.1090/S0025-5718-98-00894-1. — (2018). “The Trio Identity for Quasi-Monte Carlo Error Analysis”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Stanford, USA, August 2016. Ed. by P. Glynn and A. Owen. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin, pp. 3–27. doi: 10.1007/978-3-319-91436-7. H., F. J. and Ll. A. Jiménez Rugama (2016). “Reliable Adaptive Cubature Using Digital Sequences”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014. Ed. by R. Cools and D. Nuyens. Vol. 163. Springer Proceedings in Mathematics and Statistics. arXiv:1410.8615 [math.NA]. Springer-Verlag, Berlin, pp. 367–383. H., F. J., Ll. A. Jiménez Rugama, and D. Li (2018). “Adaptive Quasi-Monte Carlo Methods for Cubature”. In: Contemporary Computational Mathematics — a celebration of the 80th birthday of Ian Sloan. Ed. by J. Dick, F. Y. Kuo, and H. Woźniakowski. Springer-Verlag, pp. 597–619. doi: 10.1007/978-3-319-72456-0. 21/25
41. Beginning Trio Identity Stopping Rules Transforming the Integrand End References References II H., F. J., C. Lemieux, and A. B. Owen (2005). “Control Variates for Quasi-Monte Carlo”. In: Statist. Sci. 20, pp. 1–31. doi: 10.1214/088342304000000468. Blaszkiewicz, M. R. (Feb. 2022). “Methods to optimize rare-event Monte Carlo reliability simulations for Large Hadron Collider Protection Systems”. MA thesis. University of Amsterdam. url: https://cds.cern.ch/record/2808520. Brass, H. and K. Petras (2011). Quadrature theory: the theory of numerical integration on a compact interval. Rhode Island: American Mathematical Society. Chen, S., J. Dick, and A. B. Owen (2011). “Consistency of Markov Chain Quasi-Monte Carlo on Continuous State Spaces”. In: Ann. Stat. 9, pp. 673–701. Choi, S.-C. T. et al. (2023). QMCPy: A quasi-Monte Carlo Python Library (versions 1–1.4). doi: 10.5281/zenodo.3964489. url: https://qmcsoftware.github.io/QMCSoftware/. Cools, R. and D. Nuyens, eds. (2016). Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014. Vol. 163. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin. Courtoy, A. et al. (2023). “Parton distributions need representative sampling”. In: Phys. Rev. D 107.034008. url: https://journals.aps.org/prd/pdf/10.1103/PhysRevD.107.034008. 22/25
42. Beginning Trio Identity Stopping Rules Transforming the Integrand End References References III Dick, J., P. Kritzer, and F. Pillichshammer (2022). Lattice Rules: Numerical Integration, Approximation, and Discrepancy. Springer Series in Computational Mathematics. Springer Cham. doi: https://doi.org/10.1007/978-3-031-09951-9. Dick, J., F. Kuo, and I. H. Sloan (2013). “High dimensional integration — the Quasi-Monte Carlo way”. In: Acta Numer. 22, pp. 133–288. doi: 10.1017/S0962492913000044. Dick, J. and F. Pillichshammer (2010). Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge: Cambridge University Press. Everett, D. et al. (May 2021). “Multisystem Bayesian constraints on the transport coefficients of QCD matter”. In: Phys. Rev. C 103.5. doi: 10.1103/physrevc.103.054904. Giles, M. (2013). “Multilevel Monte Carlo methods”. In: Monte Carlo and Quasi-Monte Carlo Methods 2012. Ed. by J. Dick et al. Vol. 65. Springer Proceedings in Mathematics and Statistics. Springer-Verlag, Berlin. doi: 10.1007/978-3-642-41095-6. Haberman, SJ (1976). Generalized residuals for log-linear models, proceedings of the 9th International Biometrics Conference. Jagadeeswaran, R. and F. J. H. (2019). “Fast Automatic Bayesian Cubature Using Lattice Sampling”. In: Stat. Comput. 29, pp. 1215–1229. doi: 10.1007/s11222-019-09895-9. 23/25
43. Beginning Trio Identity Stopping Rules Transforming the Integrand End References References IV Jagadeeswaran, R. and F. J. H. (2022). “Fast Automatic Bayesian Cubature Using Sobol’ Sampling”. In: Advances in Modeling and Simulation: Festschrift in Honour of Pierre L’Ecuyer. Ed. by Z. Botev et al. Springer, Cham, pp. 301–318. doi: 10.1007/978-3-031-10193-9\_15. Jiménez Rugama, Ll. A. and F. J. H. (2016). “Adaptive Multidimensional Integration Based on Rank-1 Lattices”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014. Ed. by R. Cools and D. Nuyens. Vol. 163. Springer Proceedings in Mathematics and Statistics. arXiv:1411.1966. Springer-Verlag, Berlin, pp. 407–422. Liyanage, D. et al. (Mar. 2022). “Efficient emulation of relativistic heavy ion collisions with transfer learning”. In: Phys. Rev. C 105.3. doi: 10.1103/physrevc.105.034910. Meng, X. (2018). “Statistical Paradises and Paradoxes in Big Data (I): Law of Lage Popluations, Big Data Paradox, and 2016 US Presidential Election”. In: Ann. Appl. Stat. 12, pp. 685–726. Owen, A. B. and Y. Zhou (2000). “Safe and Effective Importance Sampling”. In: J. Amer. Statist. Assoc. 95, pp. 135–143. Owen, Art B. and Seth D. Tribble (2005). “A quasi-Monte Carlo Metropolis algorithm”. In: Proc. Natl. Acad. Sci. 102, pp. 8844–8849. 24/25
44. Beginning Trio Identity Stopping Rules Transforming the Integrand End References References V Parno, M. and L. Seelinger (2022). Uncertainty propagation of material properties of a cantilevered beam. url: https://um-bridge-benchmarks.readthedocs.io/en/docs/forward- benchmarks/muq-beam-propagation.html. Sorokin, A. G. and R. Jagadeeswaran (2023+). “Monte Carlo for Vector Functions of Integrals”. In: Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Linz, Austria, July 2022. Ed. by A. Hinrichs, P. Kritzer, and F. Pillichshammer. Springer Proceedings in Mathematics and Statistics. submitted for publication. Springer, Cham. 25/25