Algorithmic Learning Theory
From MaRDI portal
Publication:5897389
DOI10.1007/B14273zbMATH Open1263.68123OpenAlexW4301133113MaRDI QIDQ5897389
Publication date: 23 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b14273
Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Practical complexity control in multilayer perceptrons π π
- On the complexity of learning for spiking neurons with temporal coding. π π
- On the complexity of computing and learning with multiplicative neural networks π π
- Learning of higher-order perceptrons with tunable complexities π π
- Capacity of the single-layer perceptron and minimal trajectory training algorithms π π
- The computational intractability of training sigmoidal neural networks π π
- Modeling the Learning of a Spiking Neural Network with Synaptic Delays π π
This page was built for publication: Algorithmic Learning Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897389)
