On the Rademacher Complexity of Weighted Automata

DOI10.1007/978-3-319-24486-0_12zbMath1388.68147OpenAlexW2262314682MaRDI QIDQ2835626

Borja Balle, Mehryar Mohri

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24486-0_12

Mathematics Subject Classification ID

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

Related Items (max. 100)

Learning infinite-word automata with loop-index queries ⋮ Learning Weighted Automata ⋮ Unnamed Item ⋮ Generalization bounds for learning weighted automata

Cites Work

• A spectral algorithm for learning hidden Markov models
• Spectral learning of weighted automata. A forward-backward perspective
• Absolute convergence of rational series is semi-decidable
• On the computational complexity of approximating distributions by probabilistic automata
• Matrices de Hankel
• A trace inequality of John von Neumann
• VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
• Realizations by stochastic finite automata
• Learning Weighted Automata
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• Combinatorial methods in density estimation
• Some applications of concentration inequalities to statistics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Rademacher Complexity of Weighted Automata