Recent Advancements in Tractable Probabilistic Inference (Dagstuhl Seminar 22161)

Authors Priyank Jaini, Kristian Kersting, Antonio Vergari, Max Welling and all authors of the abstracts in this report

Thumbnail PDF


  • Filesize: 1.6 MB
  • 13 pages

Document Identifiers

Author Details

Priyank Jaini
  • Google - Toronto, CA
Kristian Kersting
  • TU Darmstadt, DE
Antonio Vergari
  • University of Edinburgh, GB
Max Welling
  • University of Amsterdam, NL
and all authors of the abstracts in this report

Cite AsGet BibTex

Priyank Jaini, Kristian Kersting, Antonio Vergari, and Max Welling. Recent Advancements in Tractable Probabilistic Inference (Dagstuhl Seminar 22161). In Dagstuhl Reports, Volume 12, Issue 4, pp. 13-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


In several real-world scenarios, decision making involves advanced reasoning under uncertainty, i.e. the ability to answer probabilistic queries. Typically, it is necessary to compute these answers in a limited amount of time. Moreover, in many domains, such as healthcare and economical decision making, it is crucial that the result of these queries is reliable, i.e. either exact or comes with approximation guarantees. In all these scenarios, tractable probabilistic inference and learning are becoming increasingly important. Research on representations and learning algorithms for tractable inference embraces very different fields, each one contributing its own perspective. These include automated reasoning, probabilistic modeling, statistical and Bayesian inference and deep learning. Among the many recent emerging venues in these fields there are: tractable neural density estimators such as autoregressive models and normalizing flows; deep tractable probabilistic circuits such as sum-product networks and sentential decision diagrams; approximate inference routines with guarantees on the quality of the approximation. Each of these model classes occupies a particular spot in the continuum between tractability and expressiveness. That is, different model classes might offer appealing advantages in terms of efficiency or representation capabilities while trading-off other of these aspects. So far, clear connections and a deeper understanding of the key differences among them have been hindered by the different languages and perspectives adopted by the different "souls" that comprise the tractable probabilistic modeling community. This Dagstuhl Seminar brought together experts from these sub-communities and provided the perfect venue to exchange perspectives, deeply discuss the recent advancements and build strong bridges that can greatly propel interdisciplinary research.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Artificial intelligence
  • Computing methodologies → Machine learning
  • approximate inference with guarantees
  • deep generative models
  • probabilistic circuits
  • Tractable inference


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail