Probability and plurality for aggregations of learning machines
From MaRDI portal
(Redirected from Publication:1104113)
Recommendations
Cites work
- scientific article; zbMATH DE number 3655912 (Why is no real title available?)
- scientific article; zbMATH DE number 43947 (Why is no real title available?)
- scientific article; zbMATH DE number 3485660 (Why is no real title available?)
- scientific article; zbMATH DE number 3531360 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3588020 (Why is no real title available?)
- A theory of the learnable
- Aggregating inductive expertise
- Comparison of identification criteria for machine inductive inference
- Language identification in the limit
- On the error correcting power of pluralism in BC-type inductive inference
- On the power of probabilistic strategies in inductive inference
- Some decidability results on grammatical inference and complexity
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
Cited in
(42)- Taming teams with mind changes
- Hierarchies of probabilistic and team FIN-learning
- Quantum inductive inference by finite automata
- A learning algorithm for source aggregation
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Learning via queries in [+, <]
- Measure, category and learning theory
- Probability pooling for dependent agents in collective learning
- scientific article; zbMATH DE number 4031026 (Why is no real title available?)
- scientific article; zbMATH DE number 149519 (Why is no real title available?)
- The synthesis of language learners.
- Probabilistic inductive inference: A survey
- Aggregating inductive expertise on partial recursive functions
- Probabilistic language learning under monotonicity constraints
- On aggregating teams of learning machines
- Training sequences
- Fast learning rates in statistical inference through aggregation
- Robust learning is rich
- Investigations on measure-one identification of classes of languages
- Avoiding coding tricks by hyperrobust learning
- Memory limited inductive inference machines
- Closedness properties in ex-identification
- Simulating teams with many conjectures
- scientific article; zbMATH DE number 7307484 (Why is no real title available?)
- On the inference of approximate programs
- On the relative sizes of learnable sets
- scientific article; zbMATH DE number 2217750 (Why is no real title available?)
- Input-dependence in function-learning
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
- Learning from streams
- The power of probabilism in Popperian FINite learning
- Recursion theoretic models of learning: Some results and intuitions
- Extremes in the degrees of inferability
- Aggregating inductive expertise
- scientific article; zbMATH DE number 177811 (Why is no real title available?)
- Absolute versus probabilistic classification in a logical setting
- Trade-off among parameters affecting inductive inference
- PAC learning of probability distributions over a discrete domain.
- Trees and learning
- scientific article; zbMATH DE number 4058897 (Why is no real title available?)
- Probabilistic and pluralistic learners with mind changes
- Probabilistic and team PFIN-type learning: General properties
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)
