{"title":"随机拟蒙特卡罗估计的偏度","authors":"Zexin Pan, Art B. Owen","doi":"10.1016/j.jco.2025.101956","DOIUrl":null,"url":null,"abstract":"<div><div>Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student's <em>t</em> 95% confidence intervals based on a modest number of replicates were seen to be very effective and even more reliable than some bootstrap <em>t</em> intervals that were expected to be best. One potential explanation is that those RQMC estimates have small skewness. In this paper we give conditions under which the skewness is <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>ϵ</mi></mrow></msup><mo>)</mo></math></span> for any <span><math><mi>ϵ</mi><mo>></mo><mn>0</mn></math></span>, so ‘almost <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>’. Under a random generator matrix model, we can improve this rate to <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>+</mo><mi>ϵ</mi></mrow></msup><mo>)</mo></math></span> with very high probability. We also improve some probabilistic bounds on the distribution of the quality parameter <em>t</em> for a digital net in a prime base under random sampling of generator matrices.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"90 ","pages":"Article 101956"},"PeriodicalIF":1.8000,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Skewness of a randomized quasi-Monte Carlo estimate\",\"authors\":\"Zexin Pan, Art B. Owen\",\"doi\":\"10.1016/j.jco.2025.101956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student's <em>t</em> 95% confidence intervals based on a modest number of replicates were seen to be very effective and even more reliable than some bootstrap <em>t</em> intervals that were expected to be best. One potential explanation is that those RQMC estimates have small skewness. In this paper we give conditions under which the skewness is <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>ϵ</mi></mrow></msup><mo>)</mo></math></span> for any <span><math><mi>ϵ</mi><mo>></mo><mn>0</mn></math></span>, so ‘almost <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>’. Under a random generator matrix model, we can improve this rate to <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>+</mo><mi>ϵ</mi></mrow></msup><mo>)</mo></math></span> with very high probability. We also improve some probabilistic bounds on the distribution of the quality parameter <em>t</em> for a digital net in a prime base under random sampling of generator matrices.</div></div>\",\"PeriodicalId\":50227,\"journal\":{\"name\":\"Journal of Complexity\",\"volume\":\"90 \",\"pages\":\"Article 101956\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2025-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Complexity\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0885064X25000342\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X25000342","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Skewness of a randomized quasi-Monte Carlo estimate
Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student's t 95% confidence intervals based on a modest number of replicates were seen to be very effective and even more reliable than some bootstrap t intervals that were expected to be best. One potential explanation is that those RQMC estimates have small skewness. In this paper we give conditions under which the skewness is for any , so ‘almost ’. Under a random generator matrix model, we can improve this rate to with very high probability. We also improve some probabilistic bounds on the distribution of the quality parameter t for a digital net in a prime base under random sampling of generator matrices.
期刊介绍:
The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited.
Areas Include:
• Approximation theory
• Biomedical computing
• Compressed computing and sensing
• Computational finance
• Computational number theory
• Computational stochastics
• Control theory
• Cryptography
• Design of experiments
• Differential equations
• Discrete problems
• Distributed and parallel computation
• High and infinite-dimensional problems
• Information-based complexity
• Inverse and ill-posed problems
• Machine learning
• Markov chain Monte Carlo
• Monte Carlo and quasi-Monte Carlo
• Multivariate integration and approximation
• Noisy data
• Nonlinear and algebraic equations
• Numerical analysis
• Operator equations
• Optimization
• Quantum computing
• Scientific computation
• Tractability of multivariate problems
• Vision and image understanding.