scientific article

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity pattern recognition Turing machines neural network learning backpropagation neural nets linear threshold functions perceptrons stratification theorem computing geometric predicates decision surfaces group-invariance theorem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (47)

Complexity of perceptron recognition for a class of geometric patterns. ⋮ On the perceptron learning algorithm on data with high precision ⋮ Logic programs and connectionist networks ⋮ Lyndon + Christoffel = digitally convex ⋮ Average case quantum lower bounds for computing the Boolean mean ⋮ Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks ⋮ On the degree of Boolean functions as real polynomials ⋮ Comparison of learning and generalization capabilities of the Kak and the backpropagation algorithms ⋮ Geometric sets of low information content ⋮ Classification by polynomial surfaces ⋮ Relativized counting classes: Relations among thresholds, parity, and mods ⋮ Fooling Polytopes ⋮ Challenges in Markov chain Monte Carlo for Bayesian neural networks ⋮ Unnamed Item ⋮ On testing monomials in multivariate polynomials ⋮ Two-layer contractive encodings for learning stable nonlinear features ⋮ Approximate blocked Gibbs sampling for Bayesian neural networks ⋮ Normal vector and winding number in 2D digital images with their application for hole detection ⋮ Unbounded-error quantum query complexity ⋮ A note on the complex and bicomplex valued neural networks ⋮ Introduction to computation and learning in artificial neural networks ⋮ Perceptrons revisited ⋮ Eluding oblivion with smart stochastic selection of synaptic updates ⋮ Arthur-Merlin games in Boolean decision trees ⋮ Methods for pattern selection, class-specific feature selection and classification for automated learning ⋮ Integer representations towards efficient counting in the bit probe model ⋮ A multiview approach for intelligent data analysis based on data operators ⋮ Neural networks for control systems - a survey ⋮ Logic in a dynamic brain ⋮ An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function ⋮ Unnamed Item ⋮ Learning algorithms of layered neural networks via extended Kalman filters ⋮ Combinatorial View of Digital Convexity ⋮ Unconditional lower bounds for learning intersections of halfspaces ⋮ SC-net: A hybrid connectionist, symbolic system ⋮ On the computational power of depth-2 circuits with threshold and modulo gates ⋮ A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy ⋮ Correlation Between Eigenvalue Spectra and Dynamics of Neural Networks ⋮ Monotone circuits for monotone weighted threshold functions ⋮ Broadening the tests of learning models ⋮ Boolean constant degree functions on the slice are juntas ⋮ Thirteen theorems in search of the truth ⋮ Unnamed Item ⋮ The parts and the whole: inquiring how the interaction of simple subsystems generates complexity ⋮ Unifying metric approach to the triple parity. ⋮ On optimal pairwise linear classifiers for normal distributions: The \(d\)-dimensional case ⋮ Fundamentals of recurrent neural network (RNN) and long short-term memory (LSTM) network

This page was built for publication: