Learning reliably and with one-sided error

DOI10.1007/BF01191474MaRDI QIDQ4327384zbMATH OpenFDO

Authors Jyrki Kivinen

Publication date 5 April 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01191474

zbMATH Keywords

probably useful learningreliably

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 67632
• Probably Approximate Learning of Sets and Functions
• Reliable agnostic learning
• Maximizing agreements with one-sided error with applications to heuristic learning
• Maximizing agreements with one-sided error with applications to heuristic learning

Cites work

• A general lower bound on the number of examples needed for learning
• A theory of the learnable
• Computational limitations on learning from examples
• Equivalence of models for polynomial learnability
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Probably Approximate Learning of Sets and Functions

Cited in

(7)

• One-trial correction of legacy AI systems and stochastic separation theorems
• Learning with mitigating random consistency from the accuracy measure
• scientific article; zbMATH DE number 67632 (Why is no real title available?)
• scientific article; zbMATH DE number 1304314 (Why is no real title available?)
• Reliable agnostic learning
• Maximizing agreements with one-sided error with applications to heuristic learning
• Maximizing agreements with one-sided error with applications to heuristic learning

This page was built for publication: Learning reliably and with one-sided error

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