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

Lecture

HMM - Applications to Robotics

In course

MICRO-455: Machine learning I

Description

This lecture covers the Bayesian extension of Hidden Markov Models (HMM) to automatically segment and model sequences of actions in robots trained for cooking tasks. It discusses the limitations of classical finite HMMs for segmentation, the use of Bayesian Non-Parametrics for HMMs, and the Hierarchical Dirichlet Process prior on the transition matrix. The lecture also explores the segmentation of continuous motion capture data into motion categories and the learning of complex sequential tasks from demonstration, using a pizza dough rolling case study.

Instructor

Aude Billard

Official source

Related concepts (32)

Hidden Markov model

A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process — call it — with unobservable ("hidden") states. As part of the definition, HMM requires that there be an observable process whose outcomes are "influenced" by the outcomes of in a known way.

Markov model

In probability theory, a Markov model is a stochastic model used to model pseudo-randomly changing systems. It is assumed that future states depend only on the current state, not on the events that occurred before it (that is, it assumes the Markov property). Generally, this assumption enables reasoning and computation with the model that would otherwise be intractable. For this reason, in the fields of predictive modelling and probabilistic forecasting, it is desirable for a given model to exhibit the Markov property.

Markov chain

A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC).

Markov property

In probability theory and statistics, the term Markov property refers to the memoryless property of a stochastic process, which means that its future evolution is independent of its history. It is named after the Russian mathematician Andrey Markov. The term strong Markov property is similar to the Markov property, except that the meaning of "present" is defined in terms of a random variable known as a stopping time. The term Markov assumption is used to describe a model where the Markov property is assumed to hold, such as a hidden Markov model.

Bayesian inference

Bayesian inference (ˈbeɪziən or ˈbeɪʒən ) is a method of statistical inference in which Bayes' theorem is used to update the probability for a hypothesis as more evidence or information becomes available. Bayesian inference is an important technique in statistics, and especially in mathematical statistics. Bayesian updating is particularly important in the dynamic analysis of a sequence of data. Bayesian inference has found application in a wide range of activities, including science, engineering, philosophy, medicine, sport, and law.

Related lectures (51)

Hidden Markov Models: Primer

Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.

Hidden Markov Models (HMM): Theory

Covers Hidden Markov Models (HMM) for modeling time series data and decoding using the Viterbi Algorithm.

Markov Chains and Algo Applications

Covers Markov chains, Metropolis algorithm, Glauber dynamics, and heat bath dynamics.

Dirichlet-Multinomial Model

Discusses the Dirichlet distribution, Bayesian inference, posterior mean and variance, conjugate priors, and predictive distribution in the Dirichlet-Multinomial model.

Markov Chains: Ergodicity and Stationary Distribution