[{"publication_identifier":{"issn":["1063-6919"],"isbn":["9798350301298"]},"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2010.09567"}],"citation":{"mla":"Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.” <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, vol. 2023, IEEE, 2023, pp. 11980–89, doi:<a href=\"https://doi.org/10.1109/CVPR52729.2023.01153\">10.1109/CVPR52729.2023.01153</a>.","ista":"Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2023, 11980–11989.","ama":"Kolmogorov V. Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. In: <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>. Vol 2023. IEEE; 2023:11980-11989. doi:<a href=\"https://doi.org/10.1109/CVPR52729.2023.01153\">10.1109/CVPR52729.2023.01153</a>","ieee":"V. Kolmogorov, “Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions,” in <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Vancouver, Canada, 2023, vol. 2023, pp. 11980–11989.","apa":"Kolmogorov, V. (2023). Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions. In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i> (Vol. 2023, pp. 11980–11989). Vancouver, Canada: IEEE. <a href=\"https://doi.org/10.1109/CVPR52729.2023.01153\">https://doi.org/10.1109/CVPR52729.2023.01153</a>","short":"V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 11980–11989.","chicago":"Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.” In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, 2023:11980–89. IEEE, 2023. <a href=\"https://doi.org/10.1109/CVPR52729.2023.01153\">https://doi.org/10.1109/CVPR52729.2023.01153</a>."},"quality_controlled":"1","type":"conference","department":[{"_id":"VlKo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2023-08-22T00:00:00Z","year":"2023","day":"22","publisher":"IEEE","_id":"14448","author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"article_processing_charge":"No","status":"public","volume":2023,"arxiv":1,"conference":{"location":"Vancouver, Canada","end_date":"2023-06-24","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2023-06-17"},"date_created":"2023-10-22T22:01:16Z","publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","page":"11980-11989","month":"08","isi":1,"corr_author":"1","intvolume":"      2023","oa":1,"language":[{"iso":"eng"}],"oa_version":"Preprint","scopus_import":"1","publication_status":"published","date_updated":"2025-09-09T13:09:58Z","title":"Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions","abstract":[{"lang":"eng","text":"We consider the problem of solving LP relaxations of MAP-MRF inference problems, and in particular the method proposed recently in [16], [35]. As a key computational subroutine, it uses a variant of the Frank-Wolfe (FW) method to minimize a smooth convex function over a combinatorial polytope. We propose an efficient implementation of this subroutine based on in-face Frank-Wolfe directions, introduced in [4] in a different context. More generally, we define an abstract data structure for a combinatorial subproblem that enables in-face FW directions, and describe its specialization for tree-structured MAP-MRF inference subproblems. Experimental results indicate that the resulting method is the current state-of-art LP solver for some classes of problems. Our code is available at pub.ist.ac.at/~vnk/papers/IN-FACE-FW.html."}],"external_id":{"arxiv":["2010.09567"],"isi":["001062522104029"]},"doi":"10.1109/CVPR52729.2023.01153"}]