Approximation bounds for inference using cooperative cut

Jegelka, S.; Bilmes, J.

Local TagsRelease HistoryDetailsSummary

Approximation bounds for inference using cooperative cut

Jegelka, S., & Bilmes, J. (2011). Approximation bounds for inference using cooperative cut. In 28th International Conference on Machine Learning (ICML 2011) (pp. 577-584).

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-75BB-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-5E36-1

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Jegelka, S.¹, Author
Bilmes, J.¹, Author

Affiliations:
1Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society, ou_1497647

Content

show

hide

Free keywords: MPI für Intelligente Systeme; Abt. Schölkopf;

Abstract: We analyze a family of probability distributions that are characterized by an embedded combinatorial structure. This family includes models having arbitrary treewidth and arbitrary sized factors. Unlike general models with such freedom, where the “most probable explanation” (MPE) problem is inapproximable, the combinatorial structure within our model, in particular the indirect use of submodularity, leads to several MPE algorithms that all have approximation guarantees.

Details

show

hide

Language(s):

Dates: Date issued: 2011-07-01

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 596810
URI: http://www.kyb.tuebingen.mpg.de/fileadmin/user_upload/files/publications/2011/ICML-2011-Jegelka.pdf
Other: JegelkaB2011_2

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: 28th International Conference on Machine Learning (ICML 2011)

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: -

Pages: 7 Volume / Issue: - Sequence Number: - Start / End Page: 577 - 584 Identifier: -