On the learnability of recursive data

DOI10.1007/PL00009845zbMATH Open0934.68083MaRDI QIDQ1293697FDOQ1293697

Barbara Hammer

Publication date: 29 June 1999

Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)

Recommendations

• Learning with recurrent neural networks
• Sample complexity for learning recurrent perceptron mappings
• Some contributions to fixed-distribution learning theory
• Learnability and the Vapnik-Chervonenkis dimension
• scientific article; zbMATH DE number 1843097

zbMATH Keywords

PAC learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (5)

• Confident and Consistent Partial Learning of Recursive Functions
• Recurrent Neural Networks with Small Weights Implement Definite Memory Machines
• Learning with recurrent neural networks
• Title not available (Why is that?)
• Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures.

This page was built for publication: On the learnability of recursive data

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