Probabilistic inductive inference: A survey

DOI10.1016/S0304-3975(00)00218-8zbMath0972.68098OpenAlexW2062484497WikidataQ127481999 ScholiaQ127481999MaRDI QIDQ5941566

Andris Ambainis

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00218-8

zbMATH Keywords

computational learning theoryinductive inferencerandomized computation

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (6)

On the Influence of Technology on Learning Processes ⋮ Learning recursive functions: A survey ⋮ Absolute versus probabilistic classification in a logical setting ⋮ Probabilistic and team PFIN-type learning: General properties ⋮ Equivalences between learning of data and probability distributions, and their applications ⋮ Learning from Streams

Cites Work

• Computational limits on team identification of languages
• On the structure of degrees of inferability.
• Probability and plurality for aggregations of learning machines
• Some natural properties of strong-identification in inductive inference
• Classical recursion theory. Vol. II
• Extremes in the degrees of inferability
• Probabilistic language learning under monotonicity constraints
• Breaking the probability \({1\over 2}\) barrier in FIN-type learning
• Finite identification of functions by teams with success ratio \(\frac 12\) and above
• A theory of the learnable
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Language identification in the limit
• Hierarchies of probabilistic and team FIN-learning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic inductive inference: A survey