{"conference":{"name":"ICML: International Conference on Machine Learning"},"date_created":"2018-12-11T12:02:00Z","date_updated":"2021-01-12T07:41:47Z","month":"01","publisher":"Omnipress","title":"Dynamic tree block coordinate ascent","status":"public","page":"113 - 120","publication_status":"published","day":"01","main_file_link":[{"url":"http://ttic.uchicago.edu/~dbatra/publications/assets/tbkk_icml11.pdf","open_access":"0"}],"year":"2011","quality_controlled":0,"date_published":"2011-01-01T00:00:00Z","extern":1,"citation":{"chicago":"Tarlow, Daniel, Druv Batra, Pushmeet Kohli, and Vladimir Kolmogorov. “Dynamic Tree Block Coordinate Ascent,” 113–20. Omnipress, 2011.","apa":"Tarlow, D., Batra, D., Kohli, P., &#38; Kolmogorov, V. (2011). Dynamic tree block coordinate ascent (pp. 113–120). Presented at the ICML: International Conference on Machine Learning, Omnipress.","short":"D. Tarlow, D. Batra, P. Kohli, V. Kolmogorov, in:, Omnipress, 2011, pp. 113–120.","mla":"Tarlow, Daniel, et al. <i>Dynamic Tree Block Coordinate Ascent</i>. Omnipress, 2011, pp. 113–20.","ista":"Tarlow D, Batra D, Kohli P, Kolmogorov V. 2011. Dynamic tree block coordinate ascent. ICML: International Conference on Machine Learning, 113–120.","ieee":"D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov, “Dynamic tree block coordinate ascent,” presented at the ICML: International Conference on Machine Learning, 2011, pp. 113–120.","ama":"Tarlow D, Batra D, Kohli P, Kolmogorov V. Dynamic tree block coordinate ascent. In: Omnipress; 2011:113-120."},"publist_id":"3475","abstract":[{"text":"This paper proposes a novel Linear Programming (LP) based algorithm, called Dynamic Tree-Block Coordinate Ascent (DT-BCA), for performing maximum a posteriori (MAP) inference in probabilistic graphical models. Unlike traditional message passing algorithms, which operate uniformly on the whole factor graph, our method dynamically chooses regions of the factor graph on which to focus message-passing efforts. We propose two criteria for selecting regions, including an efficiently computable upper-bound on the increase in the objective possible by passing messages in any particular region. This bound is derived from the theory of primal-dual methods from combinatorial optimization, and the forest that maximizes the bounds can be chosen efficiently using a maximum-spanning-tree-like algorithm. Experimental results show that our dynamic schedules significantly speed up state-of-the-art LP-based message-passing algorithms on a wide variety of real-world problems.","lang":"eng"}],"author":[{"first_name":"Daniel","full_name":"Tarlow, Daniel","last_name":"Tarlow"},{"last_name":"Batra","full_name":"Batra, Druv","first_name":"Druv"},{"last_name":"Kohli","full_name":"Kohli, Pushmeet","first_name":"Pushmeet"},{"first_name":"Vladimir","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","_id":"3205"}