Probability and plurality for aggregations of learning machines

DOI10.1016/0890-5401(88)90046-6zbMath0646.68096OpenAlexW2067619284MaRDI QIDQ1104113

Carl H. Smith, Leonard Pitt

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90046-6

zbMATH Keywords

probabilistic inferencepluralismlearning machinesteam inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

PAC learning of probability distributions over a discrete domain. ⋮ Trees and learning ⋮ Memory limited inductive inference machines ⋮ The power of probabilism in Popperian FINite learning ⋮ On aggregating teams of learning machines ⋮ Learning via queries in [+, <] ⋮ Recursion theoretic models of learning: Some results and intuitions ⋮ On the relative sizes of learnable sets ⋮ Probabilistic and pluralistic learners with mind changes ⋮ Probabilistic language learning under monotonicity constraints ⋮ Simulating teams with many conjectures ⋮ Quantum inductive inference by finite automata ⋮ Absolute versus probabilistic classification in a logical setting ⋮ Probabilistic and team PFIN-type learning: General properties ⋮ Taming teams with mind changes ⋮ Aggregating inductive expertise on partial recursive functions ⋮ Measure, category and learning theory ⋮ Hierarchies of probabilistic and team FIN-learning ⋮ Probabilistic inductive inference: A survey ⋮ Robust learning is rich ⋮ Closedness properties in ex-identification ⋮ Input-dependence in function-learning ⋮ Unnamed Item ⋮ Investigations on measure-one identification of classes of languages ⋮ Trade-off among parameters affecting inductive inference ⋮ Learning from Streams ⋮ On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms ⋮ The synthesis of language learners. ⋮ On the inference of approximate programs ⋮ Avoiding coding tricks by hyperrobust learning ⋮ Extremes in the degrees of inferability ⋮ Training sequences

Cites Work

• Comparison of identification criteria for machine inductive inference
• On the power of probabilistic strategies in inductive inference
• On the error correcting power of pluralism in BC-type inductive inference
• A theory of the learnable
• Aggregating inductive expertise
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Some decidability results on grammatical inference and complexity
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item