Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

End of the M-step derivation

In course

MATH-412: Statistical machine learning

A course on statistical machine learning for supervised and unsupervised learning ...

Description

This lecture covers the derivation of the M-step for mu_k and Sigma_k, focusing on the gradient, sum, inverse, and likelihood. The slides present formulas and expressions step by step, highlighting the key quantities and the trace of the matrices involved.

Instructor

Yoav Zemel

Official source

Related concepts (28)

Likelihood function

In statistical inference, the likelihood function quantifies the plausibility of parameter values characterizing a statistical model in light of observed data. Its most typical usage is to compare possible parameter values (under a fixed set of observations and a particular model), where higher values of likelihood are preferred because they correspond to more probable parameter values.

Likelihood principle

In statistics, the likelihood principle is the proposition that, given a statistical model, all the evidence in a sample relevant to model parameters is contained in the likelihood function. A likelihood function arises from a probability density function considered as a function of its distributional parameterization argument.

Trace class

In mathematics, specifically functional analysis, a trace-class operator is a linear operator for which a trace may be defined, such that the trace is a finite number independent of the choice of basis used to compute the trace. This trace of trace-class operators generalizes the trace of matrices studied in linear algebra. All trace-class operators are compact operators. In quantum mechanics, mixed states are described by density matrices, which are certain trace class operators.

Trace (linear algebra)

In linear algebra, the trace of a square matrix A, denoted tr(A), is defined to be the sum of elements on the main diagonal (from the upper left to the lower right) of A. The trace is only defined for a square matrix (n × n). It can be proven that the trace of a matrix is the sum of its (complex) eigenvalues (counted with multiplicities). It can also be proven that tr(AB) = tr(BA) for any two matrices A and B. This implies that similar matrices have the same trace.

Pauli matrices

In mathematical physics and mathematics, the Pauli matrices are a set of three 2 × 2 complex matrices which are Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma (σ), they are occasionally denoted by tau (τ) when used in connection with isospin symmetries. These matrices are named after the physicist Wolfgang Pauli. In quantum mechanics, they occur in the Pauli equation which takes into account the interaction of the spin of a particle with an external electromagnetic field.

Related lectures (34)

Likelihood Ratio Test: Detection & Estimation

Covers the likelihood ratio test for detection and estimation in statistical analysis.

Likelihood Ratio Test: Hypothesis Testing

Covers the Likelihood Ratio Test and hypothesis testing methods using Maximum Likelihood Estimators.

Linear Algebra: Matrices and Operations

Introduces key concepts in linear algebra, including matrices, operations, and numerical invariants.

Likelihood of a spike train MOOC: Neuronal Dynamics - Computational Neuroscience of Single Neurons

Discusses the likelihood of spike trains based on generative models and log-likelihood calculations from observed data.

Maximum Likelihood Estimation: Multivariate Statistics