{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T03:32:32Z","timestamp":1772249552278,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Federal Ministry of Education and Research under the Berlin Big Data Center Project","award":["FKZ 01IS14013A"],"award-info":[{"award-number":["FKZ 01IS14013A"]}]},{"DOI":"10.13039\/501100003725","name":"BK21 Program of NRF Korea, BMBF","doi-asserted-by":"publisher","award":["01IS14013A"],"award-info":[{"award-number":["01IS14013A"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"DFG","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tnnls.2016.2598721","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T14:23:04Z","timestamp":1471616584000},"page":"2566-2579","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Exact Inference With Loss Augmented Objective in Structured Learning"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0443-3164","authenticated-orcid":false,"given":"Alexander","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Shinichi","family":"Nakajima","sequence":"additional","affiliation":[]},{"given":"Klaus-Robert","family":"Muller","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"3266","article-title":"Learning distributed representations for structured output prediction","author":"srikumar","year":"2014","journal-title":"Proc 27th NIPS"},{"key":"ref38","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.3680","article-title":"A tutorial on dual decomposition and Lagrangian relaxation for inference in natural language processing","volume":"45","author":"rush","year":"2012","journal-title":"J Artif Intell Res"},{"key":"ref32","first-page":"440","article-title":"Beam-width prediction for efficient context-free parsing","author":"bodenstab","year":"2011","journal-title":"Proc 49th ACL Conf"},{"key":"ref31","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390195"},{"key":"ref37","first-page":"223","article-title":"A sequential dual method for structural SVMs","author":"shevade","year":"2011","journal-title":"Proc 11th SIAM SDM"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00773"},{"key":"ref35","first-page":"783","article-title":"Learning efficiently with approximate inference via dual losses","author":"meshi","year":"2010","journal-title":"Proceedings of the 27th ICML"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200507"},{"key":"ref10","author":"koller","year":"2009","journal-title":"Probabilistic Graphical Models—Principles and Techniques"},{"key":"ref40","first-page":"429","article-title":"Discriminative learning over constrained latent representations","author":"chang","year":"2010","journal-title":"Proc of 11th NAACL HLT"},{"key":"ref11","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"bodlaender","year":"1993","journal-title":"Acta Cybern"},{"key":"ref12","article-title":"The Viterbi algorithm","author":"swaminathan","year":"1973","journal-title":"Proc IEEE"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9030"},{"key":"ref14","author":"bishop","year":"2006","journal-title":"Pattern Recognition and Machine Learning"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390268"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/817496"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2281761"},{"key":"ref19","article-title":"Accurate maximum-margin training for parsing with context-free grammars","author":"bauer","year":"2015","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3115\/1075096.1075150"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0108053"},{"key":"ref27","first-page":"812","article-title":"HOP-MAP: Efficient message passing with high order potentials","author":"tarlow","year":"2010","journal-title":"Proc 13th AISTATS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1592761.1592783"},{"key":"ref6","first-page":"1377","article-title":"Bundle methods for machine learning","author":"smola","year":"2007","journal-title":"Proc 21st Adv Conf NIPS"},{"key":"ref29","first-page":"785","article-title":"Structured learning with approximate inference","author":"kulesza","year":"2007","journal-title":"Proceedings of the 20th NIPS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref8","first-page":"53","article-title":"Block-coordinate Frank-Wolfe optimization for structural SVMs","author":"lacoste-julien","year":"2013","journal-title":"Proc 30th ICML"},{"key":"ref7","first-page":"311","article-title":"Bundle methods for regularized risk minimization","volume":"11","author":"teo","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref2","first-page":"1453","article-title":"Large margin methods for structured and interdependent output variables","volume":"6","author":"tsochantaridis","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102464"},{"key":"ref1","first-page":"25","article-title":"Max-margin Markov networks","author":"taskar","year":"2003","journal-title":"Proc of 16th NIPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15552-9_42"},{"key":"ref22","first-page":"1161","article-title":"Large scale hidden semi-Markov SVMs","author":"r\u00e4tsch","year":"2007","journal-title":"Proc 19th NIPS Conf"},{"key":"ref21","first-page":"1212","article-title":"Structured output learning with high order loss functions","author":"tarlow","year":"2012","journal-title":"Proc 15th AISTATS"},{"key":"ref42","first-page":"1349","article-title":"Faster algorithms for max-product message-passing","volume":"12","author":"mcauley","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref24","first-page":"415","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","author":"lauritzen","year":"1990","journal-title":"Readings in Uncertain Reasoning"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3115\/1687878.1687909"},{"key":"ref23","first-page":"1","article-title":"Max-margin parsing","author":"taskar","year":"2004","journal-title":"Proc EMNLP"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118694"},{"key":"ref26","first-page":"421","article-title":"Tighter linear program relaxations for high order graphical models","author":"mezuman","year":"2013","journal-title":"Proc Conf Uncertainty in Artif Intell (UAI)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2233490"},{"key":"ref25","first-page":"1","article-title":"Fast exact inference for recursive cardinality models","author":"tarlow","year":"2012","journal-title":"Proc 28th UAI"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8069036\/07547945.pdf?arnumber=7547945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:02Z","timestamp":1641987662000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7547945\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":44,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2016.2598721","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}