Hardness results for neural network approximation problems
type: Item
instance of: scholarly article
title: Hardness results for neural network approximation problems
zbMATH Open document ID: 0997.68098
DOI: 10.1016/S0304-3975(01)00057-3
author: Shai Ben-David
author: Peter L. Bartlett
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1767822
zbMATH Keywords: learning
zbMATH Keywords: two-layer neural networks
MaRDI profile type: Publication
cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations
cites work: On the difficulty of approximately maximizing agreements.
cites work: Strong universal consistency of neural network classifiers
cites work: Q3729902
cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications
cites work: Robust trainability of single neurons
cites work: The computational intractability of training sigmoidal neural networks
cites work: Q4259987
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Efficient agnostic learning of neural networks with bounded fan-in
cites work: On the complexity of polyhedral separability
cites work: Optimization, approximation, and complexity classes
cites work: The hardness of approximation: Gap location
description: scientific article; zbMATH DE number 1767822