Weighted Model Integration (WMI) is a recent and general formalism for reasoning over hybrid continuous/discrete probabilistic models with logical and algebraic constraints. While many works have on inference in WMI models, the challenges of learning them from data have received less attention. Our contribution is twofold. , we provide novel theoretical insights on the problem of estimating the parameters of these models from data in a tractable way, generalizing previous results on maximum-likelihood estimation (MLE) to the broader family of log-linear WMI models. Second, we show how our results on WMI can characterize the tractability of inference and MLE for another widely used class of probabilistic models, Hinge Loss Markov Random Fields (HLMRFs). Specifically, we bridge these two areas of research by reducing marginal inference in HLMRFs to WMI inference, and thus we open up new interesting applications for both model classes.

@inproceedings{ZengTPM21,
  author    = {Zeng, Zhe and Morettin, Paolo and Yan, Fanqi and Vergari, Antonio and Van den Broeck, Guy},
  title     = {Is Parameter Learning via Weighted Model Integration Tractable?},
  booktitle = {Proceedings of the UAI Workshop on Tractable Probabilistic Modeling (TPM)},
  month     = 7,
  year      = {2021},
  url       = "http://starai.cs.ucla.edu/papers/ZengTPM21.pdf",
  keywords  = {workshop}
}