Applying statistical learning theory to deep learning
From MaRDI portal
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A logical calculus of the ideas immanent in nervous activity
- Advanced Lectures on Machine Learning
- Approximation by superpositions of a sigmoidal function
- Benign overfitting in linear regression
- Computational Complexity
- Convex optimization: algorithms and complexity
- Cryptographic limitations on learning Boolean formulae and finite automata
- Foundations of machine learning
- From average case complexity to improper learning complexity
- scientific article; zbMATH DE number 4004880 (Why is no real title available?)
- scientific article; zbMATH DE number 3790207 (Why is no real title available?)
- scientific article; zbMATH DE number 1405266 (Why is no real title available?)
- scientific article; zbMATH DE number 7064043 (Why is no real title available?)
- Learnability, stability and uniform convergence
- Lectures on convex optimization
- Multilayer feedforward networks are universal approximators
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Parity, circuits, and the polynomial-time hierarchy
- Reconciling modern machine-learning practice and the classical bias-variance trade-off
- Relatively smooth convex optimization by first-order methods, and applications
- Surprises in high-dimensional ridgeless least squares interpolation
- Systems of logic based on ordinals.
- The implicit bias of gradient descent on separable data
- Understanding machine learning. From theory to algorithms
- Universal approximation bounds for superpositions of a sigmoidal function
This page was built for publication: Applying statistical learning theory to deep learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232405)
