License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2020.4
URN: urn:nbn:de:0030-drops-118654
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11865/
Go to the corresponding LIPIcs Volume Portal

Cooper, Martin C. ; de Givry, Simon ; Schiex, Thomas

Graphical Models: Queries, Complexity, Algorithms (Tutorial)

pdf-format:
LIPIcs-STACS-2020-4.pdf (0.6 MB)

Abstract

Graphical models (GMs) define a family of mathematical models aimed at the concise description of multivariate functions using decomposability. We restrict ourselves to functions of discrete variables but try to cover a variety of models that are not always considered as "Graphical Models", ranging from functions with Boolean variables and Boolean co-domain (used in automated reasoning) to functions over finite domain variables and integer or real co-domains (usual in machine learning and statistics). We use a simple algebraic semi-ring based framework for generality, define associated queries, relationships between graphical models, complexity results, and families of algorithms, with their associated guarantees.

BibTeX - Entry

@InProceedings{cooper_et_al:LIPIcs:2020:11865,
  author =	{Martin C. Cooper and Simon de Givry and Thomas Schiex},
  title =	{{Graphical Models: Queries, Complexity, Algorithms (Tutorial)}},
  booktitle =	{37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
  pages =	{4:1--4:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-140-5},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{154},
  editor =	{Christophe Paul and Markus Bl{\"a}ser},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/11865},
  URN =		{urn:nbn:de:0030-drops-118654},
  doi =		{10.4230/LIPIcs.STACS.2020.4},
  annote =	{Keywords: Computational complexity, tree decomposition, graphical models, submodularity, message passing, local consistency, artificial intelligence, valued constraints, optimization}
}

Keywords: Computational complexity, tree decomposition, graphical models, submodularity, message passing, local consistency, artificial intelligence, valued constraints, optimization
Collection: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Issue Date: 2020
Date of publication: 04.03.2020
Supplementary Material: http://github.com/toulbar2/toulbar2

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI