A Family of CCCP Algorithms Which Minimize the TRW Free Energy
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nishiyama, Yu | - |
dc.contributor.author | Ye, Xingyao | - |
dc.contributor.author | Yuille, Alan L. | - |
dc.date.accessioned | 2021-09-06T10:48:16Z | - |
dc.date.available | 2021-09-06T10:48:16Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2012-01 | - |
dc.identifier.issn | 0288-3635 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/106248 | - |
dc.description.abstract | We propose a family of convergent double-loop algorithms which minimize the TRW free energy. These algorithms are based on the concave convex procedure (CCCP) so we call them TRW-CCCP. Our formulation includes many free parameters which specify an infinite number of decompositions of the TRW free energy into convex and concave parts. TRW-CCCP is guaranteed to converge to the global minima for any settings of these free parameters, including adaptive settings if they satisfy conditions defined in this paper. We show that the values of these free parameters control the speed of convergence of the the inner and outer loops in TRW-CCCP. We performed experiments on a two-dimensional Ising model observing that TRW-CCCP converges to the global minimum of the TRW free energy and that the convergence rate depends on the parameter settings. We compare with the original message passing algorithm (TRW-BP) by varying the difficulty of the problem (by adjusting the energy function) and the number of iterations in the inner loop of TRW-CCCP. We show that on difficult problems TRW-CCCP converges faster than TRW-BP (in terms of total number of iterations) if few inner loop iterations are used. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | KIKUCHI FREE-ENERGIES | - |
dc.subject | BELIEF PROPAGATION | - |
dc.subject | BETHE | - |
dc.title | A Family of CCCP Algorithms Which Minimize the TRW Free Energy | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Yuille, Alan L. | - |
dc.identifier.doi | 10.1007/s00354-012-0102-2 | - |
dc.identifier.wosid | 000300292600002 | - |
dc.identifier.bibliographicCitation | NEW GENERATION COMPUTING, v.30, no.1, pp.3 - 16 | - |
dc.relation.isPartOf | NEW GENERATION COMPUTING | - |
dc.citation.title | NEW GENERATION COMPUTING | - |
dc.citation.volume | 30 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 3 | - |
dc.citation.endPage | 16 | - |
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.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | KIKUCHI FREE-ENERGIES | - |
dc.subject.keywordPlus | BELIEF PROPAGATION | - |
dc.subject.keywordPlus | BETHE | - |
dc.subject.keywordAuthor | TRW Free Energy | - |
dc.subject.keywordAuthor | CCCP | - |
dc.subject.keywordAuthor | Probabilistic Inference | - |
dc.subject.keywordAuthor | Markov Random Fields | - |
dc.subject.keywordAuthor | Marginals | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
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.