Probability and plurality for aggregations of learning machines

Leonard Pitt, Carl H. Smith

Research output: Contribution to journalArticlepeer-review


A new notion of probabilistic team inductive inference is introduced and compared with both probabilistic inference and team inference. In many cases, but not all, probabilism can be traded for pluralism, and vice versa. Necessary and sufficient conditions are given describing when a team of deterministic or probabilistic learning machines can be coalesced into a single learning machine. A subtle difference between probabilism and pluralism is revealed.

Original languageEnglish (US)
Pages (from-to)77-92
Number of pages16
JournalInformation and Computation
Issue number1
StatePublished - Apr 1988
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Probability and plurality for aggregations of learning machines'. Together they form a unique fingerprint.

Cite this