%0 Journal Article %1 neu2009 %A Neu, G. %A Szepesvári, Cs. %D 2009 %J Machine Learning %K application, apprenticeship gradient, inverse learning, natural prediction, reinforcement structured survey theory, %P 303--337 %T Training Parsers by Inverse Reinforcement Learning %V 77 %X One major idea in structured prediction is to assume that the predictor computes its output by finding the maximum of a score function. The training of such a predictor can then be cast as the problem of finding weights of the score function so that the output of the predictor on the inputs matches the corresponding structured labels on the training set. A similar problem is studied in inverse reinforcement learning (IRL) where one is given an environment and a set of trajectories and the problem is to find a reward function such that an agent acting optimally with respect to the reward function would follow trajectories that match those in the training set. In this paper we show how IRL algorithms can be applied to structured prediction, in particular to parser training. We present a number of recent incremental IRL algorithms in a unified framework and map them to parser training algorithms. This allows us to recover some existing parser training algorithms, as well as to obtain a new one. The resulting algorithms are compared in terms of their sensitivity to the choice of various parameters and generalization ability on the Penn Treebank WSJ corpus.

@article{neu2009, abstract = {One major idea in structured prediction is to assume that the predictor computes its output by finding the maximum of a score function. The training of such a predictor can then be cast as the problem of finding weights of the score function so that the output of the predictor on the inputs matches the corresponding structured labels on the training set. A similar problem is studied in inverse reinforcement learning (IRL) where one is given an environment and a set of trajectories and the problem is to find a reward function such that an agent acting optimally with respect to the reward function would follow trajectories that match those in the training set. In this paper we show how IRL algorithms can be applied to structured prediction, in particular to parser training. We present a number of recent incremental IRL algorithms in a unified framework and map them to parser training algorithms. This allows us to recover some existing parser training algorithms, as well as to obtain a new one. The resulting algorithms are compared in terms of their sensitivity to the choice of various parameters and generalization ability on the Penn Treebank WSJ corpus.}, added-at = {2020-03-17T03:03:01.000+0100}, author = {Neu, G. and Szepesv{\'a}ri, {Cs}.}, biburl = {https://www.bibsonomy.org/bibtex/2840a4234b7b192bbc7de8a0962dbcb9a/csaba}, date-added = {2010-08-28 17:38:14 -0600}, date-modified = {2010-09-02 13:09:16 -0600}, interhash = {0aa4d12af4a000c6557eb5c0337c17e9}, intrahash = {840a4234b7b192bbc7de8a0962dbcb9a}, journal = {Machine Learning}, keywords = {application, apprenticeship gradient, inverse learning, natural prediction, reinforcement structured survey theory,}, pages = {303--337}, pdf = {papers/MLJ-SISP-09.pdf}, read = {1}, timestamp = {2020-03-17T03:03:01.000+0100}, title = {Training Parsers by Inverse Reinforcement Learning}, volume = 77, year = 2009 }