Counting extensional differences in BC-learning
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1670728
- scientific article; zbMATH DE number 67634
- Approximate model counting via extension rule
- PAC learning, VC dimension, and the arithmetic hierarchy
- scientific article; zbMATH DE number 1804113
- scientific article; zbMATH DE number 2089366
- Exploring learnability between exact and PAC
- Combinatorial bounds for learning performance
- Learning with errors and extrapolated dihedral cosets
- scientific article; zbMATH DE number 994739
Cites work
- scientific article; zbMATH DE number 1670728 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 841093 (Why is no real title available?)
- scientific article; zbMATH DE number 1416102 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- Aggregating inductive expertise
- Classical recursion theory. Vol. II
- Comparison of identification criteria for machine inductive inference
- Complexity issues for vacillatory function identification
- Generalized notions of mind change complexity
- Inductive inference of formal languages from positive data
- Language identification in the limit
- On the role of procrastination in machine learning
- On the structure of degrees of inferability.
- Ordinal mind change complexity of language identification
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
Cited in
(2)
This page was built for publication: Counting extensional differences in BC-learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887167)