{"title":"Bochner空间中的深度ReLU神经网络逼近及其在参数偏微分方程中的应用","authors":"Dinh Dũng , Van Kien Nguyen , Duong Thanh Pham","doi":"10.1016/j.jco.2023.101779","DOIUrl":null,"url":null,"abstract":"<div><p><span><span>We investigate non-adaptive methods of deep ReLU neural network approximation in </span>Bochner spaces </span><span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><msup><mrow><mi>U</mi></mrow><mrow><mo>∞</mo></mrow></msup><mo>,</mo><mi>X</mi><mo>,</mo><mi>μ</mi><mo>)</mo></math></span> of functions on <span><math><msup><mrow><mi>U</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span><span> taking values in a separable Hilbert space </span><em>X</em>, where <span><math><msup><mrow><mi>U</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span> is either <span><math><msup><mrow><mi>R</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span><span> equipped with the standard Gaussian probability measure, or </span><span><math><msup><mrow><mo>[</mo><mo>−</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow><mrow><mo>∞</mo></mrow></msup></math></span> equipped with the Jacobi probability measure. Functions to be approximated are assumed to satisfy a certain weighted <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-summability of the generalized chaos polynomial expansion coefficients with respect to the measure <em>μ</em><span>. We prove the convergence rate of this approximation in terms of the size of approximating deep ReLU neural networks. These results then are applied to approximation of the solution to parametric<span> elliptic PDEs with random inputs for the lognormal and affine cases.</span></span></p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"79 ","pages":"Article 101779"},"PeriodicalIF":1.8000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs\",\"authors\":\"Dinh Dũng , Van Kien Nguyen , Duong Thanh Pham\",\"doi\":\"10.1016/j.jco.2023.101779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span><span>We investigate non-adaptive methods of deep ReLU neural network approximation in </span>Bochner spaces </span><span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><msup><mrow><mi>U</mi></mrow><mrow><mo>∞</mo></mrow></msup><mo>,</mo><mi>X</mi><mo>,</mo><mi>μ</mi><mo>)</mo></math></span> of functions on <span><math><msup><mrow><mi>U</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span><span> taking values in a separable Hilbert space </span><em>X</em>, where <span><math><msup><mrow><mi>U</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span> is either <span><math><msup><mrow><mi>R</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span><span> equipped with the standard Gaussian probability measure, or </span><span><math><msup><mrow><mo>[</mo><mo>−</mo><mn>1</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow><mrow><mo>∞</mo></mrow></msup></math></span> equipped with the Jacobi probability measure. Functions to be approximated are assumed to satisfy a certain weighted <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-summability of the generalized chaos polynomial expansion coefficients with respect to the measure <em>μ</em><span>. We prove the convergence rate of this approximation in terms of the size of approximating deep ReLU neural networks. These results then are applied to approximation of the solution to parametric<span> elliptic PDEs with random inputs for the lognormal and affine cases.</span></span></p></div>\",\"PeriodicalId\":50227,\"journal\":{\"name\":\"Journal of Complexity\",\"volume\":\"79 \",\"pages\":\"Article 101779\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-06-15\",\"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/S0885064X23000481\",\"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/S0885064X23000481","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs
We investigate non-adaptive methods of deep ReLU neural network approximation in Bochner spaces of functions on taking values in a separable Hilbert space X, where is either equipped with the standard Gaussian probability measure, or equipped with the Jacobi probability measure. Functions to be approximated are assumed to satisfy a certain weighted -summability of the generalized chaos polynomial expansion coefficients with respect to the measure μ. We prove the convergence rate of this approximation in terms of the size of approximating deep ReLU neural networks. These results then are applied to approximation of the solution to parametric elliptic PDEs with random inputs for the lognormal and affine cases.
期刊介绍:
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.