On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces-Reference-Cited by-同舟云学术

On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces

Published:2020-03 Issue: Volume:123 Page:343-361
ISSN:0893-6080
Container-title:Neural Networks
language:en
Short-container-title:Neural Networks

Author:

Hayakawa Satoshi^ORCID,Suzuki Taiji

Funder

Ministry of Education, Culture, Sports, Science and Technology

Core Research for Evolutional Science and Technology

Publisher

Elsevier BV

Subject

Artificial Intelligence,Cognitive Neuroscience

Reference35 articles.

1. Pattern recognition and machine learning (information science and statistics);Bishop,2006

2. Optimal approximation with sparsely connected deep neural networks;Bölcskei,2017

3. Minimax estimation of linear functionals over nonconvex parameter spaces;Cai;The Annals of Statistics,2004

4. An introduction to compressive sampling [a sensing/sampling paradigm that goes against the common knowledge in data acquisition];Candès;IEEE Signal Processing Magazine,2008

5. Approximation by superpositions of a sigmoidal function;Cybenko;Mathematics of Control, Signals, and Systems,1989

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep learning for ψ-weakly dependent processes;Journal of Statistical Planning and Inference;2024-09

2. Drift estimation for a multi-dimensional diffusion process using deep neural networks;Stochastic Processes and their Applications;2024-04

3. Simple and complex cells revisited: toward a selectivity-invariance model of object recognition;Frontiers in Computational Neuroscience;2023-10-13

4. Ideal Bayesian Spatial Adaptation;Journal of the American Statistical Association;2023-09-11

5. Image response regression via deep neural networks;Journal of the Royal Statistical Society Series B: Statistical Methodology;2023-07-24