scientific article; zbMATH DE number 7626778
From MaRDI portal
Publication:5053289
Cites work
- Comparison of worst case errors in linear and neural network approximation
- Continuity of approximation by neural networks in \(L_p\) spaces
- Convex functions. Constructions, characterizations and counterexamples
- Deep learning architectures. A mathematical approach
- Hardness results for neural network approximation problems
- scientific article; zbMATH DE number 4071579 (Why is no real title available?)
- scientific article; zbMATH DE number 192855 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- Least squares approximation by splines with free knots
- Nonlinear approximation and (deep) ReLU networks
- On the nonuniqueness and instability of solutions of tracking-type optimal control problems
- Spurious valleys in one-hidden-layer neural network optimization landscapes
- Symmetry \& critical points for a model shallow neural network
- Training a Single Sigmoidal Neuron Is Hard
- Variational Analysis
Cited in
(5)- On the antiderivatives of \(x^p/(1 - x)\) with an application to optimize loss functions for classification with neural networks
- Correction to "The Importance of Convexity in Learning With Squared Loss" [Sep 98 1974-1980]
- The importance of convexity in learning with squared loss
- On the Stability Properties and the Optimization Landscape of Training Problems with Squared Loss for Neural Networks and General Nonlinear Conic Approximation Schemes
- On the omnipresence of spurious local minima in certain neural network training problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053289)
