Probabilistic modeling has become the de facto framework to reason about uncertainty in Machine Learning and AI. One of the main challenges in probabilistic modeling is the trade-off between the expressivity of the models and the complexity of performing various types of inference, as well as learning them from data.
This inherent trade-off is clearly visible in powerful -- but intractable -- models like Markov random fields, (restricted) Boltzmann machines, (hierarchical) Dirichlet processes and Variational Autoencoders. Despite these models’ recent successes, performing inference on them resorts to approximate routines. Moreover, learning such models from data is generally harder as inference is a sub-routine of learning, requiring simplifying assumptions or further approximations. Having guarantees on tractability at inference and learning time is then a highly desired property in many real-world scenarios.
Tractable probabilistic modeling (TPM) concerns methods guaranteeing exactly this: performing exact (or tractably approximate) inference and/or learning. To achieve this, the following approaches have been proposed: i) low or bounded-treewidth probabilistic graphical models and determinantal point processes, that exchange expressiveness for efficiency; ii) graphical models with high girth or weak potentials, that provide bounds on the performance of approximate inference methods; and iii) exchangeable probabilistic models that exploit symmetries to reduce inference complexity. More recently, models compiling inference routines into efficient computational graphs such as arithmetic circuits, sum-product networks, cutset networks and probabilistic sentential decision diagrams have advanced the state-of-the-art inference performance by exploiting context-specific independence, determinism or by exploiting latent variables. TPMs have been successfully used in numerous real-world applications: image classification, completion and generation, scene understanding, activity recognition, language and speech modeling, bioinformatics, collaborative filtering, verification and diagnosis of physical systems.
The aim of this workshop is to bring together researchers working on the different fronts of tractable probabilistic modeling, highlighting recent trends and open challenges. At the same time, we want to foster the discussion across similar or complementary sub-fields in the broader probabilistic modeling community. In particular, the rising field of neural probabilistic models, such as normalizing flows and autoregressive models that achieve impressive results in generative modeling. It is an interesting open challenge for the TPM community to keep a broad range of inference routines tractable while leveraging these models’ expressiveness. Furthermore, the rising field of probabilistic programming promises to be the new lingua franca of model-based learning. This offers the TPM community opportunities to push the expressiveness of the models used for general-purpose universal probabilistic languages, such as Pyro, while maintaining efficiency.
We want to promote discussions and advance the field both by having high quality contributed works, as well as high level invited speakers coming from the aforementioned tangent sub-fields of probabilistic modeling.
|09:00 AM||Welcome (Talk)|
|09:10 AM||Testing Arithmetic Circuits (Talk) Video »||Adnan Darwiche|
|09:50 AM||Poster spotlights (Spotlights)|
|10:30 AM||Coffee Break (Break)|
|11:00 AM||Tractable Islands Revisited (Talk) Video »||Rina Dechter|
|11:40 AM||Poster spotlights (Spotlights)|
|12:00 PM||Sum-Product Networks and Deep Learning: A Love Marriage (Talk) Video »||Robert Peharz|
|12:40 PM||Lunch (Break)|
|02:20 PM||Tensor Variable Elimination in Pyro (Talk) Video »||Eli Bingham|
|03:00 PM||Coffee Break (Break)|
|03:30 PM||Invertible Residual Networks and a Novel Perspective on Adversarial Examples (Talk) Video »||Jörn Jacobsen|
|04:10 PM||Poster session (Posters)|
Pedro Domingos (University of Washington)
Daniel Lowd (University of Oregon)
Tahrima Rahman (University of Texas at Dallas)
Antonio Vergari (Max-Planck Institute for Intelligent Systems)
Alejandro Molina (TU Darmstadt)
Antonio Vergari (University of California, Los Angeles)
More from the Same Authors
2019 Poster: Look Ma, No Latent Variables: Accurate Cutset Networks via Compilation »
Tahrima Rahman · Shasha Jin · Vibhav Gogate
2019 Oral: Look Ma, No Latent Variables: Accurate Cutset Networks via Compilation »
Tahrima Rahman · Shasha Jin · Vibhav Gogate
2017 Workshop: Principled Approaches to Deep Learning »
Andrzej Pronobis · Robert Gens · Sham Kakade · Pedro Domingos