arXiv Statistics ML

Adaptive mixture variational inference for spike-and-slab regression

The paper introduces an adaptive fitting procedure for mixtures of product distributions in Gaussian regression with a spike‑and‑slab prior, directly minimizing reverse Kullback‑Leibler divergence on inclusion indicators and active coefficients. This method jointly refines component parameters and weights as the mixture grows, avoiding extra divergence penalties on unused latent coefficients. Empirical results on 250 simulated datasets show that mixtures reduce errors in inclusion probabilities, grouped support probabilities, and coefficient covariance compared to multistart mean‑field approaches, and that direct joint refinement outperforms augmented or restricted refinement at fixed mixture size.

arXiv Machine Learning
Jun 19

Variational Consensus Monte Carlo for Bayesian Mixture

arXiv:2606. 19643v1 Announce Type: cross Abstract: Motivated by the privacy, sensitivity and sharing limitations of health data, we present a comprehensive pipeline for inference of Bayesian mixture models within a federated learning setting, i.

By Julie Fendler, Francesca L. Crowe, Tom Marshall, Sylvia Richardson, Paul D. W. Kirk
arXiv Machine Learning
Jun 18

Shrinkage priors for Bayesian Substitute Confounders

arXiv:2606. 18535v1 Announce Type: cross Abstract: Multi-cause observational studies contain information about unmeasured confounding through the dependence structure among causes.

By Yordan P. Raykov, Hengrui Luo, Justin D. Strait, Wasiur R. KhudaBukhsh
arXiv Machine Learning
Jun 9

Dendrograms of Mixing Measures for Softmax-Gated Gaussian Mixture of Experts: Consistency Without Model Sweeps

arXiv:2510. 12744v2 Announce Type: replace-cross Abstract: We develop a unified statistical framework for softmax-gated Gaussian mixture of experts (SGMoE) that addresses three long-standing obstacles in parameter estimation and model selection: (i) non-identifiability of gating parameters up to common translations, (ii) intrinsic gate-expert interactions that induce coupled differential relations in the likelihood, and (iii) the tight numerator-denominator coupling in the softmax-induced conditional density.

By Do Tien Hai, Trung Nguyen Mai, TrungTin Nguyen, Nhat Ho, Binh T. Nguyen, Christopher Drovandi
arXiv Statistics ML
Sep 25

Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances

The paper studies the numerical solution of the Beurling‑LASSO (BLASSO) for estimating Gaussian mixture models (GMMs) with unknown numbers of components and unknown diagonal covariance matrices. It introduces a Conic Particle Gradient Descent (CPGD) algorithm that incorporates Riemannian gradient descent to respect the Fisher‑Rao geometry of Gaussian distributions. The authors provide theoretical convergence guarantees, including exponential local convergence under a non‑degeneracy condition related to component separation, and demonstrate through numerical experiments that CPGD is more robust to overspecification of components than the EM algorithm.

By Romane Giard, Yohann De Castro, Roland Denis, Cl\'ement Marteau