Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access
  • Access by Xinjiang University

Exhaustive neural importance sampling applied to Monte Carlo event generation

Sebastian Pina-Otey1,2,*, Federico Sánchez3, Thorsten Lux2, and Vicens Gaitan1

  • 1Aplicaciones en Informática Avanzada (AIA), Sant Cugat del Vallès (Barcelona) 08172, Spain
  • 2Institut de Física d’Altes Energies (IFAE)—Barcelona Institute of Science and Technology (BIST), Bellaterra (Barcelona) 08193, Spain
  • 3University of Geneva, Section de Physique, DPNC, Geneva 1205, Switzerland

  • *pinas@aia.es

Phys. Rev. D 102, 013003 – Published 16 July, 2020

DOI: https://doi.org/10.1103/PhysRevD.102.013003

Abstract

The generation of accurate neutrino-nucleus cross section models needed for neutrino oscillation experiments requires simultaneously the description of many degrees of freedom and precise calculations to model nuclear responses. The detailed calculation of complete models makes the Monte Carlo generators slow and impractical. We present exhaustive neural importance sampling, a method based on normalizing flows to find a suitable proposal density for rejection sampling automatically and efficiently, and discuss how this technique solves common issues of the rejection algorithm.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (30)

  1. W. K. Hastings, Biometrika 57, 97 (1970).
  2. S. Geman and D. Geman, IEEE Trans. Pattern Anal. Mach. Intell. 6, 721 (1984).
  3. G. Casella, C. P. Robert, and M. T. Wells, Generalized accept-reject sampling schemes, in A Festschrift for Herman Rubin, Lecture Notes–Monograph Series Vol. 45, edited by A. DasGupta (Institute of Mathematical Statistics, Beachwood, OH, 2004), pp. 342–347.
  4. L. Martino and J. Mguez, Signal Processing 90, 2981 (2010).
  5. C. M. Bishop and N. M. Nasrabadi, J. Electron. Imaging 16, 049901 (2007).
  6. J. von Neumann, in Monte Carlo Method, edited by A. S. Householder, G. E. Forsythe, and H. H. Germond, National Bureau of Standards Applied Mathematics Series Vol. 12 (US Government Printing Office, Washington, DC, 1951), Chap. 13, pp. 36–38.
  7. C. P. Robert and G. Casella, Monte Carlo Statistical Methods (Springer, New York, 2004).
  8. T. Müller, B. McWilliams, F. Rousselle, M. Gross, and J. Novák, ACM Trans. Graph. 38, 145 (2018).
  9. H. Kahn and A. W. Marshall, J. Oper. Res. Soc. Am. 1, 263 (1953).
  10. E. Bothmann, T. Janen, M. Knobbe, T. Schmale, and S. Schumann, SciPost Phys. 8, 069 (2020).
  11. C. Gao, S. Höche, J. Isaacson, C. Krause, and H. Schulz, Phys. Rev. D 101, 076002 (2020).
  12. L. Alvarez-Ruso et al. (NuSTEC Collaboration), Prog. Part. Nucl. Phys. 100, 1 (2018).
  13. K. Abe et al. (T2K Collaboration), Nature (London) 580, 339 (2020).
  14. M. Acero et al. (NOvA Collaboration), Phys. Rev. Lett. 123, 151803 (2019).
  15. R. Smith and E. Moniz, Nucl. Phys. B43, 605 (1972); B101, 547(E) (1975).
  16. G. Papamakarios, E. T. Nalisnick, D. J. Rezende, S. Mohamed, and B. Lakshminarayanan, arXiv:1912.02762.
  17. C. Durkan, A. Bekasov, I. Murray, and G. Papamakarios, in Advances in Neural Information Processing Systems 32, edited by H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlché-Buc, E. Fox, and R. Garnett (Curran Associates, Inc., 2019), pp. 7511–7522, http://papers.nips.cc/paper/8969-neural-spline-flows.pdf.
  18. D. J. Rezende and S. Mohamed, arXiv:1505.05770.
  19. M. Germain, K. Gregor, I. Murray, and H. Larochelle, in Proceedings of the 32nd International Conference on Machine Learning, edited by F. Bach and D. Blei, Proceedings of Machine Learning Research Vol. 37 (PMLR, Lille, France, 2015), pp. 881–889, http://proceedings.mlr.press/v37/germain15.html.
  20. G. Papamakarios, I. Murray, and T. Pavlakou, Masked Autoregressive Flow for Density Estimation, in Advances in Neural Information Processing Systems 30, edited by I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Curran Associates, Inc., 2017), pp. 2338–2347, http://papers.nips.cc/paper/6828-masked-autoregressive-flow-for-density-estimation.pdf.
  21. C.-W. Huang, D. Krueger, A. Lacoste, and A. C. Courville, arXiv:1804.00779.
  22. N. D. Cao, I. Titov, and W. Aziz, arXiv:1904.04676.
  23. A. Wehenkel and G. Louppe, in Advances in Neural Information Processing Systems 32, edited by H. Wallach, H. Larochelle, A. Beygelzimer, F. dAlché-Buc, E. Fox, and R. Garnett (Curran Associates, Inc., 2019), pp. 1545–1555, http://papers.nips.cc/paper/8433-unconstrained-monotonic-neural-networks.pdf.
  24. P. Jaini, K. A. Selby, and Y. Yu, in Proceedings of the 36th International Conference on Machine Learning, edited by K. Chaudhuri and R. Salakhutdinov, Proceedings of Machine Learning Research Vol. 97 (PMLR, California, USA, 2019), pp. 3009–3018, http://proceedings.mlr.press/v97/jaini19a.html.
  25. C. Durkan, A. Bekasov, I. Murray, and G. Papamakarios, arXiv:1906.02145.
  26. J. A. Gregory and R. Delbourgo, IMA J. Numer. Anal. 2, 123 (1982).
  27. S. Kullback and R. A. Leibler, Ann. Math. Stat. 22, 79 (1951).
  28. D. P. Kingma and J. Ba, arXiv:1412.6980.
  29. J. S. Liu, Stat. Comput. 6, 113 (1996).
  30. The concept of the Asimov data is a representative date set, inspired by the short story Franchise by Isaac Asimov, in which the entire electorate is replaced by selecting the most representative voter.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation