🤖 AI Summary
Generalized variational inference suffers from tight coupling between modeling and optimization, hindering modularity and composability.
Method: We propose the first composable, unified framework for variational inference. Leveraging a newly discovered chain rule—akin to reverse-mode automatic differentiation—that governs the interplay between Bayesian inference and variational objectives, we design composable operators that decouple model structure, inverse modeling, local loss binding, and parameter exposure. Further, we introduce a statistical game-theoretic perspective to enable localized optimization.
Contribution/Results: Experiments across canonical Bayesian models demonstrate that our framework significantly improves modularity, interpretability, and construction efficiency of variational inference. It supports flexible, plug-and-play assembly of arbitrary subcomponents and end-to-end optimization, establishing a novel paradigm for complex probabilistic modeling.
📝 Abstract
We introduce a new compositional framework for generalized variational inference, clarifying the different parts of a model, how they interact, and how they compose. We explain that both exact Bayesian inference and the loss functions typical of variational inference (such as variational free energy and its generalizations) satisfy chain rules akin to that of reverse-mode automatic differentiation, and we advocate for exploiting this to build and optimize models accordingly. To this end, we construct a series of compositional tools: for building models; for constructing their inversions; for attaching local loss functions; and for exposing parameters. Finally, we explain how the resulting parameterized statistical games may be optimized locally, too. We illustrate our framework with a number of classic examples, pointing to new areas of extensibility that are revealed.