Abstract
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. We present a framework, reminiscent of structural risk minimization, for empirical risk minimization of the parameters of a fixed probabilistic grammar using the log-loss. We derive sample complexity bounds in this framework that apply both to the supervised setting and the unsupervised setting.
Original language | English |
---|---|
Title of host publication | Proceedings of NIPS |
Publisher | NIPS Foundation |
Pages | 1-9 |
Number of pages | 9 |
Publication status | Published - 2010 |