The paper uses Gaussian mixture models for Bayesian networks and proposes an optimization algorithm.
problem Modeling nodes in Bayesian networks with complex distributions.
method Gaussian mixture models combined with double iteration algorithm.
result The double iteration algorithm optimizes Gaussian mixture models effectively.
Bayesian algorithm filters Gaussian mixtures efficiently.
problem State-space systems with Gaussian mixtures.
method Gaussian mixture reduction and square-root implementation.
result Efficient state estimation for non-linear systems.
Bayesian approach approximates probability functions of Gaussian mixtures.
problem Approximating probability functions of non-spherical Gaussian mixtures.
method Bayesian decomposition, spherical radial decomposition, random sampling.
result Established differentiability and integral representation of gradient for probability functions.
The parsimonious Gaussian mixture models, which exploit an eigenvalue decomposition of the group covariance matrices of the Gaussian mixture, have shown their success in particular in cluster analysis. Their estimation is in general performed by maximum likelihood estimation and has also been considered from a parametr…
New method for summarizing Bayesian mixture models using sliced Wasserstein distances.
problem Estimating the mixing measure in nonparametric Bayesian mixture models.
method Decision-theoretic approach using sliced Wasserstein distances for Gaussian mixtures.
result Effective estimation of the mixing measure and mixture density.
Posterior regularization enhances Bayesian hierarchical mixture clustering by improving node separation.
problem High nodal variance in BHMC trees, leading to weak separation between nodes at higher levels.
method Employing Posterior Regularization to impose max-margin constraints on nodes at every level.
result Improves cluster separation in BHMC models, enhancing overall model performance.
Bayesian moment matching improves online and distributed Gaussian mixture model learning.
problem Efficiently learning Gaussian mixture models from streaming data distributed across processors.
method Bayesian moment matching for online and distributed EM algorithm.
result Bayesian moment matching outperforms online EM in time and accuracy.
Survey on Bayesian inference for Gaussian mixture models.
problem Estimating parameters of Gaussian mixture models using Bayesian methods.
method Uses Bayesian inference to estimate parameters and uncertainty of Gaussian mixture models.
result Bayesian approach provides point estimates and associated uncertainty for mixture model parameters.
Paper proposes a VB method for TS-SBP mixture models with reduced computational cost.
problem Efficiently learning tree-structured stick-breaking process mixture models.
method Utilizes Bayes coding algorithm for context tree models to calculate sums over all possible trees.
result Proposes a learning algorithm with less computational cost for TS-SBP mixture of Gaussians.
Bayesian model averaging improves causal effect estimation by averaging over multiple models.
problem Estimating causal effects under linear Structural Causal Models (SCMs).
method Bayesian model averaging using Gaussian scale mixture distributions for computational efficiency.
result Bayesian model averaging is optimal for causal effect estimation.
Improved VB algorithm for NIG mixtures outperforms Gaussian mixtures for non-Gaussian data.
problem Clustering non-Gaussian data, especially heavy-tailed and asymmetric.
method Proposed an improved VB algorithm for NIG mixture models and extended Dirichlet process mixture models.
result Outperforms Gaussian mixtures and existing NIG mixture models, especially for highly non-normative data.
AutoGMM automates Gaussian mixture modeling in Python.
problem Automatic clustering of complex data with uncertainty-aware grouping.
method Strategic initialization using an agglomerative Mahalanobis heuristic, parallelized model selection by information criteria.
result Strong out-of-the-box performance on classic benchmarks and real datasets.
The paper develops efficient algorithms for variational inference with mixtures of isotropic Gaussians.
problem Efficiently approximating multimodal Bayesian posteriors.
method Develops a variational framework and efficient algorithms for mixtures of isotropic Gaussians.
result The approach provides accurate approximations of multimodal Bayesian posteriors while being memory and computationally efficient.
Proposes a sparse classifier for discriminative Gaussian Mixture Models.
problem Softmax-based discriminative models assume unimodality, leading to parameter redundancy.
method Sparse Bayesian learning for GMM-based discriminative model, reducing parameters and complexity.
result The SDGM outperforms existing softmax-based discriminative models.
Method for initializing Gaussian mixtures for variational inference with multi-modal distributions.
problem Challenges in variational inference with Gaussian mixtures due to multimodality and nonconvex loss functions.
method Optimization to find local maxima, local Gaussian approximations, and constrained least squares regression.
result Robust initialization improves variational inference performance and scalability.
New method clusters longitudinal data with many time points.
problem Clustering longitudinal data with many time points.
method Extension of the mixture of common factor analyzers model with expectation-maximization algorithm for parameter estimation and Bayesian information criterion for model selection.
result The approach effectively clusters longitudinal data with many time points.
Proposes GPHMEs using Gaussian processes for hierarchical expert models.
problem Hierarchical mixtures of experts with complex gating functions.
method Gaussian process-gated hierarchical mixtures of experts (GPHMEs) with non-linear gating and expert functions.
result Outperforms tree-based HMEs and achieves good performance with reduced complexity.
New algorithm speeds up sampling from complex Bayesian mixture models.
problem Sampling from non-log-concave, multi-modal posterior distributions in Bayesian Gaussian mixtures.
method Introduced Reflected Metropolis-Hastings Random Walk (RMRW) algorithm.
result Proved mixing time bound for RMRW in symmetric two-component Gaussian mixtures.
Extends Gaussian Process regression for handling multiple prior distributions.
problem Handling multiple prior distributions in Bayesian Machine Learning models.
method Mixtures of Gaussian Processes with analytical and Sparse Variational approaches.
result Effective in accounting for prior misspecification in functional regression problems.
Paper introduces deep structured mixtures of Gaussian processes for scalable GP approximations.
problem Scalability issues with Gaussian Processes (GPs).
method Deep structured mixtures of GP experts for scalable approximate inference.
result Deep structured mixtures provide better predictive uncertainties and competitive performance.
Bayesian nonparametric models improve multi-armed bandit performance with uncertain rewards.
problem Reward model uncertainty in multi-armed bandits.
method Bayesian nonparametric Gaussian mixture models for flexible reward density estimation.
result Achieves successful regret performance with asymptotic regret bound.
Bayesian variational models improve on ML for Gamma and inverse-Gamma mixture components in MRI analysis.
problem Efficiently segmenting and analyzing medical images with Gamma or inverse-Gamma distributed components.
method Developed a fully analytical Variational Bayes (VB) learning framework for Gamma and inverse-Gamma mixture components.
result Variational Gaussian/inverse-Gamma mixture model is the most robust and cost-effective for MRI analysis.
LDDP models space-time dependencies in DP using Gaussian processes.
problem Lack of dependency information in basic DP models for spatial and temporal data.
method Developed location dependent Dirichlet processes (LDDP) integrating Gaussian processes.
result Demonstrated effectiveness on image segmentation task.
GPMM recovers latent signals from noisy mixtures using Bayesian inference.
problem Recovering latent signals from noisy mixed measurements.
method Gaussian process mixture of measurements (GPMM) with Bayesian inference.
result GPMM outperforms standard GP in signal recovery.
This paper analyzes MFVBI for GMM using statistical mechanics.
problem Approximate fast computation of Gaussian Mixture Model.
method Statistical mechanics and MFVBI applied to GMM.
result Rigorous analysis and mathematical foundation for MFVBI applied to GMM.
Paper proposes a new MIMO detection algorithm using Gaussian Mixture Expectation Propagation.
problem Challenges in MIMO detection due to interference and noise in high-order high-dimensional systems.
method The approach uses a Gaussian Mixture Model (GMM) approximation for Belief Propagation (BP) and Expectation Propagation (EP) messages to improve detection accuracy.
result The proposed algorithm outperforms state-of-the-art detection algorithms while maintaining low computational complexity.
In this paper we propose a novel framework for the construction of sparsity-inducing priors. In particular, we define such priors as a mixture of exponential power distributions with a generalized inverse Gaussian density (EP-GIG). EP-GIG is a variant of generalized hyperbolic distributions, and the special cases inclu…
Efficiently marginalizes over Gaussian Process kernels for better model flexibility and uncertainty.
problem Inefficient marginalization over Gaussian Process kernels for large datasets.
method Bayesian Quadrature scheme with maximum mean discrepancies and invariances between Spectral Mixture kernels.
result Achieves more accurate predictions and better calibrated uncertainty than state-of-the-art baselines.
A novel optimization-based Gaussian mixture reduction method using composite transportation divergence.
problem Exponential increase in Gaussian mixture order leads to intractable inference.
method Optimization-based Gaussian mixture reduction (GMR) using composite transportation divergence (CTD).
result Unified framework for selecting optimal cost function in various applications.
The classical mixture of Gaussians model is related to K-means via small-variance asymptotics: as the covariances of the Gaussians tend to zero, the negative log-likelihood of the mixture of Gaussians model approaches the K-means objective, and the EM algorithm approaches the K-means algorithm. Kulis & Jordan (2012) us…
New algorithm improves mixing in Bayesian mixture models.
problem Slow mixing in Bayesian mixture models.
method A new Monte Carlo algorithm for sampling from the marginal posterior of a general integrable mixture.
result The new algorithm achieves excellent mixing times, outperforming standard Gibbs sampling in some cases.
Study how depth affects inference in deep Bayesian neural networks.
problem Understanding how depth impacts inference in overparameterized linear Bayesian neural networks.
method Interpreting finite deep linear Bayesian neural networks as scale mixtures of Gaussian process predictors.
result Advances analytical understanding of how depth affects inference in a simple class of Bayesian neural networks.
A new unsupervised method separates speech sources without requiring labeled data.
problem Lack of supervised data for effective neural source separation.
method Uses a complex Gaussian mixture model (cGMM) for joint training of separation and localization networks.
result The method outperforms conventional initialization methods in monaural and multichannel separation.
Recently developed techniques have made it possible to quickly learn accurate probability density functions from data in low-dimensional continuous space. In particular, mixtures of Gaussians can be fitted to data very quickly using an accelerated EM algorithm that employs multiresolution kd-trees (Moore, 1999). In thi…
ECM algorithm estimates graphical models efficiently in high dimensions.
problem Bayesian graphical models in high-dimensional settings are computationally infeasible.
method ECM algorithm using mixture priors for posterior exploration.
result ECM approach enables fast posterior exploration and incorporates multiple sources of information.
Bayesian method identifies causal DAG structure from non-Gaussian errors.
problem Learning causal structure from non-Gaussian errors in Bayesian networks.
method Bayesian hierarchical model with DAG prior for non-Gaussian errors.
result Posterior DAG selection consistency achieved under mild assumptions.
Paper calculates the benefit of unlabeled data in semi-supervised learning for Gaussian mixtures.
problem Improving performance in semi-supervised learning with unlabeled data.
method Analytical computation of Bayes risk gap between supervised and semi-supervised approaches for Gaussian mixture models.
result Quantifies the accuracy increase due to unlabeled data in a Bayesian setting.
Bayesian neural networks with dependent weights converge to Gaussian mixtures.
problem Limitations of standard Gaussian priors in neural networks.
method Posterior analysis with Gaussian likelihood for networks with dependent weights.
result Posterior distribution identified in the wide-width limit, ensuring invertibility of random covariance matrix.
In order to cluster or partition data, we often use Expectation-and-Maximization (EM) or Variational approximation with a Gaussian Mixture Model (GMM), which is a parametric probability density function represented as a weighted sum of K^ Gaussian component densities. However, model selection to find underlying …
Bayesian nonparametric method segments multi-sequence time series data.
problem Temporal segmentation of multi-sequence time series data into stationary segments.
method Gaussian process priors and nonparametric distribution for segment partitioning.
result Model effectively segments synthetic and real-time series data.
This work provides guaranteed bounds on the total variation distance for univariate mixtures.
problem Lack of closed-form expressions for total variation distance between mixtures.
method Two methods: information monotonicity for lower bounds and geometric envelopes for upper bounds.
result Demonstrated tightness of bounds on Gaussian, Gamma, and Rayleigh mixtures.
The paper proves variational Bayes methods are statistically optimal under certain conditions.
problem Justification of variational Bayes methods for parameter estimation.
method General conditions for optimal risk bounds in mean-field variational Bayesian inference.
result Optimal risk bounds for variational Bayes estimates are achievable under specific conditions.
The speed of convergence of the Expectation Maximization (EM) algorithm for Gaussian mixture model fitting is known to be dependent on the amount of overlap among the mixture components. In this paper, we study the impact of mixing coefficients on the convergence of EM. We show that when the mixture components exhibit …
A new method for anomaly detection using random subspaces and Gaussian mixture models.
problem Anomaly detection in high-dimensional data.
method Statistical estimation of probability density using random subspaces combined with geometric averaging.
result The method achieves competitive AUC scores and is interpretable.
DS-UI improves DNN uncertainty inference by combining a DNN classifier with MoGMM.
problem Improving uncertainty inference in DNN-based image recognition.
method Combines DNN classifier with MoGMM for probabilistic interpretation of features.
result DS-UI outperforms state-of-the-art UI methods in misclassification detection.
Multi-task learning leverages shared information among data sets to improve the learning performance of individual tasks. The paper applies this framework for data where each task is a phase-shifted periodic time series. In particular, we develop a novel Bayesian nonparametric model capturing a mixture of Gaussian proc…
Combines historical and market data for better portfolio selection.
problem Improving portfolio selection through diverse information integration.
method Bayesian learning via Gaussian mixture model to harmonize historical and market data.
result The method enhances forecasting accuracy and robustness across various capital markets.
The paper tackles flexible modeling of constrained multimodal data.
problem Flexible modeling of multimodal data on constrained spaces.
method Algorithm based on rejection sampling and data augmentation.
result Improved flexibility and applicability of mixture models to constrained spaces.