IDEAS home Printed from https://ideas.repec.org/a/eee/jmvana/v182y2021ics0047259x20302773.html
   My bibliography  Save this article

Approximating smooth functions by deep neural networks with sigmoid activation function

Author

Listed:
  • Langer, Sophie

Abstract

We study the power of deep neural networks (DNNs) with sigmoid activation function. Recently, it was shown that DNNs approximate any d-dimensional, smooth function on a compact set with a rate of order W−p∕d, where W is the number of nonzero weights in the network and p is the smoothness of the function. Unfortunately, these rates only hold for a special class of sparsely connected DNNs. We ask ourselves if we can show the same approximation rate for a simpler and more general class, i.e., DNNs which are only defined by its width and depth. In this article we show that DNNs with fixed depth and a width of order Md achieve an approximation rate of M−2p. As a conclusion we quantitatively characterize the approximation power of DNNs in terms of the overall weights W0 in the network and show an approximation rate of W0−p∕d. This more general result finally helps us to understand which network topology guarantees a special target accuracy.

Suggested Citation

  • Langer, Sophie, 2021. "Approximating smooth functions by deep neural networks with sigmoid activation function," Journal of Multivariate Analysis, Elsevier, vol. 182(C).
  • Handle: RePEc:eee:jmvana:v:182:y:2021:i:c:s0047259x20302773
    DOI: 10.1016/j.jmva.2020.104696
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0047259X20302773
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jmva.2020.104696?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. David Silver & Aja Huang & Chris J. Maddison & Arthur Guez & Laurent Sifre & George van den Driessche & Julian Schrittwieser & Ioannis Antonoglou & Veda Panneershelvam & Marc Lanctot & Sander Dieleman, 2016. "Mastering the game of Go with deep neural networks and tree search," Nature, Nature, vol. 529(7587), pages 484-489, January.
    2. Kohler, Michael, 2014. "Optimal global rates of convergence for noiseless regression estimation problems with adaptively chosen design," Journal of Multivariate Analysis, Elsevier, vol. 132(C), pages 197-208.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Erhan Bayraktar & Bingyan Han, 2023. "Fitted Value Iteration Methods for Bicausal Optimal Transport," Papers 2306.12658, arXiv.org, revised Nov 2023.
    2. Li Li & Jiahui Yu & Hang Cheng & Miaojuan Peng, 2021. "A Smart Helmet-Based PLS-BPNN Error Compensation Model for Infrared Body Temperature Measurement of Construction Workers during COVID-19," Mathematics, MDPI, vol. 9(21), pages 1-20, November.
    3. Tomasz Tietze & Piotr Szulc & Daniel Smykowski & Andrzej Sitka & Romuald Redzicki, 2021. "Application of Phase Change Material and Artificial Neural Networks for Smoothing of Heat Flux Fluctuations," Energies, MDPI, vol. 14(12), pages 1-17, June.
    4. Francesca Mandel & Riddhi Pratim Ghosh & Ian Barnett, 2023. "Neural networks for clustered and longitudinal data using mixed effects models," Biometrics, The International Biometric Society, vol. 79(2), pages 711-721, June.
    5. Soham Sarkar & Victor M. Panaretos, 2022. "CovNet: Covariance networks for functional data on multidimensional domains," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(5), pages 1785-1820, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tian Zhu & Merry H. Ma, 2022. "Deriving the Optimal Strategy for the Two Dice Pig Game via Reinforcement Learning," Stats, MDPI, vol. 5(3), pages 1-14, August.
    2. Xiaoyue Li & John M. Mulvey, 2023. "Optimal Portfolio Execution in a Regime-switching Market with Non-linear Impact Costs: Combining Dynamic Program and Neural Network," Papers 2306.08809, arXiv.org.
    3. Nathan Companez & Aldeida Aleti, 2016. "Can Monte-Carlo Tree Search learn to sacrifice?," Journal of Heuristics, Springer, vol. 22(6), pages 783-813, December.
    4. Yuchen Zhang & Wei Yang, 2022. "Breakthrough invention and problem complexity: Evidence from a quasi‐experiment," Strategic Management Journal, Wiley Blackwell, vol. 43(12), pages 2510-2544, December.
    5. Yassine Chemingui & Adel Gastli & Omar Ellabban, 2020. "Reinforcement Learning-Based School Energy Management System," Energies, MDPI, vol. 13(23), pages 1-21, December.
    6. Zhewei Zhang & Youngjin Yoo & Kalle Lyytinen & Aron Lindberg, 2021. "The Unknowability of Autonomous Tools and the Liminal Experience of Their Use," Information Systems Research, INFORMS, vol. 32(4), pages 1192-1213, December.
    7. Yuhong Wang & Lei Chen & Hong Zhou & Xu Zhou & Zongsheng Zheng & Qi Zeng & Li Jiang & Liang Lu, 2021. "Flexible Transmission Network Expansion Planning Based on DQN Algorithm," Energies, MDPI, vol. 14(7), pages 1-21, April.
    8. JinHyo Joseph Yun & EuiSeob Jeong & Xiaofei Zhao & Sung Deuk Hahm & KyungHun Kim, 2019. "Collective Intelligence: An Emerging World in Open Innovation," Sustainability, MDPI, vol. 11(16), pages 1-15, August.
    9. Thomas P. Novak & Donna L. Hoffman, 2019. "Relationship journeys in the internet of things: a new framework for understanding interactions between consumers and smart objects," Journal of the Academy of Marketing Science, Springer, vol. 47(2), pages 216-237, March.
    10. Huang, Ruchen & He, Hongwen & Gao, Miaojue, 2023. "Training-efficient and cost-optimal energy management for fuel cell hybrid electric bus based on a novel distributed deep reinforcement learning framework," Applied Energy, Elsevier, vol. 346(C).
    11. Gokhale, Gargya & Claessens, Bert & Develder, Chris, 2022. "Physics informed neural networks for control oriented thermal modeling of buildings," Applied Energy, Elsevier, vol. 314(C).
    12. Li Xia, 2020. "Risk‐Sensitive Markov Decision Processes with Combined Metrics of Mean and Variance," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2808-2827, December.
    13. Sabrina Evans & Paolo Turrini, 2023. "Improving Strategic Decisions in Sequential Games by Exploiting Positional Similarity," Games, MDPI, vol. 14(3), pages 1-13, April.
    14. Neha Soni & Enakshi Khular Sharma & Narotam Singh & Amita Kapoor, 2019. "Impact of Artificial Intelligence on Businesses: from Research, Innovation, Market Deployment to Future Shifts in Business Models," Papers 1905.02092, arXiv.org.
    15. Wei-Chang Yeh & Yu-Hsin Hsieh & Chia-Ling Huang, 2022. "Newly Developed Flexible Grid Trading Model Combined ANN and SSO algorithm," Papers 2211.12839, arXiv.org.
    16. Yin, Linfei & He, Xiaoyu, 2023. "Artificial emotional deep Q learning for real-time smart voltage control of cyber-physical social power systems," Energy, Elsevier, vol. 273(C).
    17. Omar Al-Ani & Sanjoy Das, 2022. "Reinforcement Learning: Theory and Applications in HEMS," Energies, MDPI, vol. 15(17), pages 1-37, September.
    18. Taejong Joo & Hyunyoung Jun & Dongmin Shin, 2022. "Task Allocation in Human–Machine Manufacturing Systems Using Deep Reinforcement Learning," Sustainability, MDPI, vol. 14(4), pages 1-18, February.
    19. Jikai Jin & Vasilis Syrgkanis, 2023. "Learning Causal Representations from General Environments: Identifiability and Intrinsic Ambiguity," Papers 2311.12267, arXiv.org, revised Feb 2024.
    20. Mahmoud Mahfouz & Tucker Balch & Manuela Veloso & Danilo Mandic, 2021. "Learning to Classify and Imitate Trading Agents in Continuous Double Auction Markets," Papers 2110.01325, arXiv.org, revised Oct 2021.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:182:y:2021:i:c:s0047259x20302773. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.