Corpus ID: 231924744

Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata

@article{Balle2021OptimalSA,
  title={Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata},
  author={B. Balle and Clara Lacroce and P. Panangaden and Doina Precup and Guillaume Rabusseau},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.06860}
}
We address the approximate minimization problem for weighted finite automata (WFAs) over a one-letter alphabet: to compute the best possible approximation of a WFA given a bound on the number of states. This work is grounded in Adamyan-Arov-Krein Approximation theory, a remarkable collection of results on the approximation of Hankel operators. In addition to its intrinsic mathematical relevance, this theory has proven to be very effective for model reduction. We adapt these results to the… Expand

References

SHOWING 1-10 OF 48 REFERENCES
A Canonical Form for Weighted Automata and Applications to Approximate Minimization
  • 18
  • PDF
Singular value automata and approximate minimization
  • 4
  • Highly Influential
  • PDF
Approximate Minimization of Weighted Tree Automata
  • 1
  • PDF
Learning Deterministic Weighted Automata with Queries and Counterexamples
  • 11
  • PDF
Multitask Spectral Learning of Weighted Automata
  • 7
  • PDF
Realizations by Stochastic Finite Automata
  • 106
Grammatical inference as a principal component analysis problem
  • 66
  • PDF
...
1
2
3
4
5
...