Tree block coordinate descent for map in graphical models
abstract URL: http://jmlr.csail.mit.edu/proceedings/papers/v5/sontag09a.html
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Journal of Machine Learning Research
2011
|
| Online Access: | http://hdl.handle.net/1721.1/63118 https://orcid.org/0000-0002-2199-0379 |
| _version_ | 1826189663498403840 |
|---|---|
| author | Sontag, David Alexander Jaakkola, Tommi S. |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Sontag, David Alexander Jaakkola, Tommi S. |
| author_sort | Sontag, David Alexander |
| collection | MIT |
| description | abstract URL: http://jmlr.csail.mit.edu/proceedings/papers/v5/sontag09a.html |
| first_indexed | 2024-09-23T08:19:10Z |
| format | Article |
| id | mit-1721.1/63118 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:19:10Z |
| publishDate | 2011 |
| publisher | Journal of Machine Learning Research |
| record_format | dspace |
| spelling | mit-1721.1/631182022-09-23T12:16:07Z Tree block coordinate descent for map in graphical models Sontag, David Alexander Jaakkola, Tommi S. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Jaakkola, Tommi S. Jaakkola, Tommi S. Sontag, David Alexander abstract URL: http://jmlr.csail.mit.edu/proceedings/papers/v5/sontag09a.html A number of linear programming relaxations have been proposed for finding most likely settings of the variables (MAP) in large probabilistic models. The relaxations are often succinctly expressed in the dual and reduce to different types of reparameterizations of the original model. The dual objectives are typically solved by performing local block coordinate descent steps. In this work, we show how to perform block coordinate descent on spanning trees of the graphical model. We also show how all of the earlier dual algorithms are related to each other, giving transformations from one type of reparameterization to another while maintaining monotonicity relative to a common objective function. Finally, we quantify when the MAP solution can and cannot be decoded directly from the dual LP relaxation. 2011-05-25T19:13:22Z 2011-05-25T19:13:22Z 2009-04 Article http://purl.org/eprint/type/ConferencePaper http://hdl.handle.net/1721.1/63118 "Tree block coordinate descent for map in graphical models." Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics April 16-18, 2009, Clearwater Beach, Florida USA. https://orcid.org/0000-0002-2199-0379 en_US http://jmlr.csail.mit.edu/proceedings/papers/v5/sontag09a/sontag09a.pdf Proceedings of the 12th International Conference on Artifcial Intelligence and Statistics (AISTATS) 2009 Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Journal of Machine Learning Research MIT web domain |
| spellingShingle | Sontag, David Alexander Jaakkola, Tommi S. Tree block coordinate descent for map in graphical models |
| title | Tree block coordinate descent for map in graphical models |
| title_full | Tree block coordinate descent for map in graphical models |
| title_fullStr | Tree block coordinate descent for map in graphical models |
| title_full_unstemmed | Tree block coordinate descent for map in graphical models |
| title_short | Tree block coordinate descent for map in graphical models |
| title_sort | tree block coordinate descent for map in graphical models |
| url | http://hdl.handle.net/1721.1/63118 https://orcid.org/0000-0002-2199-0379 |
| work_keys_str_mv | AT sontagdavidalexander treeblockcoordinatedescentformapingraphicalmodels AT jaakkolatommis treeblockcoordinatedescentformapingraphicalmodels |