Spectral learning of weighted automata. A forward-backward perspective
From MaRDI portal
Publication:479459
DOI10.1007/s10994-013-5416-xzbMath1317.68088OpenAlexW164910094MaRDI QIDQ479459
Franco M. Luque, Borja Balle, Xavier Carreras, 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
Related Items (8)
Learning Weighted Automata ⋮ Singular value automata and approximate minimization ⋮ Recognizable series on graphs and hypergraphs ⋮ Generalization bounds for learning weighted automata ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ Approximate minimization of weighted tree automata ⋮ On the Rademacher Complexity of Weighted Automata ⋮ Learning and planning in partially observable environments without prior domain knowledge
Uses Software
Cites Work
- Internal structures in \(n\)-permutable varieties
- Matrices de Hankel
- On the learnability and usage of acyclic probabilistic finite automata
- Learning probabilistic automata: a study in state distinguishability
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Realizations by stochastic finite automata
- On the learnability of discrete distributions
- Tensor decompositions for learning latent variable models
- On the definition of a family of automata
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Introduction to Information Retrieval
- A theory of the learnable
- Learning functions represented as multiplicity automata
- A Spectral Approach for Probabilistic Grammatical Inference on Trees
- Weighted Automata Algorithms
- Learning nonsingular phylogenies and hidden Markov models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Spectral learning of weighted automata. A forward-backward perspective
