scientific article; zbMATH DE number 6982323
From MaRDI portal
Publication:4558174
zbMath1461.68200arXiv1609.01037MaRDI QIDQ4558174
Publication date: 21 November 2018
Full work available at URL: https://arxiv.org/abs/1609.01037
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Neural nets and related approaches to inference from stochastic processes (62M45)
Related Items (5)
Complexity of training ReLU neural network ⋮ Polynomial‐time universality and limitations of deep learning ⋮ A mathematical perspective of machine learning ⋮ Discussion of: ``Nonparametric regression using deep neural networks with ReLU activation function ⋮ Depth separations in neural networks: what is actually being separated?
Uses Software
Cites Work
- Projection-based approximation and a duality with kernel methods
- Cryptographic hardness for learning intersections of halfspaces
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Efficient noise-tolerant learning from statistical queries
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
- From average case complexity to improper learning complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
