Spectral learning of weighted automata. A forward-backward perspective

DOI10.1007/S10994-013-5416-XzbMATH Open1317.68088OpenAlexW164910094MaRDI QIDQ479459FDOQ479459

Authors: Borja Balle, Xavier Carreras, Franco M. Luque, Ariadna Quattoni 

Publication date: 5 December 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5416-x

Recommendations

• On the Rademacher complexity of weighted automata
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• Learning weighted automata
• Weighted automata are compact and actively learnable
• Spectral learning of latent-variable PCFGs: algorithms and sample complexity

zbMATH Keywords

dependency parsingspectral learningweighted finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• Title not available (Why is that?)
• Introduction to Information Retrieval
• On the learnability of discrete distributions
• Title not available (Why is that?)
• Tensor decompositions for learning latent variable models
• A theory of the learnable
• Matrices de Hankel
• On the definition of a family of automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the learnability and usage of acyclic probabilistic finite automata
• Title not available (Why is that?)
• Realizations by stochastic finite automata
• Weighted automata algorithms
• Internal structures in \(n\)-permutable varieties
• Learning probabilistic automata: a study in state distinguishability
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• Bilexical grammars and their cubic-time parsing algorithms
• Title not available (Why is that?)
• Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
• Learning functions represented as multiplicity automata
• A Spectral Approach for Probabilistic Grammatical Inference on Trees
• On rational stochastic languages

Cited In (11)

• Learning and planning in partially observable environments without prior domain knowledge
• Dimension-free concentration bounds on Hankel matrices for spectral learning
• Singular value automata and approximate minimization
• Learning weighted automata
• Spectral learning of latent-variable PCFGs: algorithms and sample complexity
• Approximate minimization of weighted tree automata
• Bisimulation metrics and norms for real-weighted automata
• PDFA distillation with error bound guarantees
• Generalization bounds for learning weighted automata
• On the Rademacher complexity of weighted automata
• Recognizable series on graphs and hypergraphs

Uses Software

• Penn Treebank

This page was built for publication: Spectral learning of weighted automata. A forward-backward perspective

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