On some open problems in monotonic and conservative learning

DOI10.1016/J.IPL.2009.04.020MaRDI QIDQ989527zbMATH OpenOpenAlexFDO

Authors Sanjay Jain

Publication date 20 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.04.020

zbMATH Keywords

monotonicityconservativenessinductive inferencetheory of computation

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites work

• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 512873 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Incremental learning from positive data
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning indexed families of recursive languages from positive data: A survey
• Monotonic and non-monotonic inductive inference
• Prudence and other conditions on formal language learning
• Toward a mathematical theory of inductive inference

Cited in

(2)

• Aspects of complexity of probabilistic learning under monotonicity constraints
• scientific article; zbMATH DE number 7357537 (Why is no real title available?)

This page was built for publication: On some open problems in monotonic and conservative learning

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