Clusters and coarse partitions in LP relaxations

David Sontag, Amir Globerson, Tommi Jaakkola

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-based LP relaxations enforce joint consistency on the beliefs of a cluster of variables, with computational cost increasing exponentially with the size of the clusters. By partitioning the state space of a cluster and enforcing consistency only across partitions, we obtain a class of constraints which, although less tight, are computationally feasible for large clusters. We show how to solve the cluster selection and partitioning problem monotonically in the dual LP, using the current beliefs to guide these choices. We obtain a dual message passing algorithm and apply it to protein design problems where the variables have large state spaces and the usual cluster-based relaxations are very costly. The resulting method solves many of these problems exactly, and significantly faster than a method that does not use partitioning.

Original languageEnglish (US)
Title of host publicationAdvances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference
Pages1537-1544
Number of pages8
StatePublished - 2009
Event22nd Annual Conference on Neural Information Processing Systems, NIPS 2008 - Vancouver, BC, Canada
Duration: Dec 8 2008Dec 11 2008

Other

Other22nd Annual Conference on Neural Information Processing Systems, NIPS 2008
CountryCanada
CityVancouver, BC
Period12/8/0812/11/08

Fingerprint

Linear programming
Message passing
Proteins
Costs

ASJC Scopus subject areas

  • Information Systems

Cite this

Sontag, D., Globerson, A., & Jaakkola, T. (2009). Clusters and coarse partitions in LP relaxations. In Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference (pp. 1537-1544)

Clusters and coarse partitions in LP relaxations. / Sontag, David; Globerson, Amir; Jaakkola, Tommi.

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference. 2009. p. 1537-1544.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sontag, D, Globerson, A & Jaakkola, T 2009, Clusters and coarse partitions in LP relaxations. in Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference. pp. 1537-1544, 22nd Annual Conference on Neural Information Processing Systems, NIPS 2008, Vancouver, BC, Canada, 12/8/08.
Sontag D, Globerson A, Jaakkola T. Clusters and coarse partitions in LP relaxations. In Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference. 2009. p. 1537-1544
Sontag, David ; Globerson, Amir ; Jaakkola, Tommi. / Clusters and coarse partitions in LP relaxations. Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference. 2009. pp. 1537-1544
@inproceedings{b0c63afdded540568b047a04323d2074,
title = "Clusters and coarse partitions in LP relaxations",
abstract = "We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-based LP relaxations enforce joint consistency on the beliefs of a cluster of variables, with computational cost increasing exponentially with the size of the clusters. By partitioning the state space of a cluster and enforcing consistency only across partitions, we obtain a class of constraints which, although less tight, are computationally feasible for large clusters. We show how to solve the cluster selection and partitioning problem monotonically in the dual LP, using the current beliefs to guide these choices. We obtain a dual message passing algorithm and apply it to protein design problems where the variables have large state spaces and the usual cluster-based relaxations are very costly. The resulting method solves many of these problems exactly, and significantly faster than a method that does not use partitioning.",
author = "David Sontag and Amir Globerson and Tommi Jaakkola",
year = "2009",
language = "English (US)",
isbn = "9781605609492",
pages = "1537--1544",
booktitle = "Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference",

}

TY - GEN

T1 - Clusters and coarse partitions in LP relaxations

AU - Sontag, David

AU - Globerson, Amir

AU - Jaakkola, Tommi

PY - 2009

Y1 - 2009

N2 - We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-based LP relaxations enforce joint consistency on the beliefs of a cluster of variables, with computational cost increasing exponentially with the size of the clusters. By partitioning the state space of a cluster and enforcing consistency only across partitions, we obtain a class of constraints which, although less tight, are computationally feasible for large clusters. We show how to solve the cluster selection and partitioning problem monotonically in the dual LP, using the current beliefs to guide these choices. We obtain a dual message passing algorithm and apply it to protein design problems where the variables have large state spaces and the usual cluster-based relaxations are very costly. The resulting method solves many of these problems exactly, and significantly faster than a method that does not use partitioning.

AB - We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-based LP relaxations enforce joint consistency on the beliefs of a cluster of variables, with computational cost increasing exponentially with the size of the clusters. By partitioning the state space of a cluster and enforcing consistency only across partitions, we obtain a class of constraints which, although less tight, are computationally feasible for large clusters. We show how to solve the cluster selection and partitioning problem monotonically in the dual LP, using the current beliefs to guide these choices. We obtain a dual message passing algorithm and apply it to protein design problems where the variables have large state spaces and the usual cluster-based relaxations are very costly. The resulting method solves many of these problems exactly, and significantly faster than a method that does not use partitioning.

UR - http://www.scopus.com/inward/record.url?scp=80053168886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053168886&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781605609492

SP - 1537

EP - 1544

BT - Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

ER -