Stable Global Weighting of Flow Mixtures using Simplex Exponential Moving Average
Benjamin Wiriyapong, Oktay Karakus, Can Eyupoglu, Kirill Sidorov
cs.LG, stat.ML
Submitted: 2026-07-04
Code: https://github.com/benjaminsw/AMF-VIJ
License: http://creativecommons.org/licenses/by/4.0/
The gist: Normalising flows provide a powerful variational family for approximate inference, yet individual architectures often fail to generalise across heterogeneous posterior geometries.
Terminology
Abstract
Normalising flows provide a powerful variational family for approximate inference, yet individual architectures often fail to generalise across heterogeneous posterior geometries. We revisit mixture-based flow formulations and introduce AMF-VI-sEMA, a two-stage framework featuring a stable global weighting mechanism based on a Simplex Exponential Moving Average (sEMA) update. In Stage 1, a heterogeneous set of experts (RealNVP, MAF, RBIG) are trained independently to specialise in distinct structural regimes. In Stage 2, expert parameters are frozen and global mixture weights are learned through a temperature-controlled softmax of average log-likelihoods, followed by a smooth EMA update on the probability simplex. This design produces a tractable, data-agnostic gating mechanism (without per-sample gating or gradient backpropagation through weights) that adaptively reallocates capacity while avoiding component collapse. We evaluate the framework on ten posterior benchmarks: six canonical 2D synthetic families (Banana, X-Shaped, Bimodal, Multimodal, Two-moons, Rings) and four real/low-dimensional Bayesian targets (BLR, BPR, Weibull, Real-GMM2), with stronger baselines (NICE, ResFlow, and EM-Mixing). Comprehensive evaluation covers NLL, KL divergence, Wasserstein-2 distance, and MMD, together with diagnostics of mixture dynamics, hyperparameter sensitivity, and cross-seed robustness. Empirically, AMF-VI-sEMA achieves consistent NLL improvements over its predecessor AMF-VI and avoids the catastrophic transport failures of single-flow baselines, while maintaining stable weight trajectories (N eff > 1.4 on all datasets) with minimal computational overhead.
Sources
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks