Approximation bounds for inference using cooperative cut

Jegelka, S.; Bilmes, J.

Lokale TagsFreigabegeschichteDetailsÜbersicht

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 Freigegeben

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:

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

Genre: Konferenzbeitrag

ausblenden:

Urheber:
Jegelka, S.¹, Autor
Bilmes, J.¹, Autor

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

Inhalt

einblenden:

ausblenden:

Schlagwörter: MPI für Intelligente Systeme; Abt. Schölkopf;

Zusammenfassung: 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.