Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Efficient Quasi-Random Sampling for Copulas (2403.05281v1)

Published 8 Mar 2024 in stat.ML, math.ST, and stat.TH

Abstract: This paper examines an efficient method for quasi-random sampling of copulas in Monte Carlo computations. Traditional methods, like conditional distribution methods (CDM), have limitations when dealing with high-dimensional or implicit copulas, which refer to those that cannot be accurately represented by existing parametric copulas. Instead, this paper proposes the use of generative models, such as Generative Adversarial Networks (GANs), to generate quasi-random samples for any copula. GANs are a type of implicit generative models used to learn the distribution of complex data, thus facilitating easy sampling. In our study, GANs are employed to learn the mapping from a uniform distribution to copulas. Once this mapping is learned, obtaining quasi-random samples from the copula only requires inputting quasi-random samples from the uniform distribution. This approach offers a more flexible method for any copula. Additionally, we provide theoretical analysis of quasi-Monte Carlo estimators based on quasi-random samples of copulas. Through simulated and practical applications, particularly in the field of risk management, we validate the proposed method and demonstrate its superiority over various existing methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (62)
  1. A comparison of some monte carlo and quasi monte carlo techniques for option pricing. In Monte Carlo and Quasi-Monte Carlo Methods 1996: Proceedings of a conference at the University of Salzburg, Austria, July 9–12, 1996, pp.  1–18. Springer.
  2. A general theory for orthogonal array based latin hypercube sampling. Statistica Sinica 26(2), 761–777.
  3. Generative adversarial networks for network traffic feature generation. International Journal of Computers and Applications, 1–9.
  4. Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks. Journal of Machine Learning Research 20(1), 2285–2301.
  5. Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research 3(Nov), 463–482.
  6. Modeling and simulating spatial extremes by combining extreme value theory with generative adversarial networks. Environmental Data Science 1, e5.
  7. Caflisch, R. E. (1998). Monte carlo and quasi-monte carlo methods. Acta numerica 7, 1–49.
  8. Quasi-random numbers for copula models. Statistics and Computing 27, 1307–1329.
  9. A study of orthogonal array-based designs under a broad class of space-filling criteria. Annals of Statistics 50(5), 2925–2949.
  10. Learning nonparametric high-dimensional generative models: The empirical-beta-copula autoencoder. arXiv preprint arXiv:2309.09916.
  11. A multivariate faa di bruno formula with applications. Transactions of the American Mathematical Society 348(2), 503–520.
  12. Conditional generative adversarial network model for simulating intensity measures of aftershocks. Soil Dynamics and Earthquake Engineering 139, 106281.
  13. Theory and application of uniform experimental designs, Volume 221. Singapore: Springer and Science Press.
  14. Convergence analysis of a quasi-monte carlo-based deep learning algorithm for solving partial differential equations. arXiv preprint arXiv:2210.16196.
  15. Goodness-of-fit tests for copulas: A review and a power study. Insurance: Mathematics and economics 44(2), 199–213.
  16. Quasi-monte carlo for finance applications. ANZIAM Journal 50, C308–C323.
  17. Quasi-monte carlo methods for elliptic pdes with random coefficients and applications. Journal of Computational Physics 230(10), 3668–3694.
  18. A supervised generative optimization approach for tabular data. In Proceedings of the Fourth ACM International Conference on AI in Finance, pp.  10–18.
  19. Tabular data synthesis with gans for adaptive ai models. In Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD), pp. 242–246.
  20. He, X. and P. Z. Qian (2014). A central limit theorem for general orthogonal array based space-filling designs. The Annals of Statistics 42(5), 1725–1750.
  21. On the error rate of importance sampling with randomized quasi-monte carlo. SIAM Journal on Numerical Analysis 61(2), 515–538.
  22. Über eine transformation von gleichverteilten folgen ii. Computing 9(2), 127–138.
  23. Elements of copula modeling with R. Springer.
  24. Visualizing dependence in high-dimensional data: An application to s&p 500 constituent data. Econometrics and statistics 8, 161–183.
  25. Quasi-random sampling for multivariate distributions via generative neural networks. Journal of Computational and Graphical Statistics 30(3), 647–670.
  26. Implicit generative copulas. Advances in Neural Information Processing Systems 34, 26028–26039.
  27. The copula-garch model of conditional dependencies: An international stock market application. Journal of international money and finance 25(5), 827–853.
  28. Keziou, A. (2003). Dual representation of φ𝜑\varphiitalic_φ-divergences and applications. Comptes rendus mathématique 336(10), 857–862.
  29. Synthetic data generation using combinatorial testing and variational autoencoder. In 2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp.  228–236. IEEE.
  30. Quasi-monte carlo finite element methods for a class of elliptic partial differential equations with random coefficients. SIAM Journal on Numerical Analysis 50(6), 3351–3374.
  31. L’Ecuyer, P. (2004). Quasi-monte carlo methods in finance. In Proceedings of the 2004 Winter Simulation Conference, 2004., Volume 2, pp.  1645–1655. IEEE.
  32. Lemieux, C. (2009). Monte Carlo and Quasi–Monte Carlo Sampling. Springer.
  33. MMD GAN: Towards deeper understanding of moment matching network. In Advances in Neural Information Processing Systems, pp. 2203–2213.
  34. Deep archimedean copulas. Advances in Neural Information Processing Systems 33, 1535–1545.
  35. Improving conditional variational autoencoder with resampling strategies for regression synthetic project generation. International Journal of Intelligent Engineering & Systems 16(4).
  36. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2), 239–245.
  37. Quantitative risk management: concepts, techniques and tools-revised edition. Princeton.
  38. Inference and sampling for archimax copulas. Advances in Neural Information Processing Systems 35, 17099–17116.
  39. Estimating divergence functionals and the likelihood ratio by convex risk minimization. IEEE Transactions on Information Theory 56(11), 5847–5861.
  40. Niederreiter, H. (1992). Random number generation and quasi-Monte Carlo methods, Volume 63. SIAM.
  41. Latin hypercube designs based on strong orthogonal arrays and kriging modelling to improve the payload distribution of trains. Journal of Applied Statistics 48(3), 498–516.
  42. Owen, A. (1994). Lattice sampling revisited: Monte carlo variance of means over randomized orthogonal arrays. The Annals of Statistics 22(2), 930–945.
  43. Owen, A. B. (2008). Local antithetic sampling with scrambled nets. The Annals of Statistics 36(5), 2319–2343.
  44. Paskov, S. and J. F. Traub (1996). Faster valuation of financial derivatives. Journal of Portfolio Management 22, 113–120.
  45. Patton, A. J. (2006). Modelling asymmetric exchange rate dependence. International economic review 47(2), 527–556.
  46. Testing for equality between two copulas. Journal of Multivariate Analysis 100(3), 377–386.
  47. Rockafellar, R. T. (1997). Convex analysis, Volume 11. Princeton university press.
  48. Rosenblatt, M. (1952). Remarks on a multivariate transformation. The annals of mathematical statistics 23(3), 470–472.
  49. Wind power scenario generation considering spatiotemporal correlations: A distribution free hybrid varma-copula approach. Smart Grids and Sustainable Energy 8(4), 17.
  50. Shen, Z. (2020). Deep network approximation characterized by number of neurons. Communications in Computational Physics 28(5), 1768–1811.
  51. Sobol’, I. M. (1967). On the distribution of points in a cube and the approximate evaluation of integrals. Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki 7(4), 784–802.
  52. Probabilistic modeling of long-term joint wind and wave load conditions via generative adversarial network. Stochastic Environmental Research and Risk Assessment, 1–19.
  53. Uniform projection designs. The Annals of Statistics 47(1), 641–661.
  54. Tang, B. (1993). Orthogonal array-based latin hypercubes. Journal of the American statistical association 88(424), 1392–1397.
  55. Tsybakov, A. (2008). Introduction to Nonparametric Estimation. New York: Springer Science & Business Media.
  56. Generating multivariate load states using a conditional variational autoencoder. Electric Power Systems Research 213, 108603.
  57. Generative adversarial networks in computer vision: A survey and taxonomy. ACM Computing Surveys (CSUR) 54(2), 1–38.
  58. Applying a method for augmenting data mixed from two different sources using deep generative neural networks to management science. Applied Sciences 14(1), 378.
  59. Copula variational lstm for high-dimensional cross-market multivariate dependence modeling. arXiv preprint arXiv:2305.08778.
  60. Variational autoencoder with copula for collaborative filtering. In Workshop on Deep Learning Practice for High-Dimensional Sparse Data with KDD.
  61. Space-filling properties of good lattice point sets. Biometrika 102(4), 959–966.
  62. Zhou, Y.-D. and K.-T. Fang (2013). An efficient method for constructing uniform designs with large size. Computational Statistics 28(3), 1319–1331.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com