[{"doi":"10.48550/arXiv.1205.6352","corr_author":"1","status":"public","oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1205.6352","open_access":"1"}],"department":[{"_id":"VlKo"}],"publication_status":"submitted","year":"2012","type":"preprint","abstract":[{"text":"     This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","_id":"2928","publication":"arXiv","language":[{"iso":"eng"}],"external_id":{"arxiv":["1205.6352"]},"arxiv":1,"article_number":"1205.6352","citation":{"chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1205.6352\">https://doi.org/10.48550/arXiv.1205.6352</a>.","ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” <i>arXiv</i>. .","ista":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. arXiv, 1205.6352.","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, 1205.6352, doi:<a href=\"https://doi.org/10.48550/arXiv.1205.6352\">10.48550/arXiv.1205.6352</a>.","ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1205.6352\">10.48550/arXiv.1205.6352</a>","apa":"Kolmogorov, V., &#38; Schoenemann, T. (n.d.). Generalized sequential tree-reweighted message passing. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1205.6352\">https://doi.org/10.48550/arXiv.1205.6352</a>","short":"V. Kolmogorov, T. Schoenemann, ArXiv (n.d.)."},"title":"Generalized sequential tree-reweighted message passing","day":"29","publist_id":"3809","date_updated":"2025-07-08T07:19:42Z","date_created":"2018-12-11T12:00:23Z","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"first_name":"Thomas","last_name":"Schoenemann","full_name":"Schoenemann, Thomas"}],"date_published":"2012-05-29T00:00:00Z","oa":1,"month":"05"}]