Low-Rank Approximation of Weighted Tree Automata
Abstract
We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposition of the underlying Hankel matrix defined by the WTA. Our main theoretical result is an efficient algorithm for computing the SVD of an infinite Hankel matrix implicitly represented as a WTA. We provide an analysis of the approximation error induced by the minimization, and we evaluate our method on real-world data originating in newswire treebank. We show that the model achieves lower perplexity than previous methods for PCFG minimization, and also is much more stable due to the absence of local optima.
Cite
Text
Rabusseau et al. "Low-Rank Approximation of Weighted Tree Automata." International Conference on Artificial Intelligence and Statistics, 2016.Markdown
[Rabusseau et al. "Low-Rank Approximation of Weighted Tree Automata." International Conference on Artificial Intelligence and Statistics, 2016.](https://mlanthology.org/aistats/2016/rabusseau2016aistats-low/)BibTeX
@inproceedings{rabusseau2016aistats-low,
title = {{Low-Rank Approximation of Weighted Tree Automata}},
author = {Rabusseau, Guillaume and Balle, Borja and Cohen, Shay B.},
booktitle = {International Conference on Artificial Intelligence and Statistics},
year = {2016},
pages = {839-847},
url = {https://mlanthology.org/aistats/2016/rabusseau2016aistats-low/}
}