Probability and plurality for aggregations of learning machines (Q1104113): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3993187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of identification criteria for machine inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the error correcting power of pluralism in BC-type inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results on grammatical inference and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inductive expertise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Pluralism for Automatic Program Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of probabilistic strategies in inductive inference / rank
 
Normal rank

Latest revision as of 16:40, 18 June 2024

scientific article
Language Label Description Also known as
English
Probability and plurality for aggregations of learning machines
scientific article

    Statements

    Probability and plurality for aggregations of learning machines (English)
    0 references
    0 references
    0 references
    1988
    0 references
    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.
    0 references
    probabilistic inference
    0 references
    team inference
    0 references
    learning machines
    0 references
    pluralism
    0 references

    Identifiers