Efficient Exact Inference With Loss Augmented Objective in Structured Learning
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bauer, Alexander | - |
dc.contributor.author | Nakajima, Shinichi | - |
dc.contributor.author | Mueller, Klaus-Robert | - |
dc.date.accessioned | 2021-09-02T23:16:19Z | - |
dc.date.available | 2021-09-02T23:16:19Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2017-11 | - |
dc.identifier.issn | 2162-237X | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/81634 | - |
dc.description.abstract | Structural support vector machine (SVM) is an elegant approach for building complex and accurate models with structured outputs. However, its applicability relies on the availability of efficient inference algorithms-the state-of-the-art training algorithms repeatedly perform inference to compute a subgradient or to find the most violating configuration. In this paper, we propose an exact inference algorithm for maximizing nondecomposable objectives due to special type of a high-order potential having a decomposable internal structure. As an important application, our method covers the loss augmented inference, which enables the slack and margin scaling formulations of structural SVM with a variety of dissimilarity measures, e.g., Hamming loss, precision and recall, F-beta-loss, intersection over union, and many other functions that can be efficiently computed from the contingency table. We demonstrate the advantages of our approach in natural language parsing and sequence segmentation applications. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | MINIMIZATION | - |
dc.subject | ALGORITHMS | - |
dc.subject | SVMS | - |
dc.title | Efficient Exact Inference With Loss Augmented Objective in Structured Learning | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Mueller, Klaus-Robert | - |
dc.identifier.doi | 10.1109/TNNLS.2016.2598721 | - |
dc.identifier.scopusid | 2-s2.0-84983036054 | - |
dc.identifier.wosid | 000413403900009 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, v.28, no.11, pp.2566 - 2579 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS | - |
dc.citation.title | IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS | - |
dc.citation.volume | 28 | - |
dc.citation.number | 11 | - |
dc.citation.startPage | 2566 | - |
dc.citation.endPage | 2579 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | MINIMIZATION | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | SVMS | - |
dc.subject.keywordAuthor | Dynamic programming | - |
dc.subject.keywordAuthor | graphical models | - |
dc.subject.keywordAuthor | high-order potentials | - |
dc.subject.keywordAuthor | inference | - |
dc.subject.keywordAuthor | margin scaling (MS) | - |
dc.subject.keywordAuthor | slack scaling (SS) | - |
dc.subject.keywordAuthor | structural support vector machines (SVMs) | - |
dc.subject.keywordAuthor | structured output | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.