Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction

Details Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction

2009-07-04

arxiv.org/abs/0907.0809v1

ICML 2005

Computer Science

Learning

Scientific paper

Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., linear chains) in which search and parameter estimation can be performed exactly. Unfortunately, in many complex problems, it is rare that exact search or parameter estimation is tractable. Instead of learning exact models and searching via heuristic means, we embrace this difficulty and treat the structured output problem in terms of approximate search. We present a framework for learning as search optimization, and two parameter updates with convergence theorems and bounds. Empirical evidence shows that our integrated approach to learning and decoding can outperform exact models at smaller computational cost.

Affiliated with

Also associated with

No associations

Rating

Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning as Search Optimization: Approximate Large Margin Methods for Structured Prediction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187260