Sample complexity for learning recurrent perceptron mappings

DOI10.1109/18.532888MaRDI QIDQ4896826zbMATH OpenOpenAlexFDO

Authors Bhaskar Dasgupta, Eduardo D. Sontag

Publication date 22 October 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3db6753e4134f1cc9d47e768fd433c2f4719e4a3

zbMATH Keywords

probably approximately correct learningrecurrent perceptron classifiers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• On the learnability of recursive data
• A learning result for continuous-time recurrent neural networks
• Estimates of Data Complexity in Neural-Network Learning
• scientific article; zbMATH DE number 2087696

Cited in

(8)

• Vapnik-Chervonenkis dimension of recurrent neural networks
• The complexity of model classes, and smoothing noisy data
• A learning result for continuous-time recurrent neural networks
• On the learnability of recursive data
• Complete controllability of continuous-time recurrent neural networks
• Compressive sensing and neural networks from a statistical learning perspective
• Recurrence methods in the analysis of learning processes
• Improving Generalization Capabilities of Dynamic Neural Networks

This page was built for publication: Sample complexity for learning recurrent perceptron mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896826)