On approximate learning by multi-layered feedforward circuits
From MaRDI portal
Publication:2581366
DOI10.1016/j.tcs.2005.09.008zbMath1081.68080OpenAlexW2121678276MaRDI QIDQ2581366
Barbara Hammer, Bhaskar Das Gupta
Publication date: 10 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.008
Related Items (1)
Cites Work
- On the complexity of polyhedral separability
- Optimization, approximation, and complexity classes
- Feedforward nets for interpolation and classification
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Hardness results for neural network approximation problems
- Robust trainability of single neurons
- On the hardness of approximating minimization problems
- The computational intractability of training sigmoidal neural networks
- Finiteness results for sigmoidal “neural” networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On approximate learning by multi-layered feedforward circuits