Please use this identifier to cite or link to this item:
|Title:||A primal sub-gradient method for structured classification with the averaged sum loss||Authors:||Mančev, Dejan
|Issue Date:||1-Jan-2014||Journal:||International Journal of Applied Mathematics and Computer Science||Abstract:||© 2015 by Dejan Mančev. We present a primal sub-gradient method for structured SVM optimization defined with the averaged sum of hinge losses inside each example. Compared with the mini-batch version of the Pegasos algorithm for the structured case, which deals with a single structure from each of multiple examples, our algorithm considers multiple structures from a single example in one update. This approach should increase the amount of information learned from the example. We show that the proposed version with the averaged sum loss has at least the same guarantees in terms of the prediction loss as the stochastic version. Experiments are conducted on two sequence labeling problems, shallow parsing and part-of-speech tagging, and also include a comparison with other popular sequential structured learning algorithms.||URI:||https://open.ni.ac.rs/handle/123456789/4531||DOI:||10.2478/amcs-2014-0067|
|Appears in Collections:||Naučne i umetničke publikacije|
Show full item record
checked on Sep 4, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.