Skip to main content
added 58 characters in body
Source Link
Brian Spiering
  • 22.3k
  • 2
  • 28
  • 113

Not all the parameters (e.g., the assignment parameters) for a Gaussian mixture model are smoothly differentiablesmoothly differentiable, thus can not be fit with gradient descent.

Other use cases for the expectation–maximization (EM) algorithm are:

  • Clustering
  • Latent variable estimation
  • Missing data estimation

Not all the parameters (e.g., the assignment parameters) for a Gaussian mixture model are smoothly differentiable, thus can not be fit with gradient descent.

Other use cases for expectation–maximization (EM) algorithm are:

  • Clustering
  • Latent variable estimation
  • Missing data estimation

Not all the parameters (e.g., the assignment parameters) for a Gaussian mixture model are smoothly differentiable, thus can not be fit with gradient descent.

Other use cases for the expectation–maximization (EM) algorithm are:

  • Clustering
  • Latent variable estimation
  • Missing data estimation
Source Link
Brian Spiering
  • 22.3k
  • 2
  • 28
  • 113

Not all the parameters (e.g., the assignment parameters) for a Gaussian mixture model are smoothly differentiable, thus can not be fit with gradient descent.

Other use cases for expectation–maximization (EM) algorithm are:

  • Clustering
  • Latent variable estimation
  • Missing data estimation