Skip to content

Stable Global Weighting of Flow Mixtures using Simplex Exponential Moving Average

Jul 2026 · arXiv.org · Vol abs/2607.03809 · 0 citations · 17 references
Computer Science Mathematics

TL;DR

Comprehensive evaluation covers NLL, KL divergence, Wasserstein-2 distance, and MMD, together with diagnostics of mixture dynamics, hyperparameter sensitivity, and cross-seed robustness.

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 \emph{AMF\mbox{-}VI\mbox{-}sEMA}, a two-stage framework featuring a \emph{stable global weighting} mechanism based on a \emph{Simplex Exponential Moving Average} (sEMA) update. In Stage~1, a heterogeneous set of experts (\textsc{RealNVP}, \textsc{MAF}, \textsc{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 (\textsc{NICE}, \textsc{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, \emph{AMF\mbox{-}VI\mbox{-}sEMA} achieves consistent NLL improvements over its predecessor \emph{AMF\mbox{-}VI} and avoids the catastrophic transport failures of single-flow baselines, while maintaining stable weight trajectories ($N_{\mathrm{eff}}{>}1.4$ on all datasets) with minimal computational overhead.

View source

Similar papers

#machine learning Preprint Sep 2026

Variational Mixtures and Multi-Marginal Flow Matching: Advancing Statistical Inference with Biological Applications

In this thesis I develop methods for statistical inference when the distributions arising from complex biological systems are multi-modal, geometrically structured, and sometimes only defined up to a normalizing constant. I start from variational inference and, when analytic update equations are unavailable, move to bl...

Oskar Kviman · 0 citations
#machine learning Preprint Sep 2026

No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels

Finite-Library Input-Warped Bayesian Optimization (FLIWBO), which selects warps from a finite library of smooth input maps by any history-dependent rule, and adapts the input geometry to accelerate learning while retaining high-probability convergence guarantees under mild hypotheses, with an explicit library-size cost...

Edvin Ketabati Augustinsson, Robert A. Bridges · 0 citations
#machine learning Preprint Oct 2026

Optimal Momentum Methods for Stochastic Multilevel Compositional Optimization

A momentum-based estimator with mini-batches is employed to track the function values of each level, which are subsequently used to construct momentum gradient estimators, and a batch-free method that incorporates a first-order approximation and a clipping technique for function value estimation is developed.

Wei Jiang, Rui Yan, Si-Fan Yang et al. · 0 citations

Gradient Estimation for Mixture Variational Inference

This work provides an elementary derivation of a single-sample post-stratified estimator—previously derived via transport equations—and proves a variance reduction relative to simple random sampling, expanding the applicability of implicit reparameterization and reducing its computational complexity.

Javier Burroni, Daniel Sheldon · 0 citations
#machine learning Preprint Oct 2026

Smoothing the Top-k Exposure Boundary for Sparse Mixture-of-Experts

Sparse Mixture-of-Experts models scale parameter capacity efficiently while maintaining a fixed compute budget per token. However, traditional training paradigms enforce a static choice of top-$k$ experts, which converts a continuous routing distribution into a rigid step function. This constraint introduces a brittle...

Yun-Kai Chai, Tong Zhu, Xiaoye Qu et al. · 0 citations
#machine learning Preprint Oct 2026

Adaptive Mean Estimation by In-Context Learning: A Gradient-Flow Analysis

Prior Fitted Networks (PFNs) such as TabPFN now rival established statistical procedures across prediction and estimation tasks. A natural explanation is that PFNs have the property of statistical adaptivity, that is, they perform nearly as well as a method tailored to the true data-generating model for a heterogeneous...

Martin Eppert, K. Balasubramanian, Subhro Ghosh et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.