Efficiency in the identification in the limit learning paradigm

DOI10.1007/978-3-662-48395-4_2zbMATH Open1404.68060OpenAlexW2501156850MaRDI QIDQ2963593FDOQ2963593

Authors: Rémi Eyraud, Jeffrey Heinz, Ryo Yoshinaka 

Publication date: 15 February 2017

Published in: Topics in Grammatical Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48395-4_2

Recommendations

• Can learning in the limit be done efficiently?
• Learning efficiency of very simple grammars from positive data
• Learning Efficiency of Very Simple Grammars from Positive Data
• Learning and classifying
• Learning and classifying

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Cites Work

• Learnability and the Vapnik-Chervonenkis dimension
• Three models for the description of language
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Finding patterns common to a set of strings
• A theory of the learnable
• Learning Simple Concepts under Simple Distributions
• On multiple context-free grammars
• Tutorial on practical prediction theory for classification
• Distributional learning of parallel multiple context-free grammars
• Efficient learning of context-free grammars from positive structural examples
• Characteristic sets for polynomial grammatical inference
• Title not available (Why is that?)
• Polynomial identification in the limit of substitutable context-free languages
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
• Learning register automata: from languages to program structures
• On polynomial-time learnability in the limit of strictly deterministic automata
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• Polynomial-time identification of very simple grammars from positive data.
• From learning in the limit to stochastic finite learning
• A solution of the syntactical induction-inference problem for regular languages
• Learning efficiency of very simple grammars from positive data
• VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
• LARS: a learning algorithm for rewriting systems
• Learning trees from strings: a strong learning algorithm for some context-free grammars

Cited In (5)

• A fixed rehearsal capacity interpretation of limits on absolute identification performance
• Learning context-free grammars from positive data and membership queries
• Can learning in the limit be done efficiently?
• Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits
• Robust identification in the limit from incomplete positive data

This page was built for publication: Efficiency in the identification in the limit learning paradigm

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