Probability and plurality for aggregations of learning machines

DOI10.1016/0890-5401(88)90046-6zbMATH Open0646.68096OpenAlexW2067619284MaRDI QIDQ1104113FDOQ1104113

Authors: Leonard Pitt, Carl H. Smith 

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

Recommendations

• scientific article; zbMATH DE number 4031026
• Probabilistic and pluralistic learners with mind changes
• scientific article; zbMATH DE number 4058896
• Probabilistic inductive inference
• On aggregating teams of learning machines

zbMATH Keywords

probabilistic inferencepluralismlearning machinesteam inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

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

Cited In (42)

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

This page was built for publication: Probability and plurality for aggregations of learning machines

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