Optimizing nondecomposable loss functions in structured prediction

We develop an algorithm for structured prediction with nondecomposable performance measures. The algorithm learns parameters of Markov Random Fields (MRFs) and can be applied to multivariate performance measures. Examples include performance measures such as Fβ score (natural language processing), i...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 4 vom: 21. Apr., Seite 911-24
1. Verfasser: Ranjbar, Mani (VerfasserIn)
Weitere Verfasser: Lan, Tian, Wang, Yang, Robinovitch, Steven N, Li, Ze-Nian, Mori, Greg
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM220017611
003 DE-627
005 20231224044342.0
007 cr uuu---uuuuu
008 231224s2013 xx |||||o 00| ||eng c
028 5 2 |a pubmed24n0733.xml 
035 |a (DE-627)NLM220017611 
035 |a (NLM)22868650 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Ranjbar, Mani  |e verfasserin  |4 aut 
245 1 0 |a Optimizing nondecomposable loss functions in structured prediction 
264 1 |c 2013 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 04.11.2013 
500 |a Date Revised 21.10.2021 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a We develop an algorithm for structured prediction with nondecomposable performance measures. The algorithm learns parameters of Markov Random Fields (MRFs) and can be applied to multivariate performance measures. Examples include performance measures such as Fβ score (natural language processing), intersection over union (object category segmentation), Precision/Recall at k (search engines), and ROC area (binary classifiers). We attack this optimization problem by approximating the loss function with a piecewise linear function. The loss augmented inference forms a Quadratic Program (QP), which we solve using LP relaxation. We apply this approach to two tasks: object class-specific segmentation and human action retrieval from videos. We show significant improvement over baseline approaches that either use simple loss functions or simple scoring functions on the PASCAL VOC and H3D Segmentation datasets, and a nursing home action recognition dataset 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Lan, Tian  |e verfasserin  |4 aut 
700 1 |a Wang, Yang  |e verfasserin  |4 aut 
700 1 |a Robinovitch, Steven N  |e verfasserin  |4 aut 
700 1 |a Li, Ze-Nian  |e verfasserin  |4 aut 
700 1 |a Mori, Greg  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 35(2013), 4 vom: 21. Apr., Seite 911-24  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:35  |g year:2013  |g number:4  |g day:21  |g month:04  |g pages:911-24 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 35  |j 2013  |e 4  |b 21  |c 04  |h 911-24