Bibliographic Details
| Title: |
Search-based structured prediction. |
| Authors: |
Daumé, Hal1 me@hal3.name, Langford, John2, Marcu, Daniel3 |
| Source: |
Machine Learning. Jun2009, Vol. 75 Issue 3, p297-325. 29p. 3 Diagrams, 5 Charts, 1 Graph. |
| Subjects: |
Forecasting, Structured techniques of electronic data processing, Prediction models, Algorithms, Classification, Mathematical decomposition |
| Abstract: |
We present Searn, an algorithm for integrating search and l earning to solve complex structured prediction problems such as those that occur in natural language, speech, computational biology, and vision. Searn is a meta-algorithm that transforms these complex problems into simple classification problems to which any binary classifier may be applied. Unlike current algorithms for structured learning that require decomposition of both the loss function and the feature functions over the predicted structure, Searn is able to learn prediction functions for any loss function and any class of features. Moreover, Searn comes with a strong, natural theoretical guarantee: good performance on the derived classification problems implies good performance on the structured prediction problem. [ABSTRACT FROM AUTHOR] |
|
Copyright of Machine Learning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
