Aspects of complexity of probabilistic learning under monotonicity constraints

Recommendations

The Computational Complexity of Monotonicity in Probabilistic Networks
On some open problems in monotonic and conservative learning
A decision-theoretic extension of stochastic complexity and its applications to learning
Comparing the power of probabilistic learning and oracle identification under monotonicity constraints
Stochastic complexity in learning
Approximate resilience, monotonicity, and the complexity of agnostic learning
Algorithmic Learning Theory
scientific article; zbMATH DE number 1966606
On learning monotone Boolean functions under the uniform distribution
On learning monotone DNF formulae under uniform distributions

Cites work

A Machine-Independent Theory of the Complexity of Recursive Functions
A theory of the learnable
Classical recursion theory. Vol. II
Comparing the power of probabilistic learning and oracle identification under monotonicity constraints
Criteria of language learning
Extremes in the degrees of inferability
Generalization and specialization strategies for learning r. e. languages
scientific article; zbMATH DE number 3655912 (Why is no real title available?)
scientific article; zbMATH DE number 3664335 (Why is no real title available?)
scientific article; zbMATH DE number 67621 (Why is no real title available?)
scientific article; zbMATH DE number 3584924 (Why is no real title available?)
scientific article; zbMATH DE number 408780 (Why is no real title available?)
scientific article; zbMATH DE number 517031 (Why is no real title available?)
scientific article; zbMATH DE number 517033 (Why is no real title available?)
Identifying nearly minimal Gödel numbers from additional information
Inductive inference of formal languages from positive data
Language identification in the limit
Learning regular sets from queries and counterexamples
Learning via queries
Monotonic and dual monotonic language learning
Monotonic and non-monotonic inductive inference
Noisy inference and oracles
On the intrinsic complexity of learning
On the power of probabilistic strategies in inductive inference
On the query complexity of sets
On the structure of degrees of inferability.
Probabilistic inductive inference
Probabilistic language learning under monotonicity constraints
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
Recursively enumerable sets and degrees. A study of computable functions and computably generated sets
The position of index sets of identifiable sets in the arithmetical hierarchy

Cited in

(8)

Probabilistic language learning under monotonicity constraints
Learning rule sets and Sugeno integrals for monotonic classification problems
Probabilistic Rule Learning in Nonmonotonic Domains
scientific article; zbMATH DE number 408770 (Why is no real title available?)
Comparing the power of probabilistic learning and oracle identification under monotonicity constraints
Algorithmic Learning Theory
Robust learning with infinite additional information
Probabilistic language learning under monotonicity constraints

This page was built for publication: Aspects of complexity of probabilistic learning under monotonicity constraints

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