Learning all subfunctions of a function

DOI10.1016/J.IC.2004.03.003zbMATH Open1069.68056OpenAlexW2098087623MaRDI QIDQ596299FDOQ596299

Efim Kinber, Rolf Wiehagen, Sanjay Jain

Publication date: 10 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.03.003

Recommendations

• Learning all subfunctions of a function.
• Robust learning -- rich and poor
• scientific article
• Learning and Extending Sublanguages
• Learning and extending sublanguages

zbMATH Keywords

sublearning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Inductive inference of formal languages from positive data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• Prudence and other conditions on formal language learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Comparison of identification criteria for machine inductive inference
• Inductive inference of recursive functions: Complexity bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust learning aided by context
• Avoiding coding tricks by hyperrobust learning
• Robust learning -- rich and poor
• Robust separations in inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the role of search for learning from examples
• Robust learning is rich

Cited In (1)

• Learning and extending sublanguages

This page was built for publication: Learning all subfunctions of a function

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