Variational Flow Graphical Model
Shaogang Ren, Belhal Karimi, Dingcheng Li, Ping Li
Abstract
This paper introduces a novel approach to embed flow-based models with hierarchical structures. The proposed framework is named Variational Flow Graphical (VFG) Model. VFGs learn the representation of high dimensional data via a message-passing scheme by integrating flowbased functions through variational inference. By leveraging the expressive power of neural networks, VFGs produce a representation of the data using a lower dimension, thus overcoming the drawbacks of many flow-based models, usually requiring a high dimensional latent space involving many trivial variables. Aggregation nodes are introduced in the VFG models to integrate forward-backward hierarchical information via a message passing scheme. Maximizing the evidence lower bound (ELBO) of data likelihood aligns the forward and backward messages in each aggregation node achieving a consistency node state. Algorithms have been developed to learn model parameters through gradient updating regarding the ELBO objective. The consistency of aggregation nodes enable VFGs to be applicable in tractable inference on graphical structures. Besides representation learning and numerical inference, VFGs provide a new approach for distribution modeling on datasets with graphical latent structures. Additionally, theoretical study shows that VFGs are universal approximators by leveraging the implicitly invertible flow-based structures. With flexible graphical structures and superior excessive power, VFGs could potentially be used to improve probabilistic inference. In the experiments, VFGs achieves improved evidence lower bound (ELBO) and likelihood values on multiple datasets. We also highlight the benefits of our VFG model on missing entry imputation for datasets with graph structures. Multiple experiments on synthetic and real-world datasets confirm the benefits of the proposed method and potentially broad applications.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 044fd9ee-77de-4c51-9357-a7b83b3c468fBuilds on6
- Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)Peter Sorrenson, Carsten Rother, Ullrich KötheICLR 2020 · 132 citations
- Coupling-based Invertible Neural Networks Are Universal Diffeomorphism ApproximatorsTakeshi Teshima, Isao Ishikawa, Koichi Tojo, Kenta Oono et al.NeurIPS 2020 · 129 citations
- Learning Energy-Based Generative Models via Coarse-to-Fine Expanding and SamplingYang Zhao, Jianwen Xie, Ping LiICLR 2021 · 51 citations
- Meta-CoTGAN: A Meta Cooperative Training Paradigm for Improving Adversarial Text GenerationHaiyan Yin, Dingcheng Li, Xu Li, Ping LiAAAI 2020 · 24 citations
- Estimate the Implicit Likelihoods of GANs with Application to Anomaly DetectionShaogang Ren, Dingcheng Li, Zhixin Zhou, Ping LiWWW 2020 · 11 citations
Related papers
- Graph Stochastic Neural Networks for Semi-supervised LearningHaibo Wang, Chuan Zhou, Xin Chen, Jia Wu et al.NeurIPS 2020 · 44 citations
- Identifying through Flows for Recovering Latent RepresentationsShen Li, Bryan Hooi, Gim Hee LeeICLR 2020 · 15 citations
- Learning Hierarchical Features with Joint Latent Space Energy-Based PriorJiali Cui, Ying Nian Wu, Tian HanICCV 2023 · 11 citations
- MCMC Should Mix: Learning Energy-Based Model with Neural Transport Latent Space MCMCErik Nijkamp, Ruiqi Gao, Pavel Sountsov, Srinivas Vasudevan et al.ICLR 2022 · 25 citations
- Structured Flow Autoencoders: Learning Structured Probabilistic Representations with Flow MatchingYidan Xu, Yixin Wang, XuanLong NguyenICLR 2026
