The Power of Pluralism for Automatic Program Synthesis

Cited in

(43)

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

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)