The following pages link to (Q3093207):
Displaying 12 items.
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Learning from hints in neural networks (Q909487) (← links)
- Learning binary perceptrons perfectly efficiently. (Q960477) (← links)
- Lower bound for connectivity in local-learning neural networks (Q1106023) (← links)
- On the complexity of recognizing regions computable by two-layered perceptrons (Q1286403) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Can neural networks extrapolate? Discussion of a theorem by Pedro Domingos (Q2687674) (← links)
- (Q3077929) (← links)
- An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}<sup>n</sup> (Q3421386) (← links)
- Computational limitations on learning from examples (Q3813320) (← links)
- The partitioning problem in unsupervised learning for nonlinear neurons (Q4857033) (← links)
- The Duality Between the Perceptron Algorithm and the von Neumann Algorithm (Q5172960) (← links)
