Difference between revisions of "Daume and Marcu 2005 Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction"

From Cohen Courses
Jump to navigationJump to search
(Created page with '[http://hal3.name/docs/daume05laso.pdf Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction] An alternative formal analysis of Searn. In …')
 
Line 1: Line 1:
 +
=== 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.
 
[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]]
 
In progress by [[User:Jmflanig]]

Revision as of 02:39, 1 October 2011

Citation and Online Link

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

Example.jpg

Experimental Result

Related Papers

In progress by User:Jmflanig