The Power of Pluralism for Automatic Program Synthesis
From MaRDI portal
Cited in
(43)- Probability and plurality for aggregations of learning machines
- On the relative sizes of learnable sets
- Learning in the presence of partial explanations
- Aggregating inductive expertise on partial recursive functions
- Extremes in the degrees of inferability
- On aggregating teams of learning machines
- Learning recursive functions from approximations
- Probabilistic language learning under monotonicity constraints
- Avoiding coding tricks by hyperrobust learning
- Trade-off among parameters affecting inductive inference
- Automata techniques for query inference machines
- Learning to win process-control games watching game-masters
- Learning by the process of elimination
- Counting extensional differences in BC-learning
- Recursion theoretic models of learning: Some results and intuitions
- On the amount of nonconstructivity in learning formal languages from text
- Iterative learning from positive data and negative counterexamples
- Learning languages from positive data and a finite number of queries
- Parallel learning of automatic classes of languages
- Learning from streams
- Learning via queries in [+, <]
- Infinitary self-reference in learning theory
- The power of probabilism in Popperian FINite learning
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Inductive inference of recursive functions: qualitative theory
- Measure, category and learning theory
- Probabilistic and pluralistic learners with mind changes
- Comparison of identification criteria for machine inductive inference
- Hierarchies of probabilistic and team FIN-learning
- Probabilistic inductive inference: A survey
- Robust learning is rich
- Closedness properties in ex-identification
- Simulating teams with many conjectures
- On the power of probabilistic strategies in inductive inference
- One-sided error probabilistic inductive inference and reliable frequency identification
- On the inference of approximate programs
- Training sequences
- Learning via finitely many queries
- Learning recursive functions: A survey
- Absolute versus probabilistic classification in a logical setting
- Non-U-shaped vacillatory and team learning
- Inferring answers to queries
- Taming teams with mind changes
This page was built for publication: The Power of Pluralism for Automatic Program Synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960153)
