On a generalized notion of mistake bounds

DOI10.1006/INCO.2000.3001zbMath1007.68079OpenAlexW2024948980MaRDI QIDQ1854426

Sanjay Jain, Arun Sharma

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1006/inco.2000.3001

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Parsimony hierarchies for inductive inference

Cites Work

• Elementary formal systems, intrinsic complexity, and procrastination
• Inductive inference of monotonic formal systems from positive data
• Finding patterns common to a set of strings
• On the role of procrastination in machine learning
• A class of prolog programs inferable from positive data
• Inductive inference of formal languages from positive data
• General inductive inference types based on linearly-ordered sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a generalized notion of mistake bounds