mlsanityData to 7 Oct 2026

Advantage of Deep Neural Networks for Estimating Functions with Singularity on Hypersurfaces

arXiv 2011.02256 ↗First posted 4 Nov 2020stat.ML cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

We develop a minimax rate analysis to describe the reason that deep neural networks (DNNs) perform better than other standard methods. For nonparametric regression problems, it is well known that many standard methods attain the minimax optimal rate of estimation errors for smooth functions, and thus, it is not straightforward to identify the theoretical advantages of DNNs. This study tries to fill this gap by considering the estimation for a class of non-smooth functions that have singularities on hypersurfaces. Our findings are as follows: (i) We derive the generalization error of a DNN estimator and prove that its convergence rate is almost optimal. (ii) We elucidate a phase diagram of estimation problems, which describes the situations where the DNNs outperform a general class of estimators, including kernel methods, Gaussian process methods, and others. We additionally show that DNNs outperform harmonic analysis based estimators. This advantage of DNNs comes from the fact that a shape of singularity can be successfully handled by their multi-layered structure.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Nov 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 6; 2024: 4; 2025: 2; 2026: 3.

17 papers.

Sort:

  1. 2024A Survey on Statistical Theory of Deep Learning: Approximation, Training Dynamics, and Generative Modelscited by 20
  2. 2023Sparse-penalized deep neural networks estimator under weak dependencecited by 8
  3. 2022On the inability of Gaussian process regression to optimally learn compositional functionscited by 7
  4. 2023Sup-Norm Convergence of Deep Neural Network Estimator for Nonparametric Regression by Adversarial Trainingcited by 6
  5. 2022On generalization bounds for deep networks based on loss surface implicit regularizationcited by 5
  6. 2024Robust deep learning from weakly dependent datacited by 5
  7. 2024Deep learning from strongly mixing observations: Sparse-penalized regularization and minimax optimalitycited by 3
  8. 2025Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Sizecited by 3
  9. 2023Penalized deep neural networks estimator with general loss functions under weak dependencecited by 2
  10. 2023Statistical learning by sparse deep neural networkscited by 1
  11. 2023Pathway to a fully data-driven geotechnics: lessons from materials informaticscited by 1
  12. 2023Mathematical Challenges in Deep Learningcited by 0
5 more
  1. 2024Dimension-independent learning rates for high-dimensional classification problemscited by 0
  2. 2025Why and When Deep is Better than Shallow: Implementation-Agnostic State-Transition Model of Deep Learningcited by 0
  3. 2026Deep regression learning from dependent observations with minimum error entropy principlecited by 0
  4. 2026Rate-optimal neural boundary detection from unlabeled noisy imagescited by 0
  5. 2026Adaptive deep nonparametric regression from dependent data under covariate shiftcited by 0