View source for Daume and Marcu 2005 Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction

From Cohen Courses

← Daume and Marcu 2005 Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

=== Citation and Online Link === [http://hal3.name/docs/daume05laso.pdf Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction] An alternative formal analysis of Searn. === Summary === The authors present the Learning as Search Optimization (LaSO) framework. The algorithm is basically SEARN but analyzed differently (and also ~24 pages shorter). Like SEARN, LaSO attempts to combine the learning of the model with the search that occurs during decoding. === Method === [[File:Example.jpg]] === Experimental Result === === Related Papers === In progress by [[User:Jmflanig]]

Return to Daume and Marcu 2005 Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction.