Enhancing SMT-based Weighted Model Integration by Structure Awareness
This work addresses the scalability problem in probabilistic inference for hybrid domains, which is crucial for applications like verifying fairness in probabilistic programs, though it appears incremental as it builds on existing WMI and SMT techniques.
The paper tackled the challenge of scaling Weighted Model Integration (WMI) for probabilistic inference in hybrid domains by developing an algorithm that combines SMT-based enumeration with structure-aware encoding, resulting in drastic computational savings and expanding the set of solvable problems.
The development of efficient exact and approximate algorithms for probabilistic inference is a long-standing goal of artificial intelligence research. Whereas substantial progress has been made in dealing with purely discrete or purely continuous domains, adapting the developed solutions to tackle hybrid domains, characterised by discrete and continuous variables and their relationships, is highly non-trivial. Weighted Model Integration (WMI) recently emerged as a unifying formalism for probabilistic inference in hybrid domains. Despite a considerable amount of recent work, allowing WMI algorithms to scale with the complexity of the hybrid problem is still a challenge. In this paper we highlight some substantial limitations of existing state-of-the-art solutions, and develop an algorithm that combines SMT-based enumeration, an efficient technique in formal verification, with an effective encoding of the problem structure. This allows our algorithm to avoid generating redundant models, resulting in drastic computational savings. Additionally, we show how SMT-based approaches can seamlessly deal with different integration techniques, both exact and approximate, significantly expanding the set of problems that can be tackled by WMI technology. An extensive experimental evaluation on both synthetic and real-world datasets confirms the substantial advantage of the proposed solution over existing alternatives. The application potential of this technology is further showcased on a prototypical task aimed at verifying the fairness of probabilistic programs.