NEW COURSE

CS/CNS/EE 156 B

Learning Systems
Spring 2000

http://www.vision.caltech.edu/welling/class/LearningSystemsB.html


Instructor: Max Welling     welling@vision.caltech.edu
TA: Silvio Savarese           savarese@vision.caltech.edu
        Savvas Koudounas     savvas@caltech.edu
Place and time: 070 Moore, Wednesday/Friday, 9.00-10.30 AM
prerequisites: Ma2 or equivalent
Units: 9 (3-0-6)



Description:

This class will introduce some widely used latent variable models in engineering. Among others we will discuss
PCA, ICA, Factor Analysis, K-means, Mixture of Gaussians, Generative Topographic Mapping, Cluster Weighted Models,  Mixture of Experts, Kalman Filter,  HMM, Helmholtz Machine, Boltzman Machine. It will be shown that most of the learning schemes for these models can be understood as versions of the Expectation Maximization (EM) algorithm, thus providing a unified view.

Students are expected to implement a rudimentary MATLAB version for some of the models and discuss this in class.
The final project will consist of a study of a recent paper and the implementation a more involved model.



Homeworks and Policy:

- 4 homework problem sets (15% each)
- One final project (40%)
- Homeworks will be published on this web page as soon as available.
- No midterm, no final
- Two or more students can collaborate on any homework, but every student is expected to hand in his/her own answers.



Downloads & Links  (last update  May 1st)

Syllabus  (last update April 28)         - Baysian Learning   (demo_Bayes.m )
        - MAP Estimation    (demo_MAP.m , plotGauss1D.m )
        - Maximum LikelihoodEstimation   ( demo_ML.m , ginput2.mplotGauss.m)
        - MLD.         - EM derivation
        - Example 1   ( demo_EM.m )
        - Generalization
        - Example 2
          - Mixture of Gaussians (MoG)  Download area
        - Vector Quantization/K-means (VQ)
          - Principal Component Analysis (PCA)   (demo_pca.m)
        - Probabilistic PCA
        - Factor Analysis (FA)   ( FA.m )
        - Independent Component Analysis (ICA)
          - Cluster-Weighted Modelling
        - Mixture of Experts (MoE)
          - Hidden markov models (HMM)  -   Download area
        - Kalman filter ( demo_KF.m)  -  Download area
          - Laplace approximation
        - Variational approximation
        - Sampling methods: importance sampling,  rejection sampling,  condensation
        - Markov Chain Monte Carlo (MCMC), Gibbs sampling
          - Helmholtz machine
        - Boltzman machine
        - Belief propagation
          - leftovers & summary
 



Homeworks & Projects:
 

Available Projects:

Below follow some suggestions for possible projects. Only  the first two contain detailed  derivations.
For the other ones, you may want to do a search in the web, or visit the labs (between brackets)
to look for papers. The links to most labs are given above (under Links & Download).
You can also find some interesting datasets there. You are very welcome to suggest your own
datasets or method. The general idea is that you study a statistical model from the literature,
implement it and test it on a real world dataset.
 



 Literature:

California Institute of Technology, Pasadena, CA 91125.