Regularized EM algorithm

2023-03-27 · Pierre Houdouin, Esa Ollila, Frederic Pascal

Expectation-Maximization (EM) algorithm is a widely used iterative algorithm for computing (local) maximum likelihood estimate (MLE). It can be used in an extensive range of problems, including the clustering of data based on the Gaussian mixture model (GMM). Numerical instability and convergence problems may arise in situations where the sample size is not much larger than the data dimensionality. In such low sample support (LSS) settings, the covariance matrix update in the EM-GMM algorithm may become singular or poorly conditioned, causing the algorithm to crash. On the other hand, in many signal processing problems, a priori information can be available indicating certain structures for different cluster covariance matrices. In this paper, we present a regularized EM algorithm for GMM-s that can make efficient use of such prior knowledge as well as cope with LSS situations. The method aims to maximize a penalized GMM likelihood where regularized estimation may be used to ensure positive definiteness of covariance matrix updates and shrink the estimators towards some structured target covariance matrices. We show that the theoretical guarantees of convergence hold, leading to better performing EM algorithm for structured covariance matrix models or with low sample settings.

📄 PDF Abstract BibTeX arXiv:2303.14989

Code (0)

등록된 구현이 없습니다.

Bridging the Gap between Newton-Raphson Method and Regularized Policy Iteration

2023-10-11 · Zeyang Li, Chuxiong Hu, Yunan Wang, Guojian Zhan 외

Regularization is one of the most important techniques in reinforcement learning algorithms. The well-known soft actor-critic algorithm is a special case of regularized policy iteration where the regularizer is chosen as…

Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spaces

2018-03-12 · ICML 2018 7 · Junhong Lin, Volkan Cevher

We investigate regularized algorithms combining with projection for least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space. We prove convergence r…

regression

Learning Regularized Monotone Graphon Mean-Field Games

2023-10-12 · NeurIPS 2023 11

This paper studies two fundamental problems in regularized Graphon Mean-Field Games (GMFGs). First, we establish the existence of a Nash Equilibrium (NE) of any $\lambda$-regularized GMFG (for $\lambda\geq 0$). This resu…

On the Convergence of Approximate and Regularized Policy Iteration Schemes

2019-09-20 · Elena Smirnova, Elvis Dohmatob

Entropy regularized algorithms such as Soft Q-learning and Soft Actor-Critic, recently showed state-of-the-art performance on a number of challenging reinforcement learning (RL) tasks. The regularized formulation modifie…

Q-Learning Reinforcement Learning Reinforcement Learning (RL)

Distributed Stochastic Optimization of the Regularized Risk

2014-06-17 · Shin Matsushima, Hyokun Yun, Xinhua Zhang, S. V. N. Vishwanathan

Many machine learning algorithms minimize a regularized risk, and stochastic optimization is widely used for this task. When working with massive data, it is desirable to perform stochastic optimization in parallel. Unfo…

Stochastic Optimization