Generalization bounds for learning weighted automata

DOI10.1016/j.tcs.2017.11.023zbMath1388.68148arXiv1610.07883OpenAlexW2774279804MaRDI QIDQ1704563

Mehryar Mohri, Borja Balle

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.07883

zbMATH Keywords

learning theoryweighted automataRademacher complexitygeneralization bounds

Mathematics Subject Classification ID

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

Related Items (2)

Learning infinite-word automata with loop-index queries ⋮ Unnamed Item

Uses Software

• OCRopus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral learning of weighted automata. A forward-backward perspective
• Absolute convergence of rational series is semi-decidable
• Handbook of weighted automata
• On the computational complexity of approximating distributions by probabilistic automata
• Matrices de Hankel
• A trace inequality of John von Neumann
• Realizations by stochastic finite automata
• On the Rademacher Complexity of Weighted Automata
• Learning Weighted Automata
• Formal Analysis of Online Algorithms
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Uniform Central Limit Theorems
• Biological Sequence Analysis
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• Weighted Automata Algorithms
• Model Checking Linear-Time Properties of Probabilistic Systems
• Understanding Machine Learning
• An Introduction to Matrix Concentration Inequalities
• Combinatorial methods in density estimation
• VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states

This page was built for publication: Generalization bounds for learning weighted automata