A general frmework for supervised learning. Probably almost Bayesian algorithms

DOI10.1016/0165-1889(94)90070-1zbMath0789.92002OpenAlexW1543182514MaRDI QIDQ1309836

L. Bochereau, Guillaume Deffuant, Paul Bourgine

Publication date: 14 June 1994

Published in: Journal of Economic Dynamics \& Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1889(94)90070-1

zbMATH Keywords

orthogonal polynomialsartificial neural networkspolynomial timePAB algorithmsperceptron membranesprobably almost Bayesian algorithms

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)

Cites Work

• Unnamed Item
• Unnamed Item
• A general lower bound on the number of examples needed for learning
• A theory of the learnable
• Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: A general frmework for supervised learning. Probably almost Bayesian algorithms